Tag systems and Collatz-like functions
Theoretical Computer Science
The Complexity of Small Universal Turing Machines
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
On the Computational Complexity of Spiking Neural P Systems
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Surprising Areas in the Quest for Small Universal Devices
Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of small universal Turing machines: A survey
Theoretical Computer Science
Four Small Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
A universal reversible turing machine
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
Small weakly universal turing machines
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Solvability of the Halting and Reachability Problem for Binary 2-tag Systems
Fundamenta Informaticae
Abstract geometrical computation 4: Small Turing universal signal machines
Theoretical Computer Science
On the complex behavior of simple tag systems-An experimental approach
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
Hi-index | 0.00 |
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing machines in polynomial time. This is an exponential improvement on the previously known simulation time overhead and improves a forty year old result in the area of small universal Turing machines.