Small fast universal Turing machines

Theoretical Computer Science

Volumn 362, Issue 1-3, 2006, Pages 171-195

  Neary, Turlough ^a   Woods, Damien ^b  

^a NATIONAL UNIVERSITY OF IRELAND   (Ireland)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

Computational complexity; Polynomial time; Small universal Turing machine; Universality

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; POLYNOMIALS;

POLYNOMIAL TIME; SMALL UNIVERSAL TURING MACHINE;

SEQUENTIAL MACHINES;

EID: 33748520544     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.06.002     Document Type: Article

References (16)

1. Baiocchi C. Three small universal Turing machines. In: Margenstern M., and Rogozhin Y. (Eds). Machines, Computations, and Universality, Lecture Notes in Computer Science Vol. 2055 (2001), MCU, Springer, Chişinǎu, Moldova 1-10
2. Cocke J., and Minsky M. Universality of tag systems with P = 2. J. Assoc. Comput. Mach. 11 1 (1964) 15-20
3. Cook M. Universality in elementary cellular automata. Complex Systems 15 1 (2004) 1-40
4. G. Hermann, The uniform halting problem for generalized one state Turing machines, in: Proceedings, Ninth Annual Symposium on Switching and Automata Theory, IEEE Computer Society Press, Schenectady, New York, 1968, pp. 368-372.
5. Hopcroft J.E., and Ullman J.D. Introduction to Automata Theory, Languages, and Computation (1979), Addison-Wesley, Reading, MA
6. Ikeno N. A 6-symbol 10-state universal Turing machine. Proc. Instit. of Electrical Communications. Tokyo (1958)
7. Kudlek M. Small deterministic Turing machines. Theoret. Comput. Sci. 168 2 (1996) 241-255
8. Kudlek M., and Rogozhin Y. A universal Turing machine with 3 states and 9 symbols. In: Kuich W., Rozenberg G., and Salomaa A. (Eds). Developments in Language Theory, DLT 2001, Lecture Notes in Computer Science Vol. 2295 (2002), DLT, Springer, Vienna 311-318
9. M. Minsky, Size and structure of universal Turing machines using tag systems, in: Recursive Function Theory, Symp. in Pure Mathematics, Vol. 5, American Mathematical Society, Providence, RI, 1962, pp. 229-238.
10. Pavlotskaya L. Solvability of the halting problem for certain classes of Turing machines. Math. Notes (Springer) 13 6 (1973) 537-541
11. L. Pavlotskaya, Dostatochnye uslovija razreshimosti problemy ostanovki dlja mashin T'juring, Problemi kibernetiki, Vol. 33, Moskva, Naukva, 1978, pp. 91-118 (Sufficient conditions for the halting problem decidability of Turing machines) (in Russian).
12. Rogozhin Y. Small universal Turing machines. Theoret. Comput. Sci. 168 2 (1996) 215-240
13. Shannon C.E. A universal Turing machine with two internal states. Automata Stud. Ann. Math. Stud. 34 (1956) 157-165
14. Sipser M. Introduction to the Theory of Computation (1997), PWS, Boston
15. van Emde Boas P. Machine models and simulations. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science Vol. A (1990), Elsevier, Amsterdam 1-66 (Chapter 1)
16. Watanabe S. 5-symbol 8-state and 5-symbol 6-state universal Turing machines. J. Assoc. Comput. Mach. 8 4 (1961) 476-483