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
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)
Frontier between decidability and undecidability: a survey
Theoretical Computer Science - Special issue on universal machines and computations
On quasi-unilateral universal Turing machines
Theoretical Computer Science
A new kind of science
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)
The complexity of small universal Turing machines: A survey
Theoretical Computer Science
Small Semi-Weakly Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Four small 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
Inclusion problems for patterns with a bounded number of variables
DLT'10 Proceedings of the 14th international conference on Developments in language theory
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
Small Semi-Weakly Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Inclusion problems for patterns with a bounded number of variables
Information and Computation
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Hi-index | 0.00 |
We present universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (15, 2). These machines simulate our new variant of tag system, the bi-tag system and are the smallest known single-tape universal Turing machines with 5, 4, 3 and 2-symbols, respectively. Our 5-symbolmachine uses the same number of instructions (22) as the smallest known universal Turing machine by Rogozhin. Also, all of the universalmachines we present here simulate Turing machines in polynomial time.