Small deterministic Turing machines

Theoretical Computer Science

Volumn 168, Issue 2, 1996, Pages 241-255

  Kudlek, Manfred ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; CONTEXT FREE LANGUAGES; CONTEXT SENSITIVE LANGUAGES; EQUIVALENCE CLASSES; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

DETERMINISTIC TURING MACHINES (DTM); REGULAR SETS;

TURING MACHINES;

EID: 0030284012     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00078-3     Document Type: Article

References (10)

1. V. Diekert and M. Kudlek, Small deterministic Turing machines, Papers on Automata and Languages, Dept. of Math., Karl Marx Univ. of Economics, Budapest, 1988-4, (1989) 77-87.
2. G.T. Herman, The Halting problem of one state Turing machines with n-dimensional tape, Z. Math. Logik Grundl. Math. 14 (1968) 185-191.
3. P. Michel, Busy beaver competition and Collatz-like problems, Arch. Math. Logic 32 (1993) 351-367.
4. M.I. Minsky, Size and structure of universal Turing machines using tag systems, in: Recursive Function Theory, Symposia in Pure Mathematics Vol. 5 (AMS, Providence, RI, 1962) 229-238.
5. M.I. Minsky, Computation. Finite and Infinite Machines (Prentice-Hall, Englewood Cliffs, NJ, 1967-1972).
6. L.M. Pavlockaya, Dostatočnye usloviya razrešimosti problemy ostanovki dlya mašin Tyuringa, Problemy Kibernetiki 33 (1978) 91-118.
7. Yu.V. Rogozhin, Sem' universal'nyh mašin Tyuringa, Matematičeskie Issledovaniya 69 (1982) 76-90.
8. Yu.V. Rogozhin, Universal'naya mašina Tyuringa s 10 sostayaniyah i 3 simbolami, Izvestiya Akademii Nauk Respubliki Moldova Matematika (10) (1992) 80-82.
9. Yu.V. Rogozhin, On the notion of universality and Shannon's problem for Turing machines, Presented at MCU/UMC'95, Paris.
10. S. Watanabe, 5-symbol 8-state and 5-symbol 6-state universal Turing machines, J. ACM 8 (1961) 476-483.