Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
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
Three Small Universal Turing Machines
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Small turing machines and generalized busy beaver competition
Theoretical Computer Science
Small fast universal turing machines
Theoretical Computer Science
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
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
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)
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
P-completeness of cellular automaton rule 110
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On computational universality in language equations
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
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
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
| Hi-index | 0.00 |
With an UTM(3,9) we present a new small universal Turing machine with 3 states and 9 symbols, improving a former result of an UTM(3,10).