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

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 439-446

  Woods, Damien ^a   Neary, Turlough ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b NATIONAL UNIVERSITY OF IRELAND   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; POLYNOMIALS; TURING MACHINES;

2-TAG SYSTEMS; POLYNOMIAL TIME;

COMPUTATIONAL COMPLEXITY;

EID: 38749087958     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.58     Document Type: Conference Paper

References (27)

1. C. Baiocchi. Three small universal Turing machines. In Machines, Computations, and Universality (MCU), volume 2055 of LNCS, pages 1-10, Chişinǎu, Moldova, May 2001. Springer.
2. J. Cocke and M. Minsky. Universality of tag systems with P = 2. Journal of the ACM, 11(1):15-20, Jan. 1964.
3. M. Cook. Universality in elementary cellular automata. Complex Systems, 15(1):1-40, 2004.
4. S. Cook. The solvability of the derivability problem for one-normal systems. Journal of the ACM, 13(2):223-225, Apr. 1966.
5. G. T. Hermann. The uniform halting problem for generalized one state Turing machines. In Proceedings of the ninth annual Symposium on Switching and Automata Theory (FOCS), pages 368-372, Schenectady, New York, Oct. 1968. IEEE Computer Society Press.
6. N. Ikeno. A 6-symbol 10-state universal Turing machine. In Proceedings, Institute of Electrical Communications, Tokyo, 1958.
7. M. Kudlek. Small deterministic Turing machines. Theoretical Computer Science, 168(2):241-255, 1996.
8. M. Kudlek and Y. Rogozhin. A universal Turing machine with 3 states and 9 symbols. In Developments in Language Theory (DLT), volume 2295 of LNCS, pages 311-318, Vienna, May 2001. Springer.
9. L. A. Levin and R. Venkatesan. An average case NP-complete graph problem. arXiv:cs. CC/0112001, v2, 2002.
10. K. Lindgren and M. G. Nordahl. Universal computation in simple one-dimensional cellular automata. Complex Systems, 4(3):299-318, 1990.
11. M. Margenstern. Non-erasing Turing machines: A frontier between a decidable halting problem and universality. In Fundamentals of Computation Theory (FCT), volume 710 of LNCS, pages 375-385. Springer, 1993.
12. M. Margenstern. Non-erasing Turing machines: a new frontier between a decidable halting problem and universality. In LATIN, volume 911 of LNCS, pages 386-397. Springer, Apr. 1995.
13. M. Margenstern. Results on the halting problem. In LMPS'95, Florence, Aug. 1995.
14. M. Margenstern. Frontier between decidability and undecidability: a survey. Theoretical Computer Science, 231(2):217-251, Jan. 2000.
15. M. Minsky. Size and structure of universal Turing machines using tag systems. In Recursive Function Theory: Proceedings, Symposium in Pure Mathematics, volume 5, pages 229-238, Provelence, 1962. AMS.
16. T. Neary and D. Woods. P-completeness of cellular automaton Rule 110. In International Colloquium on Automata Languages and Programming (ICALP), volume 4051 of LNCS, pages 132-143. Springer, July 2006.
17. T. Neary and D. Woods. Small fast universal Turing machines. Theoretical Computer Science, 2006. Accepted.
18. L. Pavlotskaya. Solvability of the halting problem for certain classes of Turing machines. Mathematical Notes (Springer), 13(6):537-541, June 1973.
19. L. Pavlotskaya. Dostatochnye uslovija razreshimosti problemy ostanovki dlja mashin T'juring. Problemi Kiberneti, 33:91-118, 1978. (Sufficient conditions for the halting problem decidability of Turing machines) (in Russian).
20. E. Post. Formal reductions of the combinatorial decision problem. Amer. Journal of Math., 65:197-215, 1943.
21. R. M. Robinson. Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae, 12(3): 177-209, 1971.
22. R. M. Robinson. Minsky's small universal Turing machine. International Journal of Mathematics, 2(5):551-562, 1991.
23. Y. Rogozhin. Small universal Turing machines. Theoretical Computer Science, 168(2):215-240, 1996.
24. C. E. Shannon. A universal Turing machine with two internal states. Automata Studies, Annals of Mathematics Studies, 34:157-165, 1956.
25. R. Venkatesan and L. Levin. Random instances of a graph coloring problem are hard. In Proceedings of the twentieth annual ACM symposium on Theory of computing (STOC), pages 217-222, Chicago, Illinois, 1988. ACM.
26. H. Wang. Tag systems and lag systems. Math Annalen, 152:65-74, 1963.
27. S. Watanabe. 5-symbol 8-state and 5-symbol 6-state universal Turing machines. Journal of the ACM, 8(4):476-483, Oct. 1961.