A universal turing machine with 3 states and 9 symbols

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

Volumn 2295 LNCS, Issue , 2002, Pages 311-318

  Kudlek, Manfred ^a   Rogozhin, Yurii ^b  

^a UNIVERSITY OF HAMBURG   (Germany)

^b INSTITUTE OF CHEMISTRY   (Moldova)

Author keywords

[No Author keywords available]

Indexed keywords

MACHINERY; COMPUTATIONAL LINGUISTICS;

UNIVERSAL TURING MACHINE;

TURING MACHINES;

EID: 84876907785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46011-x_27     Document Type: Conference Paper

References (14)

1. C. Baiocchi, Three Small Universal Turing Machines. Proc. MCU'2001, ed. M. Margenstern, Yu. Rogozhin, Springer, LNCS 2055, pp. 1-10, 2001.
2. M.D. Davis and E.J.Weyuker, Computability, Complexity, and Languages. Academic Press, Inc., 1983.
3. M. Kudlek, Small deterministic Turing machines. Theoretical Computer Science, Elsevier Science B.V., vol. 168 (2), 1996, pp. 241-255.
4. M. Margenstern, Frontier between decidability and undecidability: A survey. Proc. of 2nd International Colloquium Universal Machines and Computations, vol.1, March 23-27, 1998, Metz, France, pp. 141-177.
5. M.L. Minsky, Size and structure of universal Turing machines using tag systems. Recursive Function Theory, Symp. in pure mathematics, Amer. Math. Soc., 5, 1962, pp. 229-238.
6. Gh. Paun,DNAComputing Based on Splicing: Universality Results. Proc. of 2nd International Colloquium Universal Machines and Computations, vol.1, March 23-27, 1998, Metz, France, pp. 67-91.
7. L.M. Pavlotskaya, Sufficient conditions for halting problem decidability of Turing machines. Avtomati i mashini (Problemi kibernetiki), Moskva, Nauka, 1978, vol. 33, pp. 91-118, (Russian).
8. R.M. Robinson, Minsky's small universal Turing machine. International Journal of Mathematics, vol.2, N.5, 1991, pp. 551-562.
9. Yu. Rogozhin, Seven universal Turing machines. Systems and Theoretical Programming, Mat. Issled. no.69, Academiya Nauk Moldavskoi SSR, Kishinev, 1982, pp. 76-90, (Russian).
10. Yu. Rogozhin,A universal Turing machine with 10 states and 3 symbols. Izvestiya Akademii Nauk Respubliki Moldova, Matematika, 1992, N 4(10), pp. 80-82 (Russian).
11. Yu. Rogozhin, About Shannon's problem for Turing machines. Computer Science Journal of Moldova, vol.1, no 3(3), 1993, pp. 108-111.
12. Yu. Rogozhin, Small universal Turing machines. Theoretical Computer Science, Elsevier Science B.V., vol. 168 (2), 1996, pp. 215-240.
13. Yu. Rogozhin,A Universal Turing Machine with 22 States and 2 Symbols. Romanian Journal of Information Science and Technology, vol. 1, N. 3, 1998, pp. 259-265.
14. C.E. Shannon, A universal Turing machine with two internal states. Automata studies, Ann. of Math. Stud. 34, Princeton, Princeton Univ.Press, 1956, pp. 157-165.