Small weakly universal turing machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5699 LNCS, Issue , 2009, Pages 262-273

  Neary, Turlough ^a   Woods, Damien ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b UNIVERSITY OF SEVILLE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL-TIME; SMALL SIZE; UNIVERSAL TURING MACHINE;

COMPUTATION THEORY; MACHINERY; POLYNOMIAL APPROXIMATION;

TURING MACHINES;

EID: 70350625326     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03409-1_24     Document Type: Conference Paper

References (28)

1. Baiocchi, C.: 3N+1, UTM e tag-system. Technical Report Pubblicazione 98/38, Dipartimento di Matematico, Università di Roma (1998) (in Italian)
2. Baiocchi, C.: Three small universal Turing machines. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 1-10. Springer, Heidelberg (2001)
3. Cocke, J., Minsky, M.: Universality of tag systems with P = 2. Journal of the ACM 11(1), 15-20 (1964)
4. Cook, M.: Universality in elementary cellular automata. Complex Systems 15(1), 1-40 (2004)
5. Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to parallel computation: Pcompleteness theory. Oxford University Press, Oxford (1995)
6. Hermann, G.: The uniform halting problem for generalized one state Turing machines. In: Proceedings, Ninth Annual Symposium on Switching and Automata Theory (FOCS), pp. 368-372. IEEE, New York (1968)
7. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading (1979)
8. Kudlek, M.: Small deterministic Turing machines. Theoretical Computer Science 168(2), 241-255 (1996)
9. Kudlek, M., Rogozhin, Y.: A universal Turing machine with 3 states and 9 symbols. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 311-318. Springer, Heidelberg (2002)
10. Margenstern, M.: Frontier between decidability and undecidability: A survey. Theoretical Computer Science 231(2), 217-251 (2000)
11. Margenstern, M., Pavlotskaya, L.: On the optimal number of instructions for universality of Turing machines connected with a finite automaton. International Journal of Algebra and Computation 13(2), 133-202 (2003)
12. Michel, P.: Small Turing machines and the generalized busy beaver competition. Theoretical Computer Science 326(1-3), 45-56 (2004)
13. Minsky, M.: A 6-symbol 7-state universal Turing machines. Technical Report 54-G-027, MIT (1960)
14. Minsky, M.: Size and structure of universal Turing machines using tag systems. In: Recursive Function Theory, Proceedings, Symposium in Pure Mathematics, vol. 5, pp. 229-238. AMS, Provelence (1962)
15. Neary, T.: Small universal Turing machines. PhD thesis, Department of Computer Science, National University of Ireland, Maynooth (2008)
16. Neary, T., Woods, D.: P-completeness of cellular automaton Rule 110. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 132-143. Springer, Heidelberg (2006)
17. Neary, T., Woods, D.: Four small universal Turing machines. Fundamenta Informaticae 91(1), 123-144 (2009)
18. Pavlotskaya, L.: Solvability of the halting problem for certain classes of Turing machines. Mathematical Notes (Springer) 13(6), 537-541 (1973)
19. Pavlotskaya, L.: Dostatochnye uslovija razreshimosti problemy ostanovki dlja mashin T'juring. Problemi kibernetiki, 91-118 (1978) (in Russian)
20. Priese, L.: Towards a precise characterization of the complexity of universal and non-universal Turing machines. Siam journal of Computing 8(4), 508-523 (1979)
21. Rogozhin, Y.: Small universal Turing machines. Theoretical Computer Science 168(2), 215-240 (1996)
22. Shannon, C.E.: A universal Turing machine with two internal states. Automata Studies, Annals of Mathematics Studies 34, 157-165 (1956)
23. Watanabe, S.: 5-symbol 8-state and 5-symbol 6-state universal Turing machines. Journal of ACM 8(4), 476-483 (1961)
24. Watanabe, S.: 4-symbol 5-state universal Turing machine. Information Processing Society of Japan Magazine 13(9), 588-592 (1972)
25. Wolfram, S.: A new kind of science. Wolfram Media, Champaign (2002)
26. Woods, D., Neary, T.: On the time complexity of 2-tag systems and small universal Turing machines. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 439-448. IEEE, New York (2006)
27. Woods, D., Neary, T.: The complexity of small universal Turing machines: A survey. Theoretical Computer Science 410(4-5), 443-450 (2009)
28. Woods, D., Neary, T.: Small semi-weakly universal Turing machines. Fundamenta Informaticae 91(1), 179-195 (2009)