Toward a Formal Philosophy of Hypercomputation

Does what guides a pastry chef stand on par, from the standpoint of contemporary computer science, with what guides a supercomputer? Did Betty Crocker, when telling us how to bake a cake, provide an effective procedure, in the sense of `effective' used in computer science? According to Cleland, the answer in both cases is ``Yes''. One consequence of Cleland's affirmative answer is supposed to be that hypercomputation is, to use her phrase, ``theoretically viable''. Unfortunately, though we applaud Cleland's ``gadfly philosophizing'' (as, in fact, seminal), we believe that unless such a modus operandi is married to formal philosophy, nothing conclusive will be produced (as evidenced by the problems plaguing Cleland's work that we uncover). Herein, we attempt to pull off not the complete marriage for hypercomputation, but perhaps at least the beginning of a courtship that others can subsequently help along.

[1]  Carol E. Cleland Recipes, Algorithms, and Programs , 2004, Minds and Machines.

[2]  Bertrand Russell,et al.  The Limits of Empiricism. , 1937 .

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

[4]  George Boolos,et al.  Computability and logic , 1974 .

[5]  Michael Brooks,et al.  Quantum Computing and Communications , 1999, Springer London.

[6]  Selmer Bringsjord,et al.  In Computation, Parallel is Nothing, Physical Everything , 2001, Minds and Machines.

[7]  Carol E. Cleland Effective procedures and computable functions , 2004, Minds and Machines.

[8]  Selmer Bringsjord,et al.  What Robots Can and Can’t Be , 1992 .

[9]  Elaine J. Weyuker,et al.  Computability, complexity, and languages - fundamentals of theoretical computer science , 2014, Computer science and applied mathematics.

[10]  Hava T. Siegelmann,et al.  Analog computation via neural networks , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[11]  Hilary Putnam,et al.  Trial and error predicates and the solution to a problem of Mostowski , 1965, Journal of Symbolic Logic.

[12]  S. Lloyd Quantum-Mechanical Computers , 1995 .

[13]  Jörg Flum,et al.  Mathematical logic , 1985, Undergraduate texts in mathematics.

[14]  R. Feynman Simulating physics with computers , 1999 .

[15]  J. Moor,et al.  The digital phoenix : how computers are changing philosophy , 1998 .

[16]  Peter F. Smith,et al.  Space, Time and Motion: A Philosophical Introduction. , 1976 .

[17]  M. B. Pour-El,et al.  The wave equation with computable initial data such that its unique solution is not computable , 1981 .

[18]  Christos H. Papadimitriou,et al.  Elements of the Theory of Computation , 1997, SIGA.

[19]  Selmer Bringsjord computation, among other things, is beneath us , 2004, Minds and Machines.

[20]  Joseph Ford,et al.  How random is a coin toss , 1983 .

[21]  H T Siegelmann,et al.  Dating and Context of Three Middle Stone Age Sites with Bone Points in the Upper Semliki Valley, Zaire , 2007 .

[22]  E. Mark Gold,et al.  Limiting recursion , 1965, Journal of Symbolic Logic.

[23]  P. Kugel,et al.  Thinking may be more than computing , 1986, Cognition.

[24]  Selmer Bringsjord,et al.  Artificial Intelligence and Literary Creativity: Inside the Mind of Brutus, A Storytelling Machine , 1999 .

[25]  Edward Fredkin,et al.  Digital mechanics , 1991 .

[26]  H. Weyl,et al.  Philosophy of Mathematics and Natural Science , 1950 .

[27]  D. Deutsch Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[28]  Eric Schechter Constructivism Is Difficult , 2001, Am. Math. Mon..

[29]  Dale Jacquette,et al.  Philosophy of Mind , 1993 .

[30]  B. Jack Copeland,et al.  EVEN TURING MACHINES CAN COMPUTE UNCOMPUTABLE FUNCTIONS , 1998 .

[31]  Marian Boylan Pour-el,et al.  A computable ordinary differential equation which possesses no computable solution , 1979 .

[32]  John R. Searle,et al.  The Rediscovery of the Mind , 1995, Artif. Intell..