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
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
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)
Four small universal turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
P-completeness of cellular automaton rule 110
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
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
The complexity of small universal Turing machines: A survey
Theoretical Computer Science
How Redundant Is Your Universal Computation Device?
Membrane Computing
Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
Theoretical Computer Science
Four small universal turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
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
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
Small Semi-Weakly Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
| Hi-index | 0.01 |
We present two small universal Turing machines that have 3 states and 7 symbols, and 4 states and 5 symbols respectively. These machines are semi-weak which means that on one side of the input they have an infinitely repeated word and on the other side there is the usual infinitely repeated blank symbol. This work can be regarded as a continuation of early work by Watanabe on semi-weak machines. One of our machines has only 17 transition rules making it the smallest known semi-weakly universal Turing machine. Interestingly, our two machines are symmetric with Watanabe's 7-state and 3-symbol, and 5-state and 4-symbol machines, even though we use a different simulation technique.