Building Infinite Machines
From MaRDI portal
Publication:4483956
DOI10.1093/bjps/52.4.671zbMath1020.03004OpenAlexW2171593695WikidataQ56225232 ScholiaQ56225232MaRDI QIDQ4483956
Publication date: 27 May 2003
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/52.4.671
Church-Turing thesisnature of mathematicscontinuous Newtonian universeinfinite computing machinePlatonist-Intuitionist debate
Philosophy of mathematics (00A30) Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10)
Related Items (14)
How to build an infinite lottery machine ⋮ Computing with polynomial ordinary differential equations ⋮ Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ The dependence of computability on numerical notations ⋮ Physical Computability Theses ⋮ Hyperloops Do Not Threaten the Notion of an Effective Procedure ⋮ Supertasks do not increase computational power ⋮ Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer ⋮ Embedding infinitely parallel computation in Newtonian kinematics ⋮ The many forms of hypercomputation ⋮ On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism ⋮ Accelerating machines: a review ⋮ A new problem for rule following ⋮ A Survey on Analog Models of Computation
This page was built for publication: Building Infinite Machines
