Author:
Neary Turlough,Woods Damien
Publisher
Springer Berlin Heidelberg
Reference112 articles.
1. Aanderaa, S., Fischer, P.C.: The solvability of the halting problem for 2-state post machines. Journal of the Association for Computing Machinery 14(4), 677–682 (1967)
2. Aaronson, S.: Book review: A new kind of science. Quantum Information and Computation 2(5), 410–423 (2002)
3. Baiocchi, C.: 3N+1, UTM e tag-system. Technical Report Pubblicazione 98/38, Dipartimento di Matematico, Università di Roma (1998) (in Italian)
4. Lecture Notes in Computer Science;C. Baiocchi,2001
5. Bennett, C.H.: Logical reversibility of computation. IBM Journal of Research and Development 17(6), 525–532 (1973)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A weakly universal cellular automaton in the heptagrid of the hyperbolic plane;International Journal of Parallel, Emergent and Distributed Systems;2023-08-27
2. Rescue to the Curse of universality;Science China Information Sciences;2023-08-02
3. Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami;International Journal of Foundations of Computer Science;2021-04-23
4. Parsimonious Computational Completeness;Developments in Language Theory;2021
5. Small Universal Reversible Counter Machines;Reversibility and Universality;2018