2001/12/01 by E. Brian Davies · 1 citation
Computer Science · Physics and Astronomy · Mathematics · #Computability, Logic, AI Algorithms #Quantum Mechanics and Applications #Quantum Computing Algorithms and Architecture #Intuitionism #Relevance (law) #Turing #Computer science #Epistemology #Turing machine #Universe #Mathematics #Mathematical economics #Philosophy #Programming language #Physics #Political science
paper · doi:10.1093/bjps/52.4.671
openalex publication_date 2001/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/18
We describe in some detail how to build an infinite computing machine within a continuous Newtonian universe. The relevance of our construction to the Church‐Turing thesis and the Platonist‐Intuitionist debate about the nature of mathematics is also discussed.