Frontier between decidability and undecidability: A survey

Theoretical Computer Science

Volumn 231, Issue 2, 2000, Pages 217-251

  Margenstern, Maurice ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Decidability versus undecidability; Discrete computations; Halting problem; Universality

Indexed keywords

EID: 0038387709     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00102-4     Document Type: Article

References (126)

1. S.I. Adian, G.S. Makanin, Investigations on algorithmic questions of algebra, Proc. Steklov Inst. Math. (3) (1986) 207-226 (English translation, original in Trudy Matematicheskogo Instituta imeni Steklova 168 (1984)).
2. S.I. Adian, G.S. Makanin, Investigations on algorithmic questions of algebra, Proc. Steklov Inst. Math. (3) (1986) 207-226 (English translation, original in Trudy Matematicheskogo Instituta imeni Steklova 168 (1984)).
3. L. Adleman, Molecular computation of solutions to combinatorial problems, Science 266 (1994) 1021-1024.
4. J.-P. Allouche, F. von Haeseler, H.-O. Peitgen, G. Skordev, Linear cellular automata, finite automata and Pascal's triangle, Discrete Appl. Math. 66 (1996) 1-22.
5. C. Baiocchi, 3N + 1, UTM e Tag-systems, private communication (in Italian), 1998.
6. Y. Bar-Hillel, M. Perles, E. Shamir, On formal properties of simple phrase structure grammars, Z. Phonetik, Sprachwissenschaft und Kommunikationsforschung 14 (1961) 143-172.
7. D. Beauquier, M. Nivat, Tiling the plane with one tile, Proc. 6th Annual Symp. on Computational Geometry (SCG '90), 1990, pp. 128-138.
8. D. Beauquier, Undecidable problem about rational sets and contour words of polyominoes, Inform. Proces. Lett. 37 (5) (1991) 257-263.
9. D. Beauquier, M. Latteux, K. Slowinski, A decidability result about convex polyominoes, in: Imre Simon (Ed.), Proc. Latin American Symp. on Theoretical Informatics (LATIN '92), Lecture Notes in Computer Science, vol. 583, 1992, pp. 32-45.
10. C.H. Bennett, Logical reversibility of computation, IBM J. Res. Dev. 6 (1973) 525-532.
11. R. Berger, The undecidability of the domino problem, Mem. Amer. Soc. 66 (1966).
12. E.R. Berlekamp, J.H. Conway, R.K. Guy, Winning Ways for Your Mathematical Plays, Academic Press, London, 1982.
13. J. Byl, Self-reproduction in small cellular automata, Physica D 34 (1989) 295-299.
14. M. Casey, The dynamics of discrete-time computation with application to recurrent neural networks and finite state machine extraction, Neural Comput. 8 (6) (1996) 1135-1178.
15. G. Cattaneo, E. Formenti, G. Mauri, Rule space transformations and one-dimensional cellular automata, in: J. Dassow, G. Rozenberg, A. Salomaa (Eds.), Proc. 2nd Internat. Conf. Developments in Language Theory, World Scientific, Singapore, 1995, pp. 409-419.
16. V. Claus, Some remarks on PCP(k) and related problems, Bull. EATCS 12 (1980) 54-61.
17. E.F. Codd, Cellular Automata, Academic Press, New York, 1968.
18. J.H. Conway, Unpredictable iterations, in Proc. 1972 Number Theory Conf. Boulder, Colorado, University of Colorado, 1972, pp. 49-52.
19. M. Cosnard, M. Garzon, P. Koiran, Computability properties of low-dimensional dynamical systems, Proc. 10th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 665, 1993, pp. 365-373.
20. K. Culik II, An aperiodic set of 13 Wang tiles, Discrete Appl. Math. 160 (1996) 245-251.
21. K. Culik II, T. Harju, Splicing semigroups of dominoes and DNA, Discrete Appl. Math. 31 (1991) 261-277.
22. V. Diekert, M. Kudlek, Small deterministic turing machines, Papers on Automata and Languages, Department of Mathematics, Karl Marx University of Economics, Budapest, 1988-4, 1989, pp. 77-87.
23. V.G. Durnev, Positive theory of a free semi-group, Dokl. Akad. Nauk SSSR 211 (1973) 772-774 (English transl. in Soviet Math. Dokl. 14 (1973)).
24. V.G. Durnev, Positive theory of a free semi-group, Dokl. Akad. Nauk SSSR 211 (1973) 772-774 (English transl. in Soviet Math. Dokl. 14 (1973)).
25. A. Ehrnfeucht, J. Kerhumäki, G. Rozenberg, The (generalized) Post correspondence problem with lists consisting of two words is decidable, Theoret. Comput. Sci. 21 (1982) 119-144.
26. C. Ferretti, C. Mauri, C. Zandron, Nine test tubes generate any RE language, Theoret. Comput. Sci. 231 (this Vol.) (2000) 171-180.
27. S.W. Golomb, Polyominoes, Goerge Allen & Unwin, London, 1965.
28. Ľ. Gregušová, I. Korec, Small universal Minsky machines, in: J. Bečvář (Ed.), Mathematical Foundations of Computer Science, Proc. 8th Symp., Olomouc, Sept. 3-7, 1979, Lecture Notes in Computer Science, vol. 74, 1979, pp. 308-316.
29. S. Grigorieff, Décidabilité et complexité des théories logiques, in: Bruno Courcelle (Ed.), Logique et informatique: une introduction, Presses de l'INRIA, coll. Didactique, vol. 8, 1991, pp. 7-97.
30. J. Gruska, Foundations of Computing, International Thomson Computer Press, Boston, 1997.
31. Yu. Gurevich, Word problems for certain classes of semi-groups, Algebra i Logika 5 (5) (1996) 25-35 (Russian).
32. R.K. Guy, Conway's prime producing machine, Math. Mag. 56 (1) (1983) 26-33.
33. T. Head, Formal language theory and DNA: an analysis of the generative capacity of recombinant behaviors, Bull. Math. Biol. 49 (1987) 737-759.
34. G.T. Hermann, The uniform halting problem for generalised one state Turing machines, Proc. 9th Annual Switching and Automata Theory Symp., 1968.
35. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
36. K. Imai, K. Morita, A computation-universal two-dimensional 8-state triangular reversible cellular automaton, this issue.
37. P. Indyk, Optimal Simulation of Automata by Neural Nets, Lecture Notes in Computer Science, vol. 900, 1995, pp. 337-348.
38. J.P. Jones, Universal diophantine equation, J. Symbolic Logic 47 (3) (1982) 549-571.
39. L. Kari, G. Gloor, S. Yu, Using DNA to solve the Bounded Post Correspondence Problem, Theoret. Comput. Sci. 231 (this Vol.) (2000) 193-203.
40. F. Kaščák, Small universal one-state linear operator algorithm, Proc. MFCS'92, Prague, Aug. 21-28, Lecture Notes in Computer Science, vol. 629, 1992, pp. 327-335.
41. S.C. Kleene, Representation of events in nerve nets and finite automata, in: C. Shannon, J. McCarthy (Eds.), Automata Studies, Princeton University Press, Princeton, NJ, 1956, pp. 3-41.
42. H. Kleine-Büning, T. Ottmann, Kleine universelle mehrdimensionale Turingmaschinen, Elektron. Informations Verarbeit. Kybernetik 13 (1977) 179-201.
43. I. Korec, A density estimate for the 3x+1 problem, Math. Slovaca 44 (1) (1994) 85-89.
44. I. Korec, Small universal register machines, Theoret. Comput. Sci. 168-2, special issue on Univ. Mach. Comput. (1996), 267-301.
45. M. Kudlek, Small deterministic turing machines, Theoret. Comput. Sci. 168-2, special issue on Univ. Mach. Comput. (1996) 241-255.
46. J.C. Lagarias, The 3x + 1 problem and its generalisations, Amer. Math. Mon. 92 (1985) 3-23.
47. J.C. Lagarias, The 3x+1 problem and its generalisations, in: J. Borwein et al. (Eds.), Organic Mathematics. Proc. Workshop Simon Fraser Univ., Burnaby, Canada, Dec. 12-14, 1995, AMS, Providence, RI. ISBN 0-8218-0668-8, 1995. available at: http://www.cecm.sfu.ca/organics/papers/lagarias/
48. K. Lindgren, M.G. Nordahl, Universal computation in simple one-dimensional cellular automata, Complex Systems 4 (1990) 299-318.
49. W. S. McCulloch, W. Pitts, A logical calculus of the ideas immanent in nervous activity, Bull. Math. Biophys. 5 (1943) 115-133.
50. W. Magnus, Das Identitätsproblem für Gruppen mit einer defineirenden, Relation. Math. Ann. 106 (1932) 295-307.
51. M. Margenstern, Turing machines: on the frontier between a decidable halting problem and universality, Lecture Notes in Computer Science, vol. 710, in Proc. FCT'93, 1993, pp. 375-385.
52. M. Margenstern, Non-erasing Turing machines: a new frontier between a decidable halting problem and universality, Lecture Notes in Computer Science, vol. 911, in Proc. LATIN'95, 1995, pp. 386-397.
53. M. Margenstern, Results on the halting problem, LMPS'95 Internat. Conf, Florence, August 1995.
54. M. Margenstern, The laterality problem for non-erasing Turing machines on {0, 1} is completely solved, RAIRO, Theoret. Inform. Appl. 31 (2) (1997) 159-204.
55. M. Margenstern, Decidability and undecidability of the halting problem on turing machines, a survey, Lecture Notes in Computer Science, vol. 1234, in Proc. LFCS' 1997, pp. 226-236.
56. M. Margenstern, Frontier between decidability and undecidability: a survey, Proc. MCU'98, vol. I, ISBN 2-9511539-2-9, 1998, pp. 141-177.
57. M. Margenstern, L. Pavlotskaya, Deux machines de Turing universelles à au plus deux instructions gauches, CRAS. Paris 320 (I) (1995) 1395-1400.
58. M. Margenstern, L. Pavlotskaya, Vers une nouvelle approche de l'universalité concernant les machines de Turing, LITP/IBP Research Report No 95.58, 1995.
59. M. Margenstern, L. Pavlotskaya, A new decidability result on the halting problem for turing machines, 15th Day on Weak Arithmetics, 11-12 December 1997, Mons.
60. M. Margenstern, H.T. Siegelmann, Réseaux de neurones: neuf suffisent pour l'universalité Turing, Actes du Colloque National de Recherche Universitaire; l'exemple des I.U.T., 14-16 1997, Toulouse, France, 1997.
61. N. Margolus, Physics-like models of computation, Physica 10D (1984) 81-95.
62. A.A. Markov, On the impossiblity of certain algorithms in the theory of associative sytems, Dokl. Akad. Nauk SSSR 55 (1947) 583-586.
63. S.Yu. Maslov, On E.L. Post's "Tag" problem, Trudy Mat. Inst. im. Steklova 72 (1964) 57-68 (English transl. Amer. Math. Soc. Transl. Ser. 2 97 (1971) 1-14).
64. S.Yu. Maslov, On E.L. Post's "Tag" problem, Trudy Mat. Inst. im. Steklova 72 (1964) 57-68 (English transl. Amer. Math. Soc. Transl. Ser. 2 97 (1971) 1-14).
65. S.Yu. Maslov, Certain properties of E.L. Post's apparatus of canonical calculi, Trudy Mat. Inst. im. Steklova 72 (1964) 5-56 (English transl. Amer. Math. Soc. Transl. ser. 2 98 (1971) 91-161).
66. S.Yu. Maslov, Certain properties of E.L. Post's apparatus of canonical calculi, Trudy Mat. Inst. im. Steklova 72 (1964) 5-56 (English transl. Amer. Math. Soc. Transl. ser. 2 98 (1971) 91-161).
67. Yu.V. Matiyasevich, Simple examples of unsolvable canonical calculi, Trudy MIAN 93 (1967) 50-88 (English transl. Proc. Steklov Inst. Math. (1970), 61-110).
68. Yu.V. Matiyasevich, Simple examples of unsolvable canonical calculi, Trudy MIAN 93 (1967) 50-88 (English transl. Proc. Steklov Inst. Math. (1970), 61-110).
69. Yu.V. Matiyasevich, Simple examples of unsolvable canonical calculi, D.A.N. SSSR 173 (6) (1967) 1264-1266.
70. Yu.V. Matiyasevich, On recursive unsolvability of Hilbert's Tenth Problem, in: P. Suppes, L. Henkin, A. Joja, Gr. C. Moisil (Eds.), Logic, Methodology and Philosophy of Science IV, Studies in Logic and Foundations of Mathematics, vol. 74, 1973, pp. 89-110.
71. Yu.V. Matiyasevich, On investigations on some algorithmic problems in algebra and number theory, Trudy Mat. Inst. im. Steklova 168 (1984) 218-235 (English transl. Proc. Steklov Inst. Math. 3 (1986) 227-252).
72. Yu.V. Matiyasevich, On investigations on some algorithmic problems in algebra and number theory, Trudy Mat. Inst. im. Steklova 168 (1984) 218-235 (English transl. Proc. Steklov Inst. Math. 3 (1986) 227-252).
73. Yu.V. Matiyasevich, Hilbert's Tenth Problem, Nauka Publishers, Fizmatlit, 1993 (Russian; English translation: MIT Press, Cambridge, MA, 1993).
74. Yu.V. Matiyasevich, Universal polynomials, Proc. MCU'98, vol. I, ISBN 2-9511539-2-9, 1998, pp. 1-20.
75. Yu.V. Matiyasevich, G. Sénizergues, Decision problems for semi-Thue systems with a few rules, Proc. LICS'96, IEEE Computer Society Press, Silverspring, MD, 1996, pp. 523-531.
76. Yu.V. Matiyasevich, G. Sénizergues, Decision problems for semi-Thue systems with a few rules, Proc. JAF13, ISBN 2-9511539-0-2, 1997, pp. 137-166.
77. P. Michel, Busy beaver competition and Collatz-like problems, Arch. Math. Logic 32 (1993) 351-367.
78. M.L. Minsky, Computation: Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs, NJ, 1967.
79. K. Morita, K. Imai, Self-reproduction in a reversible cellular space, Theoret. Comput. Sci. 168-2, special issue on Univ. Mach. Comput. (1996) 303-320.
80. K. Morita, K. Imai, Logical universality and self-reproduction in reversible cellular automata, Proc. 1st Internat. Conf. on Evolvable Systems, Tsukuba, Lecture Notes in Computer Science, vol. 1259, Springer, Berlin, 1996, pp. 152-166.
81. K. Morita, K. Imai, A simple self-reproducing cellular automaton with shape-encoding mechanism, in: C.G. Langton, K. Shimohara (Eds.), Artificial Life V, MIT Press, Cambridge, MA, 1997, pp. 489-496.
82. P.S. Novikov, On the algorithmic unsolvability of the word problem in group theory, Trudy Mat. Inst. im. Steklova 44 (1955) (English translation in Amer. Math. Soc. Transl. 9 (2) (1958)).
83. P.S. Novikov, On the algorithmic unsolvability of the word problem in group theory, Trudy Mat. Inst. im. Steklova 44 (1955) (English translation in Amer. Math. Soc. Transl. 9 (2) (1958)).
84. D. Pager, The caracterization of tag-systems in term of decidability, J. London Math. Soc. 2 (2) (1970) 473-480.
85. J.-J. Pansiot, A note on Post's correspondance problem, Inform. Process. Lett. 12 (5) (1981) 233.
86. G. Pǎun, DNA computing: distributed splicing systems, in Structures in Logic and Computer Science, A Selection of Essays in Honor of A. Ehrenfeucht, Lecture Notes in Computer Science, vol. 1261, Springer, Berlin, 1997, pp. 353-370.
87. G. Pǎun, DNA computing based on splicing: universality results, Theoret. Comput. Sci. 231 (this Vol.) (2000) 275-296.
88. G. Pǎun, G. Rozenberg, A. Salomaa, Computing by splicing, Theoret. Comput. Sci. 168-2, special issue on Univ. Mach. Comput. (1996) 321-336.
89. L.M. Pavlotskaya, Razreshimost' problemy ostanovki dlja nekotorykh klassov mashin T'juringa, Matematicheskie Zametki 13 (6) (1973) 899-909, Ijun' (transl. Solvability of the halting problem for certain classes of Turing machines, Notes of the Acad. Sci. USSR 13 (6) (1973) 537-541).
90. L.M. Pavlotskaya, Razreshimost' problemy ostanovki dlja nekotorykh klassov mashin T'juringa, Matematicheskie Zametki 13 (6) (1973) 899-909, Ijun' (transl. Solvability of the halting problem for certain classes of Turing machines, Notes of the Acad. Sci. USSR 13 (6) (1973) 537-541).
91. L.M. Pavlotskaya, O minimal'nom chisle razlichnykh kodov vershin v grafe universal'noj mashiny T'juringa, Diskretnyj analiz, Sb. Tr. Inst. Mat. SO AN SSSR 27 (1975) 52-60 (On the minimal number of distinct codes for the vertices of the graph of a universal Turing machine) (in Russian)
92. L.M. Pavlotskaya, Dostatochnye uslovija razreshimosti problemy ostanovki dlja mashin T'juring, Avtomaty i mashiny (1978) 91-118 (Sufficient conditions for halting problem decidability of Turing machines) (in Russian).
93. L.M. Pavlotskaya, On machines, universal by extensions, Theoret. Comput. Sci. 168-2, special issue on Univ. Mach. Comput. (1996) 257-266.
94. R. Penrose, The Emperor's New Mind, Oxford University Press, Oxford, 1989, 466p.
95. D. Pixton, Linear and circular splicing systems, 1st IEEE Symp. Intelligence in Neural and Biological Systems, Washington, 1995, pp. 181-188.
96. E.L. Post, Recursive unsolvability of a problem of Thue, J. Symbolic Logic 12 (1947) 1-11.
97. L. Priese, Towards a precise characterization of the complexity of universal and nonuniversal Turing machines, SIAM J. Comput. 8 (4) (1979) 508-523.
98. L. Priese, Yu. Rogozhin, M. Margenstern, Finite H-Systems with 3 Test Tubes are not Predictable, in Proc. Pacific Symp. on Biocomputing, Kapalua, Maui, January 1998. - Hawaii, USA, 1998, 545-556.
99. R.M. Robinson, Undecidability and nonperiodicity for tilings of the plane, Invent. Math. 12 (1971) 177-209.
100. R.M. Robinson, Undecidable tiling problems in the hyperbolic plane, Invent. Math. 44 (1978) 259-264.
101. Ju.V. Rogozhin, Sem' universal'nykh mashin T'juringa, Mat. Issledovanija 69 (1982) 76-90 (Seven universal Turing machines) (in Russian).
102. Ju.V. Rogozhin, Universal'naja mashina T'juringa s 10 sostojanijami i 3 simvolami, Mate. Issledovanija 69 (1992) 76-90 (A universal Turing machine with 10 states and 3 symbols) (in Russian).
103. Ju.V. Rogozhin, Small universal Turing machines, Theoret. Comput. Sci. 168-2, special issue on Univ. Mach. Comput. (1996) 215-240.
104. Ju.V. Rogozhin, A Universal Turing machine with 22 States and 2 Symbols, Romanian J. Inform. Sci. Technol. 1 (3) (1998) 259-265.
105. Zs. Roka, Simulations between cellular automata on Cayley graphs, Latin American Theoretical INformatics '95, Lecture Notes in Computer Science, vol. 911, 1995, pp. 483-493.
106. D. Scott, A short recursively unsolvable problem, J. Symbolic Logic 21 (1956) 111-112.
107. G. Sénizergues, L(A) = L(B)? Proc. INFINITY 97, Electronic Notes in Computer Sciences, vol. 9, 1997, pp. 1-26. available at: http://www.elsevier.nl/locate/entcs/volume9.html
108. G. Sénizergues, The equivalence problem for deterministic pushdown automata is decidable, Proc. ICALP '97, Lecture Notes in Computer Science, vol. 1256, 1997, pp. 671-681.
109. G. Sénizergues, Complete formal systems for equivalence problems, Theoret. Comput. Sci. (this Vol.) (2000) 309-334.
110. T. Serizawa, Three-state Neumann neighbour cellular automata capable of constructing self-reproducing machines, Systems Comput. Jpn 18 (4) (1987) 33-40.
111. C.E. Shannon, A universal Turing machine with two internal states, Ann. Math. Stud. 34 (1956) 157-165.
112. H.T. Siegelmann, E.D. Sontag, Turing computability with neural nets, Appl. Math. Lett. 4 (6) (1991) 77-80.
113. H.T. Siegelmann, E.D. Sontag, Analog computation via neural networks, Theoret. Comput. Sci. 131 (1994) 331-360.
114. T. Toffoli, Computation and construction universality of reversible cellular automata, J. Comput. Systems Sci. 15 (2) (1977) 213-231.
115. G.S. Tsejtin, An associative calculus with an unsolvable problem of equivalence, Trudy Mat. Nauk Steklova 52 (1958) (English transl. AMS Transl. 94 (1970) 73-92).
116. G.S. Tsejtin, An associative calculus with an unsolvable problem of equivalence, Trudy Mat. Nauk Steklova 52 (1958) (English transl. AMS Transl. 94 (1970) 73-92).
117. A.M. Turing, On computable real numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc. Ser. 2 42 (1936) 230-265.
118. P. van Emde Boas, The convenience of tilings, in Complexity, Logic and Recursion Theory, Marcel Dekker, New York, 1997.
119. J. von Neumann, in: A.W. Burks (Ed.), Theory of Self-Reproducing Automata, The University of Illinois Press, Urbanan, 1966.
120. K. Wagner, Universelle Turingmaschinen mit n-dimensionalem Band, Elektron. Inforamtions Verarbeit. Kybernetik 9 (1973) 423-431.
121. H. Wang, A variant to Turing's theory of computing machines, J. Assoc. Comput. Mach. 4 (1957) 63-92.
122. H. Wang, Proving theorems by pattern recognition II, Bell Systems Tech. J. 40 (1961) 1-41.
123. H. Wang, Tag systems and lag systems, Math. Ann. 152 (1963) 65-74.
124. G. Watier, Left-divisibility and word problems in single relation monoids, Semigroup Forum 53 (1996) 194-207.
125. G. Watier, On the word problem for single relation monoids with an unbordered relator, Internat. J. Algebraic Comput. 7 (6) (1997) 749-770.
126. G.P. Zykin, Remarks about a theorem of hao Wang, Algebra i Logika 2 (1963) 33-35.