Physical Computability Theses

DOI10.1007/978-3-030-34316-3_9zbMath1498.68109OpenAlexW3016103574MaRDI QIDQ5119662

Oron Shagrir, B. Jack Copeland

Publication date: 31 August 2020

Published in: Jerusalem Studies in Philosophy and History of Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-34316-3_9

zbMATH Keywords

Church-Turing thesisrelativistic computationphysical computationcomputation over the realscomputing halting functiondecidability in physicsquantum undecidability

Mathematics Subject Classification ID

General and philosophical questions in quantum theory (81P05) General relativity (83C99) Turing machines and related notions (03D10) Quantum algorithms and complexity in the theory of computing (68Q12) Other nonclassical models of computation (68Q09) Logic in the philosophy of science (03A10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplace's demon consults an oracle: the computational complexity of prediction
• General relativistic hypercomputing and foundation of mathematics
• The wave equation with computable initial data such that its unique solution is not computable
• Hypercomputation: Philosophical issues
• Relativistic computers and the Turing barrier
• Computable functionals
• On the definitions of computable real continuous functions
• Physical Computation
• Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Building Infinite Machines
• Unpredictability and undecidability in dynamical systems
• Deciding Arithmetic Using SAD Computers
• The Physical Church–Turing Thesis: Modest or Bold?
• The Extent of Computation in Malament–Hogarth Spacetimes
• SAD Computers and Two Versions of the Church–Turing Thesis
• Zwei Unentscheidbare Probleme Der Analysis
• An Unsolvable Problem of Elementary Number Theory
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On the concept of a random sequence
• Non-Turing computations via Malament--Hogarth space-times

This page was built for publication: Physical Computability Theses