Decidability and Universality in Symbolic Dynamical Systems

  title={Decidability and Universality in Symbolic Dynamical Systems},
  author={Jean-Charles Delvenne and Petr Kurka and Vincent D. Blondel},
  journal={Fundam. Inform.},
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… CONTINUE READING