Topological entropy of Turing complete dynamics (with an appendix by Ville Salo) (2404.07288v2)
Abstract: We explore the relationship between Turing completeness and topological entropy of dynamical systems. We first prove that a natural class of Turing machines that we call "regular Turing machines" (which includes most of the examples of universal Turing machines) has positive topological entropy. We deduce that any Turing complete dynamics with a continuous encoding that simulates a universal machine in this class is chaotic. This applies to our previous constructions of Turing complete area-preserving diffeomorphisms of the disk and 3D stationary Euler flows. The article concludes with an appendix written by Ville Salo that introduces a method to construct universal Turing machines that are not regular and have zero topological entropy.
- R. Bowen. Entropy for groups endomorphisms and homogeneous spaces. Trans. Amer. Math. Soc. 153 (1971), 401–414.
- E. Dinaburg. A connection between various entropy characterizations of dynamical systems. Izv. Akad. Nauk SSSR 35 (1971), 324–366.
- E. Jeandel. Computability of the entropy of one-tape Turing machines. 31st International Symposium on Theoretical Aspects of Computer Science, 2014.
- M. Minsky. A 6666-symbol 7777-state universal Turing machine. MIT Lincoln Laboratory Report G-0027, 1960.
- C. Moore. Unpredictability and undecidability in dynamical systems. Phys. Rev. Lett. 64 (1990), 2354–2357.
- C. Moore. Generalized shifts: unpredictability and undecidability in dynamical systems. Nonlinearity 4 (1991), 199–230.
- K. Morita. Theory of reversible computing. Springer Japan, 2017.
- P. Oprocha. On entropy and Turing machine with moving tape dynamical model. Nonlinearity 19 (2006) 2475–2487.
- Y. Rogozhin. Small universal Turing machines. Theor. Comput. Sci. 168 (1996) 215–240.
- M. Sipser. Introduction to the theory of computation (3rd ed.). International Thomson Publishing, 2012.
- T. Tao. On the universality of potential well dynamics. Dyn. PDE 14 (2017), 219–238.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
