Hypercomputation: philosophical issues

A survey of the field of hypercomputation, including discussion of four a priori objections to the possibility of hypercomputation. An exegesis of Turing's pre- and post-war writings on the mind is given, and Turing's views on the scope of machines are discussed.

[1]  B. Jack Copeland,et al.  Narrow Versus Wide Mechanism: Including a Re-Examination of Turing’s Views on the Mind-Machine Issue , 2000 .

[2]  Alice Ambrose.  IV.—FINITISM IN MATHEMATICS (I) , 1935 .

[3]  Jaakko Hintikka.  An Alternative Concept of Computability , 1998 .

[4]  Hava T. Siegelmann,et al.  Neural and Super-Turing Computing , 2003, Minds and Machines.

[5]  Steve Coles.  Chess , 1973, SGAR.

[6]  Alice Ambrose.  III.—FINITISM IN MATHEMATICS (II.) , 1935 .

[7]  A. Church.  Review: A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem , 1937 .

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

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

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

[11]  Bertrand Russell.  VII.—The Limits of Empiricism , 1936 .

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

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

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

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

[16]  A. Turing.  Lecture to the London Mathematical Society on 20 February 1947. 1986. , 1995, M.D. computing : computers in medical practice.

[17]  Jaakko Hintikka,et al.  Language, truth and logic in mathematics , 1997, Jaakko Hintikka selected papers.

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

[19]  Tien D. Kieu,et al.  Quantum Hypercomputation , 2002, Minds and Machines.

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

[21]  Alonzo Church,et al.  A. M. Turing. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society , 2 s. vol. 42 (1936–1937), pp. 230–265. , 1937, Journal of Symbolic Logic.

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

[23]  Mike Stannett,et al.  Computation and Hypercomputation , 2003, Minds and Machines.

[24]  Ralph Erskine,et al.  Action This Day , 2001 .

[25]  John L. Casti,et al.  Unconventional Models of Computation , 2002, Lecture Notes in Computer Science.

[26]  Wilfried Sieg,et al.  Mechanical Procedures and Mathematical Experience , 1991 .

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

[28]  Saul Kripke.  Wittgenstein on Rules and Private Language: An Elementary Exposition , 1984 .

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

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

[31]  Alexander George.  Mathematics and mind , 1994 .

[32]  Gualtiero Piccinini,et al.  Alan Turing and the Mathematical Objection , 2003, Minds and Machines.

[33]  P. R. Sloan,et al.  Discovering Complexity: Decomposition and Localization as Strategies in Scientific Research. William Bechtel , Robert C. Richardson , 1994 .

[34]  B. Jack Copeland.  A Lecture and Two Radio Broadcasts on Machine Intelligence by Alan Turing , 1995, Machine Intelligence 15.

[35]  Brian E. Carpenter,et al.  A. M. Turing's ACE Report of 1946 and Other Papers , 1986 .

[36]  C. Teuscher,et al.  Alan Turing: Life and Legacy of a Great Thinker , 2004, Springer Berlin Heidelberg.

[37]  A. M. Turing,et al.  Can Automatic Calculating Machines Be Said to Think , 2004 .

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

[39]  Andrew Hodges,et al.  What Would Alan Turing Have Done After 1954 , 2004 .

[40]  Bruno Scarpellini.  Two Undecidable Problems of Analysis , 2004, Minds and Machines.

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

[42]  Cristian S. Calude,et al.  Coins, Quantum Measurements, and Turing's Barrier , 2002, Quantum Inf. Process..

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

[44]  Mark Burgin.  From Neural Networks to Grid Automata , 2003, Modelling and Simulation.

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

[46]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[47]  Alex Kane,et al.  Coins , 1984 .

[48]  Jon Doyle.  What is Church's Thesis? An Outline* , 2004, Minds and Machines.

[49]  William G. Faris.  Shadows of the Mind: A Search for the Missing Science of Consciousness , 1997 .

[50]  Bruno Scarpellini.  Comments on `Two Undecidable Problems of Analysis' , 2004, Minds and Machines.

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

[52]  Ralph Erskine,et al.  Alan Turing: the Enigma - Book Reviem , 1984, Cryptologia.

[53]  B. Jack Copeland,et al.  Hypercomputation , 2004, Minds and Machines.

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

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

[56]  B. Jack Copeland.  Super turing-machines , 1998 .

[57]  Michael O. Rabin,et al.  Lecture to the london mathematical society on 20 february 1947 Universal Turing Machine , 2022 .

[58]  Mark Burgin,et al.  How we know what technology can do , 2001, CACM.

[59]  B. Jack Copeland.  The Modern History of Computing , 2006 .

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