The laterality problem for non-erasing turing machines on {0, 1} is completely solved

Theoretical Informatics and Applications

Volumn 31, Issue 2, 1997, Pages 159-204

  Margenstern, Maurice ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031521878     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita/1997310201591     Document Type: Article

References (20)

1. M. MARGENSTERN, Sur la frontière entre machines de Turing à arrêt décidable et machines de Turing universelles Rapport de recherche LITP No 92.83. (Institut Biaise Pascal), 1992.
2. M. MARGENSTERN, Turing machines: on the frontier between a decidable halting problem and universality. Lecture Notes in Computer Science, 710, pp. 375-385, in Proceedings of FCT'93, 1993.
3. M. MARGENSTERN, Décidabilité du problème de l'arrêt pour les machines de Turing non-effaçante sur {0, 1} et à deux instructions gauches. Rapport de recherche LITP No 94.03 (Institut Biaise Pascal), 1994.
4. M. MARGENSTERN, Une machine de Turing universelle sur {0, 1}, non-effaçante et à trois instructions gauches. Rapport de recherche LITP No 94.08 (Institut Biaise Pascal), 1994.
5. M. MARGENSTERN, Une machine de Turing universelle non-effaçante à exactement trois instructions gauches. C.R.A.S., Paris, 1995, 320, I, pp. 101-106.
6. M. MARGENSTERN, Non-erasing Turing machines: a new frontier between a decidable halting problem and universality. Lecture Notes in Computer Science, 1995, 911, pp. 386-397, in Proceedings of LATIN'95).
7. M. MARGENSTERN and L. PAVLOTSKAYA, Deux machines de Turing universelles à au plus deux instructions gauches. C.R.A.S., Paris. 1995, 320, I, pp. 1395-1400.
8. M.L. MINSKY, Computation: Finite and Infinite Machines, Prentice Hall, Englewood Cliffs, N.J., 1967.
9. L. PAVLOTSKAYA, Razreshimost' problemy ostanovki dlja nekotorykh klassov mashin T'juringa. Matematicheskie Zametki, Ijun' 1973, 13, (6), pp. 899-909, pp. 899-909. (transl. Solvability of the halting problem for certain classes of Turing machines, Notes of the Acad. Sci. USSR, Nov. 1973, 13, (6), pp. 537-541.
10. L. PAVLOTSKAYA, Razreshimost' problemy ostanovki dlja nekotorykh klassov mashin T'juringa. Matematicheskie Zametki, Ijun' 1973, 13, (6), pp. 899-909, pp. 899-909. (transl. Solvability of the halting problem for certain classes of Turing machines, Notes of the Acad. Sci. USSR, Nov. 1973, 13, (6), pp. 537-541.
11. L. PAVLOTSKAYA, Dostatochnye uslovija razreshimosti problemy ostanovki dlja mashin T'juring, Avtomaty i mashiny, 1978, pp. 91-118 (Sufficient conditions for halting problem decidability of Turing machines) (in Russian).
12. JU.V. ROGOZHIN, universal'nykh mashin T'juringa. Matematicheskie Issledovanija, 1982, 69, pp. 76-90, (Seven universal Turing machines) (in Russian).
13. JU.V. ROGOZHIN, Universal'naja mashina T'juringa s 10 sostojanijami i 3 simvolami. Matematicheskie Issledovanija, 1992, 69, pp. 76-90, (A universal Turing machine with 10 states and 3 symbols) (in Russian).
14. JU.V. ROGOZHIN, About Shannon's problem for Turing machines. Comput. Sci. J. Moldova, 1993 1 3(3), pp. 108-111.
15. JU.V. ROGOZHIN, Small universal Turing machines, Theoretical Computer Science, 168-2, special issue on Universal Machines and Computations, 1996, pp. 215-240.
16. JU.V. ROGOZHIN, A universal Turing machine with 21 states and 2 symbols, private communication, 1996.
17. C.E. SHANNON, A universal Turing machine with two internal states., Ann. of Math. Studies, 1956, 34, pp. 157-165.
18. A.M. TURING, On computable real numbers, with an application to the Entscheidungsproblem., Proc. Lond. Math. Soc., 1936, ser. 2, 42, pp. 230-265.
19. H. A. WANG, variant to Turing's theory of computing machines. J. Assoc. Comput. Mach., 1957, 4, 1, pp. 63-92.
20. G.P. ZYKIN, Zamechanie ob odnoj teoreme Khao Vana, Algebra i Logika, 1963, 2, 1, pp. 33-35. (Remark on a theorem of Hao Wang) (in Russian).