Undecidability and incompleteness in classical mechanics

DOI10.1007/BF00671484zbMath0850.70023MaRDI QIDQ1176394

Francisco Antonio Doria, Newton C. A. Da Costa

Publication date: 25 June 1992

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Hamilton's equations (70H05) Undecidability and degrees of sets of sentences (03D35) Foundations of classical theories (including reverse mathematics) (03B30) Axiomatics, foundations (70A05)

Related Items (31)

Dynamical system where proving chaos is equivalent to proving Fermat's conjecture ⋮ Unpredictable dynamics and collective brain ⋮ Predictability in deterministic theories ⋮ Coupled map lattices as computational systems ⋮ On Jaśkowski's discussive logics ⋮ European Summer Meeting of the Association for Symbolic Logic ⋮ Postinstability models in dynamics ⋮ Undecidable Hopf bifurcation with undecidable fixed point ⋮ Undecidability, incompleteness and Arnol'd problems ⋮ On the metamathematics of the P vs. NP question ⋮ Constructive mathematics and unbounded operators -- a reply to Hellman ⋮ Incomputability in Physics and Biology ⋮ Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ Remarks on undecidability, incompleteness and the integrability problem ⋮ Informal versus formal mathematics ⋮ Undecidable problems in quantum field theory ⋮ Metalogic, Schopenhauer and Universal Logic ⋮ Physical limits of inference ⋮ Probabilistic extension and logic of complex unstable dynamical systems ⋮ Terminal model of Newtonian dynamics ⋮ Embedding infinitely parallel computation in Newtonian kinematics ⋮ Some thoughts on hypercomputation ⋮ Analog computation beyond the Turing limit ⋮ Experimental computation of real numbers by Newtonian machines ⋮ Is independence an exception? ⋮ The incompleteness of theories of games ⋮ How to build a hypercomputer ⋮ Extension of the Dynamics of Unstable Systems ⋮ The complexity of proving chaoticity and the Church–Turing thesis ⋮ The Significance of Relativistic Computation for the Philosophy of Mathematics ⋮ TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Suppes predicate for general relativity and set-theoretically generic spacetimes
• Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
• The decision problem for exponential diophantine equations
• The wave equation with computable initial data such that its unique solution is not computable
• On the integration of algebraic functions
• Horseshoes in perturbations of Hamiltonian systems with two degrees of freedom
• Gödel's theorem and information
• Regular and stochastic motion
• Geodesic flows are Bernoullian
• Register machine proof of the theorem on exponential diophantine representation of enumerable sets
• Universal diophantine equation
• On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
• Algorithmic Information Theory
• Hilbert's Tenth Problem is Unsolvable
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
• Unpredictability and undecidability in dynamical systems
• Deterministic Nonperiodic Flow
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• The Undecidability of the Existence of Zeros of Real Elementary Functions
• Some undecidable problems involving elementary functions of a real variable
• The Second Fundamental Forms of S 6 and P n (C)
• Solution of the identity problem for integral exponential functions
• On Canonical Forms and Simplification
• Zwei Unentscheidbare Probleme Der Analysis
• Abbreviating proofs by adding new axioms
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: Undecidability and incompleteness in classical mechanics