Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines

Theoretical Computer Science

Volumn 319, Issue 1-3, 2004, Pages 127-143

  Delvenne, Jean Charles ^a   Blondel, Vincent D ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Dynamical systems; Quasi periodicity; Tiling; Turing machine; Undecidability

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; DIFFERENTIAL EQUATIONS; FUNCTIONS; PROBLEM SOLVING; THEOREM PROVING;

DYNAMICAL SYSTEMS; QUASI-PERIODICITY; TILING; TOPOLOGICAL ENTROPY;

TURING MACHINES;

EID: 2442585219     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.02.018     Document Type: Conference Paper

References (17)

1. Berger R. The undecidability of the domino problem. Mem. Amer. Math. Soc. 66:1966;1-72.
2. Blondel V.D., Cassaigne J., Nichitiu C. On the presence of periodic configurations in Turing machines and in counter machines. Theoret. Comput. Sci. 289:2002;573-590.
3. Brown J.R. Ergodic Theory and Topological Dynamics. 1976;Academic Press, New York.
4. Cassaigne J. Recurrence in infinite words, Symposium on Theoretical Aspects of Computer Science (STACS 2001). Lecture Notes in Computer Science. Vol. 2010:2001;Springer, Berlin, Afonso Ferreira.
5. Čulik K. An aperiodic set of 13 Wang tiles. Discrete Appl. Math. 160:1996;245-251.
6. Cervelle J., Durand B. Tilings: recursivity and regularity, Symposium on Theoretical Aspects of Computer Science (STACS 2000). Lecture Notes in Computer Science. Vol. 1770:2000;Springer, Berlin, Lille.
7. Durand B. Tilings and quasi-periodicity. Theoret. Comput. Sci. 221:1999;61-75.
8. Hooper P. The undecidability of the Turing machine immortality problem. J. Symbolic Logic. 2:1966;219-234.
9. Hurd L.P., Kari J., Čulik K. The topological entropy of cellular automata is uncomputable. Ergodic Theory Dynamical Systems. 12:1992;255-265.
10. 2 subshifts Theoret. Comput. Sci. 262:2001;191-213.
11. Kari J. Rice's theorem for the limit set of cellular automata. Theoret. Comput. Sci. 127(2):1994;229-254.
12. Kari J. Recent results on aperiodic Wang tilings. Carbone A., Gromov M., Prusinkiewicz P. Pattern Formation in Biology, Vision and Dynamics. 2000;83-96 World Scientific, Singapore.
13. Koiran P. The topological entropy of iterated piecewise affine maps is uncomputable. Discrete Mathematics & Theoretical Computer Science. 4(2):2001;351-356.
14. Ku̇rka P. On topological dynamics of Turing machines. Theoret. Comput. Sci. 174:1997;203-216.
15. Lipschutz S. General Topology. 1965;Schaum, New York.
16. Morse M., Hedlund G. Symbolic Dynamics. Amer. J. Math. 60:1938;815-866.
17. Wang H. Proving theorems by pattern recognition II. Bell System Technical J. 40:1961;1-41.