Hypercomputation: Philosophical issues

DOI10.1016/j.tcs.2003.12.014zbMath1055.03007OpenAlexW2133694272MaRDI QIDQ1434379

B. Jack Copeland

Publication date: 4 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.014

zbMATH Keywords

mindoracleTuringChurchepistemic and physical objections to the possibility of hypercomputationSuper-Turing

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) History of mathematical logic and foundations (03-03) Computability and recursion theory (03D99) History of computer science (68-03)

Related Items

Undecidability through Fourier series, Physical Computability Theses, Recursive analysis of singular ordinary differential equations, The concept of computability, The case for hypercomputation, Zeno machines and hypercomputation, Accelerating machines: a review, Expressive power of first-order recurrent neural networks determined by their attractor dynamics, The Significance of Relativistic Computation for the Philosophy of Mathematics, A Survey on Analog Models of Computation

Cites Work

• X-machines and the halting problem: Building a super-turing machine
• Analog computation via neural networks
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion
• Zwei Unentscheidbare Probleme Der Analysis
• Systems of Logic Based on Ordinals^†
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item