Hypercomputation in the Chinese Room

I rehearse a number of objections to John Searle's famous Chinese room argument. One is the 'hypercomputational objection' (Copeland 2002a). Hypercomputation is the computation of functions that cannot be computed in the sense of Turing (1936); the term originates in Copeland and Proudfoot (1999). I defend my hypercomputational objection to the Chinese room argument from a response recently developed by Bringsjord, Bello and Ferrucci (2001).

[1]  Daniel C. Dennett,et al.  The Rediscovery of the Mind , 1992, Artif. Intell..

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

[3]  John Haugeland,et al.  Artificial intelligence - the very idea , 1987 .

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

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

[6]  Selmer Bringsjord,et al.  Creativity, the Turing Test, and the (Better) Lovelace Test , 2001, Minds and Machines.

[7]  B. Dickinson,et al.  The complexity of analog computation , 1986 .

[8]  Roy A. Sorensen,et al.  Mirror notation: symbol manipulation without inscription manipulation , 1999, J. Philos. Log..

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

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

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

[12]  James B. Hartle,et al.  Computability and physical theories , 1986, 1806.09237.

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

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

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

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

[17]  J. Searle.  THE MYSTERY OF CONSCIOUSNESS , 2019, Intellectual Entertainments.

[18]  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.

[19]  Roger Penrose,et al.  Shadows of the mind - a search for the missing science of consciousness , 1994 .

[20]  M. Bishop,et al.  Views into the Chinese Room: New Essays on Searle and Artificial Intelligence , 2002 .

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

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

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

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

[25]  B. Jack Copeland,et al.  Turing’s O-machines, Searle, Penrose and the brain , 1998 .

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

[27]  Stephen Cole Kleene.  Mathematical Logic , 1967 .

[28]  Bertrand Russell,et al.  Our Knowledge of the External World as a Field for Scientific Method in Philosophy , 1914 .

[29]  P. McLeod,et al.  Running to catch the ball , 1993, Nature.

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

[31]  Eugene Eric Kim,et al.  Ada and the First Computer , 1999 .

[32]  Adam Morton,et al.  Benacerraf and His Critics , 1996 .

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

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

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

[36]  Bertrand Russell,et al.  Bertrand Russell: Philosopher of the Century , 1967 .

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

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

[39]  J. Searle,et al.  Minds, Brains and Science , 1988 .

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

[41]  B. J. Copeland,et al.  Alan Turing’s Forgotten Ideas in Computer Science , 1999 .

[42]  John R. Searle,et al.  Minds, brains, and programs , 1980, Behavioral and Brain Sciences.

[43]  Joel David Hamkins,et al.  Infinite Time Turing Machines , 2000 .

[44]  Mario Bunge,et al.  Philosophy of Psychology , 1987 .

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

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

[47]  John Earman,et al.  A Primer on Determinism , 1986 .

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

[49]  B. Jack Copeland,et al.  Artificial Intelligence: A Philosophical Introduction , 1993 .

[50]  M. Beardsley.  Science behind the Wall. East Germany's liberated scientists regroup. , 1990, Scientific American.

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

[52]  Francisco Antonio Doria,et al.  Classical physics and Penrose's thesis , 1991 .

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

[54]  H. Weyl.  Philosophie der Mathematik und Naturwissenschaft , 1927 .

[55]  G. Kreisel.  A Notion of Mechanistic Theory , 1974 .

[56]  R. Penrose.  The emperor's new mind: concerning computers, minds, and the laws of physics , 1989 .

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

[58]  K. Sterelny.  The Representational Theory Of Mind , 1991 .

[59]  J. Searle,et al.  Is the brain's mind a computer program? , 1990, Scientific American.

[60]  Alonzo Church,et al.  A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.