Hypercomputation

A survey of the field of hypercomputation, including discussion of a variety of objections.

[1]  A. Komar.  UNDECIDABILITY OF MACROSCOPICALLY DISTINGUISHABLE STATES IN QUANTUM FIELD THEORY , 1964 .

[2]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[3]  Matthias Scheutz.  Narrow versus Wide Mechanism , 2003 .

[4]  M. Hogarth.  Does general relativity allow an observer to view an eternity in a finite time? , 1992 .

[5]  Jelliffe,et al.  Our Knowledge of the External World as a Field for Scientific Method in Philosophy , 1917 .

[6]  B. Jack Copeland,et al.  The Broad Conception of Computation , 1997 .

[7]  Georg Kreisel,et al.  Which number theoretic problems can be solved in recursive progressions on Π11-paths through O? , 1972, Journal of Symbolic Logic.

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

[9]  Lee A. Rubel,et al.  Some mathematical limitations of the general-purpose analog computer , 1988 .

[10]  M. B. Pour-El,et al.  Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers) , 1974 .

[11]  Mike Stannett,et al.  X-machines and the halting problem: Building a super-turing machine , 1990, Formal Aspects of Computing.

[12]  R. M. Blake.  The Paradox of Temporal Process , 1926 .

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

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

[15]  Eduardo D. Sontag,et al.  Analog Neural Nets with Gaussian or Other Common Noise Distributions Cannot Recognize Arbitrary Regular Languages , 1999, Neural Computation.

[16]  Vannevar Bush,et al.  A New Type of Differential Analyzer , 1945 .

[17]  Claude E. Shannon,et al.  Mathematical Theory of the Differential Analyzer , 1941 .

[18]  S. M. Krylov.  Formal technology and universal systems. I , 1986 .

[19]  Hava T. Siegelmann,et al.  On the Computational Power of Neural Nets , 1995, J. Comput. Syst. Sci..

[20]  Bruno Scarpellini.  Zwei Unentscheidbare Probleme Der Analysis , 1963 .

[21]  Sergey M. Krylov.  Formal technology and cognitive processes , 1996 .

[22]  Robin Gandy,et al.  Church's Thesis and Principles for Mechanisms , 1980 .

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

[24]  B. Copeland,et al.  Beyond the universal Turing machine , 1999 .

[25]  Gerard Casey.  Minds and machines , 1992 .

[26]  Pekka Orponen,et al.  On the Effect of Analog Noise in Discrete-Time Analog Computations , 1996, Neural Computation.

[27]  P M Churchland,et al.  Could a machine think? , 1990, Scientific American.

[28]  A. Bogdanov,et al.  Essays in tektology : the general science of organization , 1984 .

[29]  B. Jack Copeland,et al.  Accelerating Turing Machines , 2002, Minds and Machines.

[30]  Peter Wegner,et al.  Why interaction is more powerful than algorithms , 1997, CACM.

[31]  J. Earman,et al.  Forever Is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes , 1993, Philosophy of Science.

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

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

[34]  A. Church.  On the concept of a random sequence , 1940 .

[35]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[36]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[37]  Stuart M. Shieber.  Can Digital Computers Think , 2004 .

[38]  Lee A. Rubel,et al.  Digital simulation of analog computation and Church's thesis , 1989, Journal of Symbolic Logic.

[39]  L. Rubel,et al.  A differentially algebraic replacement theorem, and analog computability , 1987 .

[40]  B. Jack Copeland,et al.  Super Turing-machines , 1998, Complex..

[41]  John D. Norton,et al.  Infinite pains: the trouble with supertasks , 1996 .

[42]  Bruce J. MacLennan,et al.  Technology-Independent Design of Neurocomputers: The Universal Field Computer 1 , 1987 .

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

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

[45]  Oliver Aberth,et al.  Analysis in the Computable Number Field , 1968, JACM.

[46]  Ian Stewart,et al.  Deciding the undecidable , 1991, Nature.

[47]  A. Turing.  Intelligent Machinery, A Heretical Theory* , 1996 .

[48]  M. Hogarth.  Non-Turing Computers and Non-Turing Computability , 1994, PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association.

[49]  Oron Shagrir,et al.  Effective Computation by Humans and Machines , 2002, Minds and Machines.

[50]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[51]  David Israel.  Reflections on Gödel's and Gandy's Reflections on Turing's Thesis , 2004, Minds and Machines.

[52]  Carol E. Cleland.  Is the Church-Turing thesis true? , 1993, Minds and Machines.

[53]  G. Kreisel.  A notion of mechanistic theory , 1974, Synthese.

[54]  Georg Kreisel,et al.  Church's thesis and the ideal of informal rigour , 1987, Notre Dame J. Formal Log..

[55]  G. Kreisel,et al.  Hilbert's programme and the search for automatic proof procedures , 1970 .

[56]  Carlo Cellucci,et al.  MATHEMATICAL LOGIC: WHAT HAS IT DONE FOR THE PHILOSOPHY OF MATHEMATICS? , 2005 .

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