Hypercomputation: Philosophical issues

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

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

Church epistemic and physical objections to the possibility of hypercomputation mind oracle Super-Turing Turing

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)

Review text

The term hypercomputation refers to the computation of functions or numbers which are uncomputable by a universal Turing machine. In this paper the author surveys several models of hypercomputation resulting from acceleration, asynchronous coupling and environmental interaction of standard Turing machines. He also considers hypercomputation based on ``random input and the measurement of observables. Well-known epistemic and physical objections to the possibility of hypercomputation are discussed. They concern the identification and verification of the presence of a non-recursive source and the very realizability of such a source under various finiteness conditions. The author attempts to rebut these ``a priori qualms. Accordingly, he asserts that the possibility of hypercomputation is a downright empirical question. The author then defends the relevance of Turing's conception of an oracle machine for the hypercomputation debate. Finally the paper contains a brief but informed exegesis of Turing's writings on the notion of machine, the scope of computability, and their relation to mind and learning.

Recommendations

Cites work

Cited in

(44)

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)