On Attempting to Model the Mathematical Mind

Abstract In his important 1939 paper, Alan Turing introduced novel notions such as ordinal logics and oracle machines. These could be interpreted as possible ingredients of an approach to model human mathematical understanding in a way that goes beyond the conventional ideas of formal systems of axioms and rules of procedure. A hope appears to have been that in this way one might circumvent the limitations to formal reasoning that are revealed by Godel's incompleteness theorems. In line with such aims, an idea of a cautious oracle device is here introduced (differing, in intention, from related ideas put forward by others previously), which is supposed to give accurate answers to mathematical questions whenever it claims to have an answer, but which may sometimes confess to being unable to provide an answer and sometimes continues trying indefinitely without success. Despite such devices seeming to be somewhat closer to human mathematical capabilities than appears to be provided by a standard Turing machine, or Turing oracle machine, they are still limited by being subject to a Godel-type diagonalization argument. Although leaving open the question of what actual physical processes might underlie human mathematical insight, these arguments appear to indicate a significant constraint on any such hypothetical process. Turing's ordinal logics In early September 1955, I attended a lecture given by Max Newman on the topic of ordinal logic . I found the lecture to be one of the most fascinating that I ever attended. Alan Turing had died only a little over a year earlier and this talk was dedicated to him, being essentially based on Turing's 1939 paper on this topic. Newman also started his lecture by providing, as Turing had done in his paper, an introduction to Church's λ -calculus. It has been said that the somewhat limited initial impact that Turing's 1939 paper had on the mathematical community at that time may have been partly due to his phrasing the paper in terms of the λ -calculus, which is hard to employ in an explicit way and makes the reading difficult. Nonetheless, one of the things that did strike me particularly about Newman's lecture was the extraordinary economy of concept exhibited by Church's calculus.

[1]  B. Jack Copeland,et al.  What Turing Did after He Invented the Universal Turing Machine , 2000, J. Log. Lang. Inf..

[2]  S. Cooper Enumeration reducibility, nondeterministic computations and relative computability of partial functions , 1990 .

[3]  Daisuke Fujita,et al.  Atomic water channel controlling remarkable properties of a single brain microtubule: correlating single protein to its supramolecular assembly. , 2013, Biosensors & bioelectronics.

[4]  R. Penrose,et al.  Consciousness in the universe: a review of the 'Orch OR' theory. , 2014, Physics of life reviews.

[5]  S. Feferman Turing in the land of O(z) , 1988 .

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

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

[8]  Roger Penrose,et al.  Beyond the Doubting of a Shadow A Reply to Commentaries on Shadows of the Mind , 1996 .

[9]  R. Penrose Uncertainty in quantum mechanics: faith or fantasy? , 2011, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[10]  R. Penrose,et al.  Conscious Events as Orchestrated Space-Time Selections , 1996 .

[11]  S. Hameroff,et al.  Quantum computation in brain microtubules: decoherence and biological feasibility. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  J. Lucas Minds, Machines and Gödel , 1961, Philosophy.

[13]  Andrew Hodges Alan Turing and the Turing machine , 1988 .

[14]  Solomon Feferman,et al.  Transfinite recursive progressions of axiomatic theories , 1962, Journal of Symbolic Logic.

[15]  Christos H. Papadimitriou,et al.  Kurt Godel and the Foundations of Mathematics: Horizons Of Truth , 2014 .

[16]  R. Penrose On the Gravitization of Quantum Mechanics 1: Quantum State Reduction , 2014, Foundations of Physics.

[17]  Roger Penrose Reminiscences of Christopher Strachey , 2000, High. Order Symb. Comput..

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

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

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

[21]  Daisuke Fujita,et al.  Multi-level memory-switching properties of a single brain microtubule , 2013 .

[22]  Max Tegmark,et al.  The importance of quantum decoherence in brain processes , 1999, ArXiv.

[23]  S. Cooper,et al.  Systems of Logic Based on Ordinals , 2013 .

[24]  P. Veenhuis The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics , 1995 .

[25]  Alan M. Turing,et al.  Computability and λ-definability , 1937, Journal of Symbolic Logic.

[26]  R. Penrose Kurt Gödel and the Foundations of Mathematics: Gödel, the Mind, and the Laws of Physics , 2011 .

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