Decidability and undecidability of the halting problem on turing machines, a survey

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

Volumn 1234, Issue , 1997, Pages 226-236

  Margenstern, Maurice ^a,b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; MACHINERY; SURVEYS;

HALTING PROBLEMS; NEW APPROACHES; PAPER SURVEYS; UNDECIDABILITY; UNIVERSAL TURING MACHINE;

TURING MACHINES;

EID: 21744452251     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63045-7_23     Document Type: Conference Paper

References (21)

1. Diekert V. and Kudlek M. Small Deterministic Turing Machines, Papers on Automata and Languages, Dep. of Math., Karl Marx Univ. of Economics, Budapest, 1988-4, p.77-87, (1989)
2. Hermann G.T. The uniform halting problem for generalised one state Turing machines, Proceedings of the Ninth Annual Switching and Automata Theory Symposium, (1968)
3. Kudlek M. Small Deterministic Turing Machines, Theoretical Computer Science, 168-2, special issue on Universal Machines and Computations, 241-255, (1996)
4. Margenstem M. Turing machines: on the frontier between a decidable halting problem and universality. Lecture Notes in Computer Science, 710, 375-385, in Proceedings of FCT’93, (1993)
5. 1 95, (1995)
6. Margenstem M. Results on the halting problem, LMPS’95 International Conference, Florence, August 1995
7. Margenstem M. The laterality problem for non-erasing Turing machines on {0,1} is completely solved. RAIRO, 39p. (1997) (to appear)
8. Margenstem M. and Pavlotskaya L. Deux machines de Turing universelles à au plus deux instructions gauches. C.R.A.S., Paris, 320, I, 1395-1400, (1995)
9. Margenstem M. and Pavlotskaia L. Vers une nouvelle approche de l’universalité concemant les machines de Turing, LITP/IBP research report N°95.58 (1995)
10. Minsky M.L. Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, N.J. (1967)
11. Pavlotskaya L.M. Razreshimost’ problemy ostanovki dlja nekotorykh klassov mashin T’juringa. Matematicheskie Zametki, 13, (6), 899-909, Ijun’ 1973 899-909. (transi. Solvability of the halting problem for certain classes of Turing machines, Notes of the Acad. Sci. USSR, 13 (6) Nov.1973, 537-541)
12. Pavlotskaya L.M. O minimal’nom chisle razlichnykh kodov vershin v grafe univer-sal’noj mashiny T’juringa. Diskretnyj analiz, Sbomik trudov instituta matematiki SO AN SSSR, 27, 52-60, (1975) (On the minimal number of distinct codes for the vertices of the graph of a universal Turing machine) (in Russian)
13. Pavlotskaya L.M. Dostatochnye uslovija razreshimosti problemy ostanovki dlja mashin T’juring, Avtomaty i mashiny, 91-118, 1978 (Sufficient conditions for halting problem decidability of Turing machines) (in Russian)
14. Pavlotskaya L.M, On machines, universal by extensions, Theoretical Computer Science, 168-2, special issue on Universal Machines and Computations, pp.257-266, (1996)
15. Priese L. Towards a precise characterization of the complexity of universal and nonuniversal Turing machines, SIAM Journal of Computation, 8, 4, 508-523, (1979)
16. Rogozhin Ju.V. Sem’ universal’nykh mashin T’juringa. Matematicheskie Issledo-vanija, 69, 76-90, 1982 (Seven universal Turing machines) (in Russian)
17. Rogozhin Ju.V. Universal’naja mashina T’juringa s 10 sostojanijami i 3 simvolami. Matematicheskie Issledovanija, 69, 76-90, 1992 (A universal Turing machine with 10 states and 3 symbols) (in Russian)
18. Rogozhin Ju.V. Small universal Turing machines, Theoretical Computer Science, 168-2, special issue on Universal Machines and Computations, 215-240, (1996)
19. Shannon C.E. A universal Turing machine with two internal states. Ann. of Math. Studies, 34, 157-165, (1956)
20. Turing A.M. On computable real numbers, with an application to the Entschei-dungsproblem. Proc. Lond. Math. Soc., ser. 2, 42, 230-265 (1936)
21. Wang H. Tag Systems and Lag Systems, Mat. Annalen, 152, (1963), 65-74