Small universal Turing machines

Theoretical Computer Science

Volumn 168, Issue 2, 1996, Pages 215-240

  Rogozhin, Yurii ^a  

^a INSTITUTE OF CHEMISTRY   (Moldova)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; THEOREM PROVING;

UNIVERSAL TURING MACHINES (UTM);

TURING MACHINES;

EID: 0030286377     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00077-1     Document Type: Article

References (17)

1. M. Davis, The definition of the universal Turing machine, Proc. Amer. Math. Soc. 8 (1957) 1125-1126.
2. M.D. Davis and E.J. Weyuker, Computability, Complexity, and Languages (Academic Press, New York, 1983).
3. V. Diekert and M. Kudlek, Small deterministic Turing machines, Papers on Automata and Languages, Dep. of.Math., Karl Marx Univ. of Economics, Budapest, 188-4, 1989, 77-87.
4. G.T. Herman, A new hierarchy of elementary functions, Proc. Amer. Math. Soc. 20 (1969) 557-562.
5. M. Kudlek, Small deterministic Turing machines, Theoret. Comput. Sci. 168 (this Vol.) (1996) 241-255.
6. A.I. Maltsev, The Algorithms and Recursive Functions (Moskva, Nauka, 2nd ed., 1986) (Russian).
7. M. Margenstern, Non erasing Turing machines: a frontier between a decidable halting problem and universality, in: Proc. FCT'93, Lecture Notes in Computer Science, Vol. 710 (1993) 375-385.
8. M.L. Minsky, Size and structure of universal Turing machines using tag systems, in: Recursive Function Theory, Symp. in Pure Mathematics, Vol. 5 (Amer. Mathematical Soc., Provelence, RS, 1962) 229-238.
9. A. Nozaki, On notion of universality of turing machine, Kybernetika 5 (1969) 29-12.
10. L. M. Pavlotskaya, Problemi kibernetiki, Vol. 33 (Moskva, Nauka, 1978) 91-118 (Russian).
11. L. Priese, Towards a precise characterization of the complexity of the universal and nonuniversal Turing machines, SIAM J. Comput. 8 (1979) 508-523.
12. R.M. Robinson, Minsky's small universal Turing machine, Internat. J. Math. 2 (1991) 551-562.
13. Yu.V. Rogozhin, Seven universal Turing machines, in: Systems and Theoretical Programming, Mat. Issled, no.69, Academiya Nauk Moldavskoi SSR, (Kishinev, 1982) 76-90 (Russian).
14. Yu.V. Rogozhin, A universal Turing machine with 10 states and 3 symbols, Izvestiya Akademii Nauk Respubliki Moldova, Matematika 4 (10) (1992) 80-82 (Russian).
15. Yu.V. Rogozhin, About Shannon's problem for Turing machines, Comput. Sci. J. Moldova 1 3(3) (1993) 108-111.
16. Yu.V. Rogozhin, On the notion of universality and Shannon's problem for Turing machines, MCU/UMC'95, International Workshop 'Universal Machines and Computations', Lecture Abstracts (Paris, 29-31 March 1995), 36-39.
17. C.E. Shannon, A universal Turing machine with two internal states, in: Automata Studies, Ann. Math. Stud., Vol. 34, (Princeton Univ.Press, 1956) Princeton, 157-165.