Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system

Philosophy of Science 70 (2):359-382 (2003)
  Copy   BIBTEX

Abstract

Some have suggested that certain classical physical systems have undecidable long-term behavior, without specifying an appropriate notion of decidability over the reals. We introduce such a notion, decidability in (or d- ) for any measure , which is particularly appropriate for physics and in some ways more intuitive than Ko's (1991) recursive approximability (r.a.). For Lebesgue measure , d- implies r.a. Sets with positive -measure that are sufficiently "riddled" with holes are never d- but are often r.a. This explicates Sommerer and Ott's (1996) claim of uncomputable behavior in a system with riddled basins of attraction. Furthermore, it clarifies speculations that the stability of the solar system (and similar systems) may be undecidable, for the invariant tori established by KAM theory form sets that are not d-.

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
328 (#59,237)

6 months
78 (#55,082)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Matthew Parker
London School of Economics

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Physics and Chance.Lawrence Sklar - 1995 - British Journal for the Philosophy of Science 46 (1):145-149.

View all 12 references / Add more references