Small weakly universal turing machines

Authors:
Turlough Neary;Damien Woods
Affiliations:
Boole Centre for Research in Informatics, University College Cork, Ireland;Department of Computer Science and Artificial Intelligence, University of Seville, Spain
Venue:
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Year:
2009

Citing 15
Cited 5

Limits to parallel computation: P-completeness theory

Limits to parallel computation: P-completeness theory
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 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
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
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
P-completeness of cellular automaton rule 110

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Abstract geometrical computation 4: Small Turing universal signal machines

Theoretical Computer Science
A simple P-complete problem and its language-theoretic representations

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
Turing patterns with Turing machines: emergence and low-level structure formation

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeated word to the left of their input and another to the right. They simulate Rule 110 and are currently the smallest known weakly universal Turing machines. Despite their small size these machines are efficient polynomial time simulators of Turing machines.