Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
Small deterministic Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
On machines, universal by extensions
Theoretical Computer Science - Special issue on universal machines and computations
Proceedings of the workshop on Lattice dynamics
A Variant to Turing's Theory of Computing Machines
Journal of the ACM (JACM)
5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
Journal of the ACM (JACM)
Universality of Tag Systems with P = 2
Journal of the ACM (JACM)
On Formalisms for Turing Machines
Journal of the ACM (JACM)
The Solvability of the Halting Problem for 2-State Post Machines
Journal of the ACM (JACM)
Frontier between decidability and undecidability: a survey
Theoretical Computer Science - Special issue on universal machines and computations
Nine switch-affine neurons suffice for turing universality
Neural Networks
On quasi-unilateral universal Turing machines
Theoretical Computer Science
A new kind of science
Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
The Quest for Small Universal Cellular Automata
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality
LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
A Universal Turing Machine with 3 States and 9 Symbols
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
A simplified universal Turing machine
ACM '52 Proceedings of the 1952 ACM national meeting (Toronto)
Universality of (p=2) Tag Systems and a 4 Symbol 7 State Universal Turing Machine
Universality of (p=2) Tag Systems and a 4 Symbol 7 State Universal Turing Machine
Small turing machines and generalized busy beaver competition
Theoretical Computer Science
On the time complexity of 2-tag systems and small universal Turing machines
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Small fast universal turing machines
Theoretical Computer Science
The uniform halting problem for generalized one state turing machines
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
Surprising Areas in the Quest for Small Universal Devices
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical reversibility of computation
IBM Journal of Research and Development
A universal reversible turing machine
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Study of limits of solvability in tag systems
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Four small universal turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Small semi-weakly universal turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Quantum Information & Computation
On the rule complexity of universal tissue p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
P-completeness of cellular automaton rule 110
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Splicing systems for universal turing machines
DNA'04 Proceedings of the 10th international conference on DNA computing
Four Small Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Advances in I/O, Speedup, and Universality on Colossus, an Unconventional Computer
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Small weakly universal turing machines
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Abstract geometrical computation 4: Small Turing universal signal machines
Theoretical Computer Science
The complexity of small universal turing machines: a survey
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Four Small Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Small Semi-Weakly Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
| Hi-index | 5.23 |
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example, it has been an open question for some time as to whether the smallest known universal Turing machines of Minsky, Rogozhin, Baiocchi and Kudlek are efficient (polynomial time) simulators of Turing machines. These are some of the most intuitively simple computational devices and previously the best known simulations were exponentially slow. We discuss recent work that shows that these machines are indeed efficient simulators. As a related result, we also find that Rule 110, a well-known elementary cellular automaton, is also efficiently universal. We also review a large number of old and new universal program size results, including new small universal Turing machines and new weakly, and semi-weakly, universal Turing machines. We then discuss some ideas for future work arising out of these, and other, results.