Hypercomputation: Philosophical issues

DOI10.1016/J.TCS.2003.12.014MaRDI QIDQ1434379zbMATH OpenOpenAlexFDO

Authors 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

Churchepistemic and physical objections to the possibility of hypercomputationmindoracleSuper-TuringTuring

Mathematics Subject Classification ID

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

Recommendations

• The hypercomputation thesis: stakes and philosophical problems
• Hypercomputation and the Physical Church‐Turing Thesis
• The case for hypercomputation
• scientific article; zbMATH DE number 1909825
• Hypercomputation

Cites work

• Analog computation via neural networks
• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3860368 (Why is no real title available?)
• scientific article; zbMATH DE number 3924764 (Why is no real title available?)
• scientific article; zbMATH DE number 1189126 (Why is no real title available?)
• scientific article; zbMATH DE number 727991 (Why is no real title available?)
• scientific article; zbMATH DE number 1103298 (Why is no real title available?)
• scientific article; zbMATH DE number 1869997 (Why is no real title available?)
• scientific article; zbMATH DE number 1909820 (Why is no real title available?)
• scientific article; zbMATH DE number 1909822 (Why is no real title available?)
• scientific article; zbMATH DE number 1909824 (Why is no real title available?)
• scientific article; zbMATH DE number 1909825 (Why is no real title available?)
• scientific article; zbMATH DE number 1909827 (Why is no real title available?)
• scientific article; zbMATH DE number 1909829 (Why is no real title available?)
• scientific article; zbMATH DE number 1909831 (Why is no real title available?)
• Limiting recursion
• Systems of Logic Based on Ordinals^†
• Trial and error predicates and the solution to a problem of Mostowski
• X-machines and the halting problem: Building a super-turing machine
• Zwei Unentscheidbare Probleme Der Analysis

Cited in

(44)

• What is computation?
• Superminds. People harness hypercomputation, and more
• The modal argument for hypercomputing minds
• Hypercomputation by definition
• The concept of computability
• Uncomputability: The problem of induction internalized
• A computational journey into the mind
• Is there any real substance to the claims for a ``new computationalism?
• On TAE machines and their computational power
• Physical constraints on hypercomputation
• A new Gödelian argument for hypercomputing minds based on the busy beaver problem
• The case for hypercomputation
• A hypercomputational alien
• Definability as hypercomputational effect
• Some thoughts on hypercomputation
• Zeno machines and hypercomputation
• Undecidability through Fourier series
• On hypercomputation, universal and diagonalization complete problems
• Towards formal verification of computations and hypercomputations in relativistic physics
• Hypercomputation
• Hyperloops do not threaten the notion of an effective procedure
• scientific article; zbMATH DE number 1163997 (Why is no real title available?)
• scientific article; zbMATH DE number 2013794 (Why is no real title available?)
• On the Possibility, or Otherwise, of Hypercomputation
• Is universal computation a myth?
• scientific article; zbMATH DE number 1869985 (Why is no real title available?)
• scientific article; zbMATH DE number 1869995 (Why is no real title available?)
• scientific article; zbMATH DE number 1869996 (Why is no real title available?)
• The mathematician's bias -- and the return to embodied computation
• The significance of relativistic computation for the philosophy of mathematics
• A Survey on Analog Models of Computation
• Physical computability theses
• Superintelligence cannot be contained: lessons from computability theory
• Modeling hyperarithmetic computability on machines with constraints
• Small steps toward hypercomputation via infinitary machine proof verification and proof generation
• Hypercomputation: fantasy or reality? A position paper
• The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem
• Accelerating machines: a review
• The hypercomputation thesis: stakes and philosophical problems
• The Diagonal Method and Hypercomputation
• Logical Approaches to Computational Barriers
• Recursive analysis of singular ordinary differential equations
• Refined Kolmogorov complexity of analog, evolving and stochastic recurrent neural networks
• Expressive power of first-order recurrent neural networks determined by their attractor dynamics

This page was built for publication: Hypercomputation: Philosophical issues

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