Deciding Arithmetic Using SAD Computers
From MaRDI portal
Publication:4670578
DOI10.1093/bjps/55.4.681zbMath1076.03027OpenAlexW2026367516MaRDI QIDQ4670578
Publication date: 22 April 2005
Published in: The British Journal for the Philosophy of Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/bjps/55.4.681
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) First-order arithmetic and fragments (03F30) Turing machines and related notions (03D10)
Related Items (20)
The physical Church thesis as an explanation of the Galileo thesis ⋮ Membrane system models for super-Turing paradigms ⋮ A proof of the Geroch-Horowitz-Penrose formulation of the strong cosmic censor conjecture motivated by computability theory ⋮ The dependence of computability on numerical notations ⋮ Computation as an unbounded process ⋮ Physical Computability Theses ⋮ Malament-Hogarth machines and Tait's axiomatic conception of mathematics ⋮ Hyperloops Do Not Threaten the Notion of an Effective Procedure ⋮ Supertasks do not increase computational power ⋮ The case for hypercomputation ⋮ Embedding infinitely parallel computation in Newtonian kinematics ⋮ Relativistic computers and the Turing barrier ⋮ Twin paradox and the logical foundation of relativity theory ⋮ General relativistic hypercomputing and foundation of mathematics ⋮ The computational status of physics ⋮ A new problem for rule following ⋮ Abstract geometrical computation. III: Black holes for classical and analog computing ⋮ Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems ⋮ Using Isabelle/HOL to verify first-order relativity theory ⋮ Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
This page was built for publication: Deciding Arithmetic Using SAD Computers
