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
Universality of Tag Systems with P = 2
Journal of the ACM (JACM)
A Universal Turing Machine with 3 States and 9 Symbols
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Computation: finite and infinite machines
Computation: finite and infinite machines
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)
Small semi-weakly universal turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Tag systems and Collatz-like functions
Theoretical Computer Science
Reversible computing and cellular automata—A survey
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
How Redundant Is Your Universal Computation Device?
Membrane Computing
Four Small Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Small semi-weakly universal turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
On the complex behavior of simple tag systems-An experimental approach
Theoretical Computer Science
Simplicity via provability for universal prefix-free Turing 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 | 0.00 |
We present small polynomial time universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (18, 2). These machines simulate our new variant of tag system, the bi-tag system and are the smallest known universal Turing machines with 5, 4, 3 and 2-symbols respectively. Our 5-symbol machine uses the same number of instructions (22) as the smallest known universal Turing machine by Rogozhin.