Decidability and Universality in Symbolic Dynamical Systems

Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems. Universality of a system is defined as undecidability of a model-checking problem. For Turing machines, counter machines and tag systems, our definition coincides with the classical one. It yields, however, a new definition for cellular automata and subshifts. Our definition is robust with respect to initial condition, which is a desirable feature for physical realizability. We derive necessary conditions for undecidability and universality. For instance, a universal system must have a sensitive point and a proper subsystem. We conjecture that universal systems have infinite number of subsystems. We also discuss the thesis according to which computation should occur at the 'edge of chaos' and we exhibit a universal chaotic system.

[1]  Petr Kurka Simplicity Criteria for Dynamical Systems , 1993, Analysis of Dynamical and Cognitive Systems.

[2]  M. Bernhard Introduction to Chaotic Dynamical Systems , 1992 .

[3]  T. Toffoli,et al.  Conservative logic , 2002, Collision-Based Computing.

[4]  Hava T. Siegelmann,et al.  Neural networks and analog computation - beyond the Turing limit , 1999, Progress in theoretical computer science.

[5]  Jr. Hartley Rogers Theory of Recursive Functions and Effective Computability , 1969 .

[6]  R. Kaivola Using automata to characterise fixed point temporal logics , 1996 .

[7]  J. Banks,et al.  On Devaney's definition of chaos , 1992 .

[8]  Cristopher Moore,et al.  Dynamical Recognizers: Real-Time Language Recognition by Analog Computers , 1998, Theor. Comput. Sci..

[9]  Cristopher Moore,et al.  Generalized shifts: unpredictability and undecidability in dynamical systems , 1991 .

[10]  M. Minsky Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[11]  H. Siegelmann,et al.  Analog computation with dynamical systems , 1998 .

[12]  Petr Kurka,et al.  On Topological Dynamics of Turing Machines , 1997, Theor. Comput. Sci..

[13]  Cristopher Moore,et al.  Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines , 1999, Theor. Comput. Sci..

[14]  Péter Gács Reliable Cellular Automata with Self-Organization , 1997, FOCS 1997.

[15]  Pekka Orponen,et al.  On the Effect of Analog Noise in Discrete-Time Analog Computations , 1996, Neural Computation.

[16]  Amir Pnueli,et al.  Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives , 1995, Theor. Comput. Sci..

[17]  Hava T. Siegelmann,et al.  A Theory of Complexity for Continuous Time Systems , 2002, J. Complex..

[18]  Klaus Sutner,et al.  Cellular automata and intermediate degrees , 2003, Theor. Comput. Sci..

[19]  James P. Crutchfield,et al.  Dynamics, computation, and the “edge of chaos”: a re-examination , 1993, adap-org/9306003.

[20]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[21]  Jean-Charles Delvenne,et al.  Computational Universality in Symbolic Dynamical Systems , 2004, MCU.

[22]  Armin Hemmerling Effective metric spaces and representations of the reals , 2002, Theor. Comput. Sci..

[23]  P. Kurka Languages, equicontinuity and attractors in cellular automata , 1997, Ergodic Theory and Dynamical Systems.

[24]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[25]  James P. Crutchfield,et al.  Computation at the Onset of Chaos , 1991 .

[26]  Michel Cosnard,et al.  Computability with Low-Dimensional Dynamical Systems , 1994, Theor. Comput. Sci..

[27]  Petr Kůrka,et al.  Topological and symbolic dynamics , 2003 .

[28]  John L. Casti,et al.  Unconventional Models of Computation , 2002, Lecture Notes in Computer Science.

[29]  Klaus Sutner,et al.  Universality and Cellular Automata , 2004, MCU.

[30]  Pekka Orponen,et al.  A Survey of Continous-Time Computation Theory , 1997, Advances in Algorithms, Languages, and Complexity.

[31]  T. Husfeldt Dynamic Computation , 1997 .

[32]  A. Turing On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[33]  Ahmed Bouajjani,et al.  Perturbed Turing machines and hybrid systems , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[34]  Petr Kurka Zero-Dimensional Dynamical Systems, Formal Languages, and Universality , 1999, Theory of Computing Systems.

[35]  Miles Davis,et al.  A Note on Universal Turing Machines , 1970 .

[36]  Pascal Koiran A Family of Universal Recurrent Networks , 1996, Theor. Comput. Sci..

[37]  Moore,et al.  Unpredictability and undecidability in dynamical systems. , 1990, Physical review letters.

[38]  Stephen Wolfram,et al.  A New Kind of Science , 2003, Artificial Life.

[39]  Stephan Merz,et al.  Model Checking , 2000 .

[40]  Stig I. Andersson Analysis of Dynamical and Cognitive Systems , 1995, Lecture Notes in Computer Science.

[41]  Christopher G. Langton,et al.  Computation at the edge of chaos: Phase transitions and emergent computation , 1990 .

[42]  Jean-Charles Delvenne,et al.  Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines , 2004, Theor. Comput. Sci..

[43]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[44]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[45]  Olivier Bournez,et al.  On the Computational Power of Dynamical Systems and Hybrid Systems , 1996, Theor. Comput. Sci..

[46]  B. Durand,et al.  The Game of Life: Universality Revisited , 1999 .

[47]  Pierre Wolper,et al.  Constructing Automata from Temporal Logic Formulas: A Tutorial , 2002, European Educational Forum: School on Formal Methods and Performance Analysis.

[48]  Jean-Eric Pin,et al.  Infinite words - automata, semigroups, logic and games , 2004, Pure and applied mathematics series.