Four small universal Turing machines

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

Volumn 4664 LNCS, Issue , 2007, Pages 242-254

  Neary, Turlough ^a   Woods, Damien ^b  

^a NATIONAL UNIVERSITY OF IRELAND   (Ireland)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; POLYNOMIALS;

BI-TAG SYSTEM; STATE-SYMBOL PAIRS;

TURING MACHINES;

EID: 37349099678     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74593-8_21     Document Type: Conference Paper

References (19)

1. Baiocchi, C.: Three small universal Turing machines. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 1-10. Springer, Heidelberg (2001)
2. Cocke, J., Minsky, M.: Universality of tag systems with P = 2. Journal of the ACM 11(1), 15-20 (1964)
3. Hermann, G.: The uniform halting problem for generalized one state Turing machines. In: Proceedings, Ninth Annual Symposium on Switching and Automata Theory, New York, October 1968, pp. 368-372. IEEE, Los Alamitos (1968)
4. Kudlek, M.: Small deterministic Turing machines. Theoretical Computer Science 168(2), 241-255 (1996)
5. 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)
6. 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)
7. Minsky, M.: Size and structure of universal Turing machines using tag systems. In: Recursive Function Theory, Symposium in Pure Mathematics, Provelence, vol. 5, pp. 229-238. AMS (1962)
8. Minsky, M.: Computation, finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)
9. Neary, T.: Small polynomial time universal Turing machines. In: Hurley, T., Seda, A., et al. (eds.) 4th Irish Conference on the Mathematical Foundations of Computer Science and Information Technology(MFCSIT), Cork, Ireland, August 2006, pp. 325-329 (2006)
10. Neary, T., Woods, D.: A small fast universal Turing machine. Technical Report NUIM-CS-TR-2005-12, National university of Ireland, Maynooth (2005)
11. Neary, T., Woods, D.: Small fast universal Turing machines. Theoretical Computer Science 362(1-3), 171-195 (2006)
12. Pavlotskaya, L.: Solvability of the halting problem for certain classes of Turing machines. Mathematical Notes (Springer) 13(6), 537-541 (1973)
13. Pavlotskaya, L.: Dostatochnye uslovija razreshimosti problemy ostanovki dlja mashin T'juring. Problemi kibernetiki, 91-118 (1978) (Sufficient conditions for the halting problem decidability of Turing machines) (in Russian))
14. Robinson, R.: Minsky's small universal Turing machine. International Journal of Mathematics 2(5), 551-562 (1991)
15. Rogozhin, Y.: Small universal Turing machines. Theoretical Computer Science 168(2), 215-240 (1996)
16. Shannon, CE.: A universal Turing machine with two internal states. Automata Studies, Annals of Mathematics Studies 34, 157-165 (1956)
17. Woods, D., Neary, T.: On the time complexity of 2-tag systems and small universal Turing machines. In: FOCS. 47th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, California, October 2006, pp. 132-143. IEEE, Los Alamitos (2006)
18. Woods, D., Neary, T.: The complexity of small universal Turing machines. In: Cooper, S.B., Lowe, B., Sorbi, A. (eds.) Computability in Europe 2007. CIE, Sienna, Italy, June 2007. LNCS, vol. 4497, pp. 791-798. Springer, Heidelberg (2007)
19. Woods, D., Neary, T.: Small semi-weakly universal Turing machines. In: Durand-Lose, J., Margenstern, M. (eds.) Machines, Computations, and Universality (MCU), Orélans, France, September 2007. LNCS, vol. 4664, pp. 306-323. Springer, Heidelberg (2007)