Decidability and universality in symbolic dynamical systems

Abstract

We propose a general definition of universality that applies discrete time symbolic dynamical systems and show that universal systems cannot be neither minimal nor equicontinuous

Keywords

• Turing machines
• halting problem
• symbolic dynamics