On the time complexity of 2-tag systems and small universal turing machines

On the time complexity of 2-tag systems and small universal turing machines (2006)

Download From

IEEE

Download Links

Other Repositories/Bibliography

DBLP

by Damien Woods , Turlough Neary

Venue:	In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS
Citations:	13 - 7 self

BibTeX

@INPROCEEDINGS{Woods06onthe,
    author = {Damien Woods and Turlough Neary},
    title = {On the time complexity of 2-tag systems and small universal turing machines},
    booktitle = {In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS},
    year = {2006},
    pages = {439--446},
    publisher = {IEEE}
}

Bookmark

OpenURL

Abstract

We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing machines in polynomial time. This is an exponential improvement on the previously known simulation time overhead and improves a forty year old result in the area of small universal Turing machines. 1

Citations

388	A new kind of science - Wolfram
119	Undecidability and Nonperiodicity for Tilings of the Plane - Robinson - 1971
46	Universality in elementary cellular automata - Cook - 2004
44	Universal Computation in Simple One-Dimensional Cellular Automata - Lindgren, Nordahl - 1990
36	Random instances of a graph coloring problem are hard - Venkatesan, Levin - 1988
24	Small universal Turing machines - Rogozhin - 1996
23	A universal Turing machine with two internal states - Shannon - 1956
17	Three small universal Turing machines - Baiocchi - 2001
16	Universality of tag systems with P = 2 - Cocke, Minsky - 1964
16	Size and structure of universal Turing machines using Tag systems - Minsky - 1962
14	Frontier between decidability and undecidability: A survey - Margenstern
14	Small fast universal Turing machines - Neary, Woods - 2006
12	The P-completeness of cellular automaton Rule 110 - Neary, Woods - 2006
10	The uniform halting problem for generalized one state Turing machines - Hermann - 1968
9	Small deterministic Turing machines - Kudlek - 1996
9	A universal Turing machine with 3 states and 9 symbols - Kudlek, Rogozhin - 2002
8	Solvability of the halting problem for certain classes of Turing machines - Pavlotskaya - 1973
8	Dostatochnye uslovija razreshimosti problemy ostanovki dlja mashin T’juring. Problemi kibernetiki - Pavlotskaya - 1978
8	Minsky's small universal Turing machine - Robinson - 1991
8	5-symbol 8-state and 5-symbol 6-state universal Turing machines - Watanabe - 1961
5	A 6-symbol 10-state Universal Turing Machine - Ikeno - 1958
4	Non-erasing Turing machines: A frontier between a decidable halting problem and universality - Margenstern - 1993
3	Non-erasing Turing machines: A new frontier between a decidable halting problem and universality - Margenstern - 1995
3	Formal reductions of the combinatorial decision problem, Am.J.Math.65 - Post - 1943
3	Tag systems and lag systems - Wang - 1963
2	The solvability of the derivability problem for one-normal systems - Cook - 1966
1	An average case NP-complete graph problem - Levin, Venkatesan
1	Results on the halting problem - Margenstern - 1995