A Brief Critique of Pure Hypercomputation

Hypercomputation—the hypothesis that Turing-incomputable objects can be computed through infinitary means—is ineffective, as the unsolvability of the halting problem for Turing machines depends just on the absence of a definite value for some paradoxical construction; nature and quantity of computing resources are immaterial. The assumption that the halting problem is solved by oracles of higher Turing degree amounts just to postulation; infinite-time oracles are not actually solving paradoxes, but simply assigning them conventional values. Special values for non-terminating processes are likewise irrelevant, since diagonalization can cover any amount of value assignments. This should not be construed as a restriction of computing power: Turing’s uncomputability is not a ‘barrier’ to be broken, but simply an effect of the expressive power of consistent programming systems.

[1]  Saul Gorn,et al.  THE TREATMENT OF AMBIGUITY AND PARADOX IN MECHANICAL LANGUAGES , 1961 .

[2]  Martin D. Davis,et al.  Why there is no such discipline as hypercomputation , 2006, Appl. Math. Comput..

[3]  Settimo Termini.  Imagination and Rigor , 2006 .

[4]  Peter Hilton,et al.  Category Theory, Homology Theory and their Applications II , 1969 .

[5]  Philip D. Welch,et al.  Post's and other problems in higher type supertasks , 2004 .

[6]  Warren D. Smith.  Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical tasks , 2006, Appl. Math. Comput..

[7]  Noson S. Yanofsky,et al.  A universal approach to self-referential paradoxes, incompleteness and fixed points , 2003, Bull. Symb. Log..

[8]  T. Toffoli.  Non-Conventional Computers , 1998 .

[9]  Philip D. Welch,et al.  On the Possibility, or Otherwise, of Hypercomputation , 2004, The British Journal for the Philosophy of Science.

[10]  Tien D. Kieu,et al.  The Diagonal Method and Hypercomputation , 2003, The British Journal for the Philosophy of Science.

[11]  William I. McLaughlin,et al.  Thomson's Lamp is Dysfunctional , 1998, Synthese.

[12]  Paul Benacerraf,et al.  Tasks, Super-Tasks, and the Modern Eleatics , 1962 .

[13]  David Bailey,et al.  On the rapid computation of various polylogarithmic constants , 1997, Math. Comput..

[14]  Benjamin Wells.  Hypercomputation by definition , 2004, Theor. Comput. Sci..

[15]  S. Barry Cooper,et al.  Definability as hypercomputational effect , 2006, Appl. Math. Comput..

[16]  Toby Ord,et al.  The many forms of hypercomputation , 2006, Appl. Math. Comput..

[17]  Haim Gaifman,et al.  Naming and Diagonalization, from Cantor to Gödel to Kleene , 2006, Log. J. IGPL.

[18]  Paolo Cotogno,et al.  Hypercomputation and the Physical Church‐Turing Thesis , 2003, The British Journal for the Philosophy of Science.

[19]  F. W. Lawvere,et al.  Diagonal arguments and cartesian closed categories , 1969 .

[20]  Jorge Soto-Andrade,et al.  Self-reference and fixed points: A discussion and an extension of Lawvere's Theorem , 1984 .

[21]  Andrej Bauer,et al.  First Steps in Synthetic Computability Theory , 2006, MFPS.

[22]  Amit Hagar,et al.  Quantum Hypercomputability? , 2006, Minds and Machines.

[23]  Petrus H. Potgieter,et al.  Zeno machines and hypercomputation , 2004, Theor. Comput. Sci..

[24]  Martin D. Davis.  The Myth of Hypercomputation , 2004 .

[25]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[26]  Alan M. Turing,et al.  Systems of Logic Based on Ordinals , 2012, Alan Turing's Systems of Logic.

[27]  Kenneth A. Ribet,et al.  Modular elliptic curves and fermat's last theorem , 1993 .

[29]  Dusko Pavlovic,et al.  On the structure of paradoxes , 1992, Arch. Math. Log..

[30]  Oron Shagrir,et al.  Super-tasks, accelerating Turing machines and uncomputability , 2004, Theor. Comput. Sci..

[31]  D. Corfield.  Conceptual mathematics: a first introduction to categories , 2002 .

[32]  J. F. Thomson,et al.  Tasks and Super-Tasks , 1954 .

[33]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[34]  Martin D. Davis.  Computability, Computation, and the Real World , 2006 .

[35]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[36]  Paul Young,et al.  An introduction to the general theory of algorithms , 1978 .

[37]  Thomas Mormann,et al.  The Space of Mathematics , 1992 .

[38]  Howard DeLong,et al.  A Profile of Mathematical Logic , 2004 .