Computational Complexity of Smooth Dynamical Systems

Smooth, finite-dimensional dynamical systems can simulate universal Turing machines, but certain classes of dynamical systems like chaotic (Axiom A) and integrable systems cannot robustly simulate universal Turing machines. The computational capacity of dynamical systems is bounded by their dynamical properties.