Small fast universal turing machines

Authors:
Turlough Neary;Damien Woods
Affiliations:
TASS Research Group, Department of Computer Science, National University, of Ireland, Maynooth, Ireland;Boole Center for Research in Informatics, School of Mathematics, University College Cork, Ireland
Venue:
Theoretical Computer Science
Year:
2006

Citing 8
Cited 12

Machine models and simulations

Handbook of theoretical computer science (vol. A)
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)
Introduction to the Theory of Computation

Introduction to the Theory of Computation
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
A Universal Turing Machine with 3 States and 9 Symbols

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory

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 small, reduced, and fast universal accepting networks of splicing processors

Theoretical Computer Science
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
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
Abstract geometrical computation 4: Small Turing universal signal machines

Theoretical Computer Science
P-completeness of cellular automaton rule 110

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
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

Quantified Score

Hi-index	5.23

Visualization

Abstract

We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of (3, 11), (5, 7), (6, 6), (7, 5) and (8, 4). These are the smallest known UTMs that simulate Turing machines in polynomial time.