On the presence of periodic configurations in Turing machines and in counter machines

Theoretical Computer Science

Volumn 289, Issue 1, 2002, Pages 573-590

  Blondel, Vincent D ^a   Cassaigne, Julien ^b   Nichitiu, Codrin ^c  

^a Catholic University of Louvain   (Belgium)

^b CNRS Luminy   (France)

^c UNIVERSITÉ JEAN MONNET   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); PROBLEM SOLVING; SET THEORY; SYSTEM STABILITY;

COUNTER MACHINES;

TURING MACHINES;

EID: 0037163970     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00382-6     Document Type: Article

References (9)

1. Blondel V.D., Bournez O., Koiran P., Tsitsiklis J.N. The stability of saturated linear dynamical systems is undecidable. J. Comput. System Sci. 62:2001;442-462.
2. Blondel V.D., Bournez O., Koiran P., Papadimitriou Ch.H., Tsitsiklis J.N. Deciding stability and mortality of piecewise affine dynamical systems. Theoret. Comput. Sci. 255(1-2):2001;687-696.
3. Hooper P.K. The undecidability of the turing machine immortality problem. J. Symbolic Logic. 31(2):1966;219-234.
4. Hopcroft J.E. J.D. Ullman, Formal Languages and Their Relation to Automata. 1969;Addison-Wesley.
5. Kůrka P. On topological dynamics of turing machines. Theoret. Comput. Sci. 174:1997;203-216.
6. Moore C. Generalized shifts: unpredictability and undecidability in dynamical systems. Nonlinearity. 4:1991;199-230.
7. C. Moore, Finite-dimensional analog computers: flows, maps, and recurrent neural networks, in Proc. First Internat. Conf. Unconventional Models Computation, Auckland, New Zealand, 1998.
8. Rogozhin Y. Unsolvability of the immortality problem for Turing machines with three states. Cybernetics (Kibernetika), Kiev (USSR). 1:1975;41-43.
9. C.E. Shannon, A universal Turing machine with two internal states, Automata Studies, Annals of Mathematics Studies, vol. 34, Princeton University Press, Princeton, NJ, 1956, pp. 157-165.