Strong determinism vs. computability

MaRDI QIDQ2702578zbMATH OpenFDO

Authors Douglas I. Campbell, Karl Svozil, Doru Ştefănescu, Cristian S. Calude

Publication date 21 October 2001

Full work available at URL https://arxiv.org/abs/quant-ph/9412004

zbMATH Keywords

algorithmic theorycomputabilityGödel's Incompleteness Theoremstrong determinismuncomputable physical laws

Mathematics Subject Classification ID

Physics (00A79) Foundations of classical theories (including reverse mathematics) (03B30) General and philosophical questions in quantum theory (81P05) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10)

Recommendations

• On randomness, determinism and computability
• Determinism versus nondeterminism with arithmetic tests and computation
• Classical computability and indicators of nondeterminism
• Nondeterministic computability: philosophical foundations
• Computability and randomness
• Computability and Randomness
• Computability and Incomputability

Cited in

(7)

• Predictability in deterministic theories
• Mathematics, Metaphysics and the Multiverse
• scientific article; zbMATH DE number 1163979 (Why is no real title available?)
• scientific article; zbMATH DE number 1405574 (Why is no real title available?)
• Superintelligence cannot be contained: lessons from computability theory
• Uncomputability and physical law
• Undecidability in physics: a review

This page was built for publication: Strong determinism vs. computability

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