Building Infinite Machines

DOI10.1093/BJPS/52.4.671MaRDI QIDQ4483956zbMATH OpenOpenAlexWikidataFDO

Authors E. Brian Davies

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

zbMATH Keywords

Church-Turing thesiscontinuous Newtonian universeinfinite computing machinenature of mathematicsPlatonist-Intuitionist debate

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10)

Recommendations

• How to build an infinite lottery machine
• scientific article; zbMATH DE number 1909830
• Infinite time Turing machines
• Reconstructing infinite objects
• Hypermachines
• Logical Approaches to Computational Barriers
• scientific article; zbMATH DE number 7298599
• Taming the infinite

Cited in

(16)

• How to build an infinite lottery machine
• Supertasks do not increase computational power
• Embedding infinitely parallel computation in Newtonian kinematics
• The many forms of hypercomputation
• Computing with polynomial ordinary differential equations
• Hyperloops do not threaten the notion of an effective procedure
• On computable numbers, nonuniversality, and the genuine power of parallelism
• Turing machines can be efficiently simulated by the general purpose analog computer
• A Survey on Analog Models of Computation
• Physical computability theses
• Accelerating machines: a review
• The dependence of computability on numerical notations
• Editors' introduction
• Programming infinite machines
• A new problem for rule following
• Can Newtonian systems, bounded in space, time, mass and energy compute all functions?

This page was built for publication: Building Infinite Machines

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