Uncomputability and physical law

DOI10.1007/978-3-319-43669-2_6MaRDI QIDQ6599287zbMATH OpenFDO

Authors Seth Lloyd

Publication date 6 September 2024

Full work available at URL https://doi.org/10.1007/978-3-319-43669-2_6

zbMATH Keywords

concise descriptionincompleteness theoremshort programTuring machineuniversal computation

Mathematics Subject Classification ID

Logic in the philosophy of science (03A10) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Limits of Computation and Physical Reality
• Classical physics and the Church--Turing Thesis
• Strong determinism vs. computability
• scientific article; zbMATH DE number 1405574
• scientific article; zbMATH DE number 1406123

Cites work

• A formal theory of inductive inference. Part II
• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the Length of Programs for Computing Finite Binary Sequences
• Universal Quantum Simulators
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I

Cited in

(3)

• Limits of Computation and Physical Reality
• How real is incomputability in physics?
• Understanding the thermodynamics of computation: a pedagogical overview

This page was built for publication: Uncomputability and physical law

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