Unpredictability and undecidability in dynamical systems.

@article{Moore1990UnpredictabilityAU,
  title={Unpredictability and undecidability in dynamical systems.},
  author={Moore},
  journal={Physical review letters},
  year={1990},
  volume={64 20},
  pages={
          2354-2357
        }
}
  • Moore
  • Published 14 May 1990
  • Physics
  • Physical review letters
We show that motion with as few as three degrees of freedom (for instance, a particle moving in a three-dimensional potential) can be equivalent to a Turing machine, and so be capable of universal computation. Such systems possess a type of unpredictability qualitatively stronger than that which has been previously discussed in the study of low-dimensional chaos: Even if the initial conditions are known exactly, virtually any question about their long-term dynamics is undecidable. 

Figures from this paper

Noise vs computational intractability in dynamics

TLDR
It is shown that the introduction of even a small amount of noise into a dynamical system is sufficient to "destroy" Turing-completeness, and to make the system's long-term behavior computationally predictable.

Gravity and complexity

We present a heuristic analysis of the dynamics of general solutions to the Einstein Field Equations which highlights the possibility that such systems could possess a degree of unpredictability

Undecidability in quantum thermalization

The investigation of thermalization in isolated quantum many-body systems has a long history, dating back to the time of developing statistical mechanics. Most quantum many-body systems in nature are

Computability and dynamical systems

TLDR
Results are explored that establish a link between dynamical systems and computability theory (not numerical analysis) and suggest some lines of research for further work on this fascinating topic.

Computability in planar dynamical systems

TLDR
This paper shows that (a) the problem of determining the number of attractors in a given compact set is in general undecidable, even for analytic systems and (b) the attractors are semi-computable for stable systems.

Computation Beyond the Turing Limit

TLDR
A simply described but highly chaotic dynamical system called the analog shift map is presented here, which has computational power beyond the Turing limit (super-Turing); it computes exactly like neural networks and analog machines.

Turing Universality in Dynamical Systems

TLDR
Some of the definitions that have been proposed for Turing universality of various systems, and the attempts to understand the relation between dynamical and computational properties of a system are reviewed.

Welcoming the Super Turing Theories

TLDR
A possible such a model, constituting a chaotic dynamical system is presented, which is term as the analog shift map, when viewed as a computational model has super-Turing power and is equivalent to neural networks and the class of analog machines.

Hamiltonian Systems as Machines Over the Reals

I explain how to associate computations with physical systems such as finite degree of freedom hamiltonian systems, and thus show why we should consider such systems as real number machines. I make a
...

References

SHOWING 1-10 OF 13 REFERENCES

Computation: Finite and Infinite Machines

From the Preface (See Front Matter for full Preface) Man has within a single generation found himself sharing the world with a strange new species: the computers and computer-like machines.

Computation theory of cellular automata

TLDR
The sets of configurations generated after a finite number of time steps of cellular automaton evolution are shown to form regular languages and it is suggested that such undecidability is common in these and other dynamical systems.

Theory of Recursive Functions and Effective Computability

TLDR
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees in particular and generalizations of recursion theory.

Formal Languages and Finite Cellular Automata

TLDR
The limit set on finite lattices is shown to be neither a regular nor an unambiguous context-free language for certain additive rules with chaotic behavior, and for rules that can simulate one of these additive rules t hrough a blocking transformation.

Differentiable dynamical systems

This is a survey article on the area of global analysis defined by differentiable dynamical systems or equivalently the action (differentiable) of a Lie group G on a manifold M. An action is a

Wheels, life, and other mathematical amusements

Wheels, life, and other mathematical amusements , Wheels, life, and other mathematical amusements , کتابخانه دیجیتال جندی شاپور اهواز

Phys. Lett. 99A

  • Phys. Lett. 99A
  • 1983

Phys. Rev. Lett

  • Phys. Rev. Lett
  • 1988