Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System

DOI10.1086/375472MaRDI QIDQ3093489zbMATH OpenOpenAlexFDO

Authors Matthew W. Parker

Publication date 17 October 2011

Published in Philosophy of Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1086/375472

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Constructive and recursive analysis (03F60) Perturbations of finite-dimensional Hamiltonian systems, normal forms, small divisors, KAM theory, Arnol'd diffusion (37J40) Celestial mechanics (70F15)

Cites work

• Computability and Noncomputability in Classical Analysis
• Computable functionals
• Generalized shifts: unpredictability and undecidability in dynamical systems
• scientific article; zbMATH DE number 3909745 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 146460 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1346450 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1748602 (Why is no real title available?)
• scientific article; zbMATH DE number 3220203 (Why is no real title available?)
• Integrability of hamiltonian systems on cantor sets
• Intermingled basins of attraction: uncomputability in a simple physical system
• Laplace's demon consults an oracle: the computational complexity of prediction
• On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On the concept of attractor
• On the definition of computable functionals
• On the definitions of computable real continuous functions
• PROOF OF A THEOREM OF A. N. KOLMOGOROV ON THE INVARIANCE OF QUASI-PERIODIC MOTIONS UNDER SMALL PERTURBATIONS OF THE HAMILTONIAN
• RIDDLED BASINS
• SMALL DENOMINATORS AND PROBLEMS OF STABILITY OF MOTION IN CLASSICAL AND CELESTIAL MECHANICS
• Stable and Random Motions in Dynamical Systems
• The transition to chaotic attractors with riddled basins
• Unpredictability and undecidability in dynamical systems

Cited in

(4)

• Computing the uncomputable; or, the discrete charm of second-order simulacra
• Multi-resolution cellular automata for real computation
• Notions of Probabilistic Computability on Represented Spaces
• Three concepts of decidability for general subsets of uncountable spaces

This page was built for publication: Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093489)