Laplace's demon consults an oracle: the computational complexity of prediction

DOI10.1016/1355-2198(96)85115-XzbMath1222.03008OpenAlexW2069726325MaRDI QIDQ639767

Itamar Pitowsky

Publication date: 11 October 2011

Published in: Studies in History and Philosophy of Science. Part B. Studies in History and Philosophy of Modern Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/1355-2198(96)85115-x

Mathematics Subject Classification ID

Related Items (4)

Physical Computability Theses ⋮ On choosing between deterministic and indeterministic models: underdetermination and indirect evidence ⋮ Are deterministic descriptions and indeterministic descriptions observationally equivalent? ⋮ Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System

Cites Work

• The wave equation with computable initial data such that its unique solution is not computable
• Unpredictability and undecidability in dynamical systems
• Generalized shifts: unpredictability and undecidability in dynamical systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Laplace's demon consults an oracle: the computational complexity of prediction