New small universal circular post machines

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

Volumn 2138, Issue , 2001, Pages 217-226

  Kudlek, Manfred ^a   Rogozhin, Yurii ^b  

^a UNIVERSITY OF HAMBURG   (Germany)

^b INSTITUTE OF CHEMISTRY   (Moldova)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CIRCULAR POST MACHINES; TAG SYSTEMS; UNIVERSAL MACHINES;

COMPUTATION THEORY;

EID: 84974710265     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44669-9_22     Document Type: Conference Paper

References (21)

1. Anderaa, S., Fischer, P.: The Solvability of the Halting Problem for 2-state Post Machines. JACM 14 no. 4 (1967) 677-682.
2. Arbib, M. A.: Theories of Abstract Automata. Prentice Hall, Englewood Cliffs, 1969.
3. Baiocchi, C.: Three Small Universal Turing Machines. LNCS 2055 (2001), Accepted for MCU’2001, to appear.
4. Kudlek, M.: Context Free Normal Systems. Proceedings MFCS’79, LNCS 74 (1979) 346-353.
5. Kudlek, M.: Small deterministic Turing machines. TCS 168-2 (1996) 241-255.
6. Kudlek, M., Rogozhin, Yu.: Small Universal Circular Post Machines. Computer Science Journal of Moldova, 9, no. 10 (2001), Accepted for MCU’2001, to appear.
7. Kudlek, M., Rogozhin, Yu.: A New Small Universal Turing Machine, submitted (2001).
8. Margenstern, M.: Frontier between decidability and undecidability: a survey. TCS 231-2 (2000) 217-251.
9. Minsky, M. L.: Recursive Unsolvability of Posts Problem of ”tag” and Other Topics in the Theory of Turing Machines. Annals of Math. 74 (1961) 437-454.
10. Minsky, M. L.: Size and Structure of universal Turing Machines Using Tag Systems. In Recursive Function Theory, Symposia in Pure Mathematics, AMS 5 (1962) 229-238.
11. Minsky, M. L.: Computation: Finite and Infinite Machines. Prentice Hall International, London, 1972.
12. Nelson, R. J.: Introduction to Automata. John Wiley & Sons, New York, 1968.
13. Pavlotskaya, L.: Sufficient conditions for halting problem decidability of Turing machines. Avtomaty i mashiny (Problemi kibernetiki), Moskva, Nauka 33 (1978) 91-118 (in Russian).
14. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, 1998.
15. Post, E.: Formal Reduction of the General Combinatorial Decision Problem. Amer. Journ. Math. 65 (1943) 197-215.
16. Robinson, R. M.: Minsky’s Small Universal Turing Machine. Intern. Journ. of Math. 2 no. 5 (1991) 551-562.
17. Rogozhin, Yu. V.: Small Universal Turing Machines. TCS 168-2 (1996) 215-240.
18. Rogozhin, Yu.: A Universal Turing Machine with 22 States and 2 Symbols. Romanian Journal of Information Science and Technology 1 no. 3 (1998) 259-265.
19. Shannon, C. E.: A Universal Turing Machine with Two Internal States. In Automata Studies, Ann. Math. Stud. 34, Princeton Uni. Press (1956) 157-165.
20. Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York, 1980.
21. Salomaa, A.: Theory of Automata. Pergamon Press, Oxford, 1969.