Non-erasing turing machines: A new frontier between a decidable halting problem and universality

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

Volumn 710 LNCS, Issue , 1993, Pages 375-385

  Margenstern, Maurice ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; MACHINERY;

HALTING PROBLEMS; MACHINE PROGRAMS;

TURING MACHINES;

EID: 21144465595     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57163-9_32     Document Type: Conference Paper

References (3)

1. Margenstern M. Sur la frontière entre machines de Turing à arrêt décidable et machines de Turing universelles. LITP research report N∘92. 83 (Institut Blaise Pascal) (1992)
2. Minsky M. L. Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, N. J. (1967)
3. Shepherdson J. C. The reduction of two-way automata to one-way automata. I. B. M. journal, 3, 198–200, 1959. (reedited in Sequential machines: selected papers, ed. by E. F. Moore, Addison-Wesley, 1964)