This is the authors' abstract. We don't add key points for this paper.
We explore the relationship between Turing completeness and topological entropy of dynamical systems. We first prove that a natural class of 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.
No takes yet. Share an insight, caveat, or question.
Bruera et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: