Skip to main content
SpringerLink
Log in

Alan Turing and the Mathematical Objection

  • Published:
Minds and Machines Aims and scope Submit manuscript

Abstract

This paper concerns Alan Turing's ideas about machines, mathematical methods of proof, and intelligence. By the late 1930s, Kurt Gödel and other logicians, including Turing himself, had shown that no finite set of rules could be used to generate all true mathematical statements. Yet according to Turing, there was no upper bound to the number of mathematical truths provable by intelligent human beings, for they could invent new rules and methods of proof. So, the output of a human mathematician, for Turing, was not a computable sequence (i.e., one that could be generated by a Turing machine). Since computers only contained a finite number of instructions (or programs), one might argue, they could not reproduce human intelligence. Turing called this the ``mathematical objection'' to his view that machines can think. Logico-mathematical reasons, stemming from his own work, helped to convince Turing that it should be possible to reproduce human intelligence, and eventually compete with it, by developing the appropriate kind of digital computer. He felt it should be possible to program a computer so that it could learn or discover new rules, overcoming the limitations imposed by the incompleteness and undecidability results in the same way that human mathematicians presumably do.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Benacerraf, P. and Putnam, H. (1964), Philosophy of Mathematics, Englewood Cliffs, NJ: Prentice-Hall.

    Google Scholar 

  • Bernays, P. (1935a), 'Sur le platonisme dans les mathématiques', L'enseignement mathématique 34, pp. 52–69, reprinted in P. Benacerraf and H. Putnam (1964), Philosophy of Mathematics, Englewood Cliffs, NJ: Prentice-Hall, pp. 274- 286.

    Google Scholar 

  • Bernays, P. (1935b), 'Quelques points essentiels de la métamathématique', L'enseignement mathematique 34, pp. 70–95.

    Google Scholar 

  • Bernays, P. (1967), 'Hilbert, David', in P. Edwards, ed., Encyclopedia of Philosophy,Vol.3, New York: Macmillan and Free Press, pp. 496–504.

    Google Scholar 

  • Boolos, G. and Jeffrey, R. (1974), Computability and Logic, New York, NY: Cambridge University Press.

    Google Scholar 

  • Chalmers, D., ed. (1995), 'Symposium on Roger Penrose's Shadows of the Mind', Psyche 2, http://psyche.cs.monasch.edu.au.

  • Church, A. (1936), 'An Unsolvable Problem in Elementary Number Theory', The American Journal of Mathematics 58, pp. 345–363, reprinted in M. Davis (1965), The Undecidable, Ewlett, NY: Raven Press, pp. 88- 107.

    Google Scholar 

  • Church, A. (1937), 'Review of Turing (1936- 1937)', Journal of Symbolic Logic 2, pp. 42–43.

    Google Scholar 

  • Colvin, S.I. (1997), Intelligent Machinery; Turing's Ideas and Their Relation to the Work of Newell and Simon, unpublished M.S. Dissertation, Carnegie Mellon University.

  • Copeland, B.J. (1996), 'The Church-Turing Thesis', in E.N. Zalta, ed., Stanford Encyclopedia of Philosophy, <http://plato.stanford.edu>, as consulted in January 1999.

  • Copeland, B.J. (1999), 'A Lecture and Two Radio Broadcasts on Machine Intelligence by Alan Turing', in K. Furukawa, D. Michie, and S. Muggleton, eds, Machine Intelligence 15, Oxford: Oxford University Press.

    Google Scholar 

  • Copeland, B.J. (2000), 'Narrow Versus Wide Mechanism: Including a Re-Examination of Turing's Views on the Mind-Machine Issue', The Journal of Philosophy XCVI, pp. 5–32.

    Google Scholar 

  • Copeland, B.J. (forthcoming), The Essential Turing, Oxford: Oxford University Press.

  • Copeland, B.J. and Proudfoot, D. (1996), 'On Alan Turing's Anticipation of Connectionism', Synthese 108, pp. 361–377.

    Google Scholar 

  • Davis, M. (1958), Computability and Unsolvability, New York: McGraw-Hill.

    Google Scholar 

  • Davis, M. (1965), The Undecidable, Ewlett, NY: Raven Press.

    Google Scholar 

  • Davis, M. (1987), 'Mathematical Logic and the Origin of Modern Computers', in E.R. Phillips, ed., Studies in the History of Mathematics (The Mathematical Association of America), pp. 137–165, reprinted in R. Herken (1988), ed., The Universal Machine: A Half-Century Survey, NewYork: Oxford University Press, pp. 149- 174.

  • Dennett, D.C. (1978), Brainstorms: Philosophical Essays on Mind and Psychology, Cambridge, MA: MIT Press.

    Google Scholar 

  • Detlefsen, M. (1995), 'Wright on the Non-Mechanizability of Intuitionist Reasoning', Philosophia Mathematica 3, pp. 103–119.

    Google Scholar 

  • Eddington A.E. (1928), The Nature of the Physical World, Cambridge: Cambridge University Press.

    Google Scholar 

  • Feferman S. (1988), 'Turing in the Land of O(z)', in R. Herken, ed., The Universal Machine: A Half-Century Survey, New York: Oxford University Press, pp. 113–147.

    Google Scholar 

  • Folina, J. (1998), 'Church's Thesis: Prelude to a Proof', Philosophia Mathematica 6, pp. 302–323.

    Google Scholar 

  • Gandy, R. (1980), 'Church's Thesis and principles for mechanisms', in J. Barwise, H.J. Keisler, and K. Kunen, eds., The Kleene Symposium, Amsterdam: North-Holland, pp. 123–148.

    Google Scholar 

  • Gandy, R. (1996), 'Human versus Mechanical Intelligence', in P.J.R. Millican and A. Clark, eds., Machines and Thought: The Legacy of Alan Turing, Oxford: Clarendon, pp. 125–136.

    Google Scholar 

  • Gödel, K. (1931), 'On Formally Undecidable Propositions of Principia Mathematica and Related Systems I', Monatschefte für Mathematik und Physik 38, pp. 173–198, reprinted in M. Davis (1965), The Undecidable, Ewlett, NY: Raven Press, pp. 5- 38.

    Google Scholar 

  • Gödel, K. (1934), 'On Undecidable Propositions of Formal Mathematical Systems', in M. Davis (1965), The Undecidable, Ewlett, NY: Raven Press, pp. 41–71.

    Google Scholar 

  • Gödel, K. (1951), 'Some Basic Theorems on the Foundations of Mathematics and Their Implications', edited text of Josiah Gibbs Lecture delivered at Brown University, in S. Feferman et al., eds., (1995), Collected Works, Vol III, Oxford: Oxford University Press, pp. 304–323.

    Google Scholar 

  • Gödel, K. (1958), 'On a Hitherto Unutilized Extension of the Finitary Standpoint', Dialectica 12, pp. 280–287, reprinted in S. Feferman et al., eds., (1990), Collected Works, Vol II, Oxford: Oxford University Press, pp. 241- 251.

    Google Scholar 

  • Gödel, K. (1965), 'Postscriptum to' On Undecidable Propositions of Formal Mathematical Systems”, in M. Davis (1965), The Undecidable, Ewlett, NY: Raven Press, pp. 71–73.

    Google Scholar 

  • Gödel, K. (1972), 'Some Remarks on the Undecidability Results', in S. Feferman et al., eds., Collected Works, Vol. II, Oxford: Oxford University Press, 1990, pp. 305–306.

    Google Scholar 

  • Grush, R. and Churchland, P.S. (1995), 'Gaps in Penrose's Toilings', Journal of Consciousness Studies 2, pp. 10–29; reprinted in P.M. Churchland and P.S. Churchland (1998), On the Contrary; Critical Essays, 1987- 1997, Cambridge, MA: MIT Press, pp. 205- 229, 324- 327.

    Google Scholar 

  • Herbrand, J. (1971), Logical Writings, W.D. Goldfarb, ed., Dordrecht: Reidel.

    Google Scholar 

  • Herken, R., ed. (1988), The Universal Machine: A Half-Century Survey, New York: Oxford University Press.

  • Hilbert, D. and Ackermann, W. (1928), Grundzüge der theoretischen Logik, Berlin: Springer.

    Google Scholar 

  • Hodges, A. (1983), Alan Turing: The Enigma, New York: Simon and Schuster.

    Google Scholar 

  • Hodges, A. (1988), 'Alan Turing and the Turing Machine', in R. Herken, ed., The Universal Turing Machine: A Half-Century Survey, New York: Oxford University Press, pp. 3–15.

    Google Scholar 

  • Hodges, A. (1997), Turing; a Natural Philosopher, London: Phoenix.

    Google Scholar 

  • Ince, D.C., ed. (1992), Collected Works of A.M. Turing: Mechanical Intelligence, Amsterdam: North Holland.

  • Kálmar, L. (1959), 'An Argument Against the Plausibility of Church's Thesis', in A. Heyting, ed., Constructivity in Mathematics, Amsterdam: North-Holland, pp. 72–80.

    Google Scholar 

  • Kleene, S.C. (1935), 'General Recursive Functions of Natural Numbers', American Journal of Mathematics 57, pp. 153–173, 219- 244.

    Google Scholar 

  • Kleene, S.C. (1938), 'On Notation for Ordinal Numbers', Journal of Symbolic Logic 3, pp. 150–155.

    Google Scholar 

  • Kleene, S. C. (1943), 'Recursive Predicates and Quantifiers', Transactions of the American Mathematical Society 53, pp. 41–73, reprinted in M. Davis (1965), The Undecidable, Ewlett, NY: Raven Press, pp. 254- 287.

    Google Scholar 

  • Kleene, S.C. (1952), Introduction to Metamathematics, Amsterdam: North-Holland.

    Google Scholar 

  • Kleene, S. C. (1987a), 'Gödel's Impression on Students of Logic in the 1930s', in P. Weingartner and L. Schmetterer, eds., Gödel Remembered, Napoli: Bibliopolis, pp. 49–64.

    Google Scholar 

  • Kleene, S.C. (1987b), 'Reflections on Church's Thesis', Notre Dame Journal of Formal Logic 28, pp. 490–498.

    Google Scholar 

  • Kleene, S.C. (1988), 'Turing's Analysis of Computability', in R. Herken, ed., The Universal Machine: A Half-Century Survey, New York: Oxford University Press, pp. 17–54.

    Google Scholar 

  • Kreisel, G. (1972), 'Which Number-Theoretic Problems Can Be Solved in Recursive Progressions on П\(_{\text{1}}^{\text{1}}\)-paths Through O', Journal of Symbolic Logic 37, pp. 311–334.

    Google Scholar 

  • Kreisel, G. (1987), 'Gödel's Excursions Into Intuitionistic Logic', in P. Weingartner and L. Schmetterer, eds., Gödel Remembered, Napoli: Bibliopolis, pp. 65–179.

    Google Scholar 

  • Leiber, J. (1991), An Invitation to Cognitive Science, Cambridge, MA: Basil Blackwell.

    Google Scholar 

  • Lucas, J.R. (1961), 'Minds, Machines and Gödel', Philosophy 36, pp. 112–127.

    Google Scholar 

  • Lucas, J.R. (1970), The Freedom of the Will, Oxford: Clarendon Press.

    Google Scholar 

  • Lucas, J.R. (1996), 'Minds, Machines, and Gödel: A Retrospect', in P.J.R. Millican and A. Clark, eds., Machines and Thought; The Legacy of Alan Turing, Oxford: Clarendon Press, pp. 103–124.

    Google Scholar 

  • Mendelson, E. (1963), 'On Some Recent Criticism of Church's Thesis', Notre Dame Journal of Formal Logic 4, pp. 201–205.

    Google Scholar 

  • Mendelson, E. (1990), 'Second Thoughts about Church's Thesis and Mathematical Proofs', Journal of Philosophy 88, pp. 225–233.

    Google Scholar 

  • Michie, D. (1982), Machine Intelligence and Related Topics; an Information Scientist's Weekend Book, New York: Gordon and Breach Science.

    Google Scholar 

  • Mundici, D. and Sieg, W. (1995), 'Paper Machines', Philosophia Mathematica 3, pp. 5–30.

    Google Scholar 

  • Newman, M.H.A. (1954), Obituary Notice for Alan Turing, The Times, 16 June.

  • Newman, M.H.A. (1955), 'Alan Mathison Turing,' in Biographical Memoirs of Fellows of the Royal Society, London: The Royal Society, pp. 253–263.

    Google Scholar 

  • Odifreddi, P. (1989), Classical Recursion Theory, Amsterdam: North-Holland.

    Google Scholar 

  • Penrose, R. (1994), Shadows of the Mind; A Search for the Missing Science of Consciousness, Oxford: Oxford University Press.

    Google Scholar 

  • Post, E. (1936), 'Finite Combinatorial Processes. Formulation I', Journal of Symbolic Logic 1, pp. 103–105, reprinted in M. Davis (1965), The Undecidable, Ewlett, NY: Raven Press, pp. 289- 291.

    Google Scholar 

  • Post, E. (1944), 'Recursively Enumerable Sets of Positive Integers and their Decision Problems', Bulletin of the American Mathematical Society 50, pp. 284–316, reprinted in M. Davis (1965), The Undecidable, Ewlett, NY: Raven Press, pp. 305- 337.

    Google Scholar 

  • Post, E. (1965), 'Absolutely Unsolvable Problems and Relatively Undecidable Propositions; Account of an Anticipation', in M. Davis (1965), The Undecidable, Ewlett, NY: Raven Press, pp. 340–433.

    Google Scholar 

  • Pratt, V. (1987), Thinking Machines; The Evolution of Artificial Intelligence, Oxford: Basil Blackwell.

    Google Scholar 

  • Proudfoot, D., and Copeland, B. J. (1994), 'Turing, Wittgenstein and the Science of the Mind', Australasian Journal of Philosophy 72, pp. 497–519.

    Google Scholar 

  • Rogers, H. (1967), Theory of Recursive Functions and Effective Computability, New York: McGraw-Hill.

    Google Scholar 

  • Shanker, S.G. (1987), 'Wittgenstein versus Turing on the Nature of Church's Thesis', Notre Dame Journal of Formal Logic 28, pp. 615–649.

    Google Scholar 

  • Shanker, S.G. (1995), 'Turing and the Origins of AI', Philosophia Mathematica 3, pp. 52–85.

    Google Scholar 

  • Sieg, W. (1994), 'Mechanical Procedures and Mathematical Experience', in A. George, ed., Mathematics and Mind, New York: Oxford University Press, pp. 71–117.

    Google Scholar 

  • Sieg, W. (1997), 'Step by Recursive Step: Church's Analysis of Effective Calculability', Bulletin of Symbolic Logic 3, pp. 154–180.

    Google Scholar 

  • Sieg, W. and Byrnes, J. (1996), 'K-graph Machines: Generalizing Turing's Machines and Arguments', in P. Hájek, ed., Gödel' 96, Berlin: Springer, pp. 98–119.

    Google Scholar 

  • Siegelmann, H. (1995), 'Computation Beyond the Turing Limit', Science 268, pp. 545–548.

    Google Scholar 

  • Tamburrini, G. (1988), Reflections on Mechanism, unpublished Ph.D. dissertation, Columbia University.

  • Turing, A.M. (1936), 2pp. Typescript of précis of Turing (1936- 1937), made for Comptes Rendues. AMT K4, Contemporary Scientific Archives Centre (CSAS), King's College Library, Cambridge.

    Google Scholar 

  • Turing, A.M. (1936- 1937), 'On Computable Numbers, with an Application to the Entscheidungs-problem', reprinted in M. Davis (1965), The Undecidable, Ewlett, NY: Raven Press, pp. 116- 154.

  • Turing, A.M. (1937) 'Computability and λ-definability' Journal of Symbolic Logic 2, pp. 153–163.

    Google Scholar 

  • Turing, A.M. (1939), 'Systems of Logic Based on Ordinals', Proceedings of the London Mathematical Society, Ser. 2 45, pp. 161–228, reprinted in M. Davis (1965), The Undecidable, Ewlett, NY: Raven Press, pp. 155- 222.

    Google Scholar 

  • Turing, A.M. (1940a), Letter to Newman, dated “early 1940?” by R. O. Gandy, AMT D/2, Contemporary Scientific Archives Centre, King's College Library, Cambridge. Printed in Copeland, forthcoming.

    Google Scholar 

  • Turing, A.M. (1940b), Letter to Newman, dated 21 April, “1940” added by R.O. Gandy, AMT D/2, Contemporary Scientific Archives Centre, King's College Library, Cambridge. Printed in Copeland, forthcoming.

    Google Scholar 

  • Turing, A.M. (1945), 'Proposal for Development in the Mathematical Division of an Automatic Computing Engine (ACE)', reprinted in D.C. Ince (1992), ed., Collected Works of A.M. Turing: Mechanical Intelligence, Amsterdam: North Holland. pp. 20- 105.

  • Turing, A.M. (1947), 'Lecture to the London Mathematical Society on 20 February 1947', reprinted in D.C. Ince (1992), ed., Collected Works of A.M. Turing: Mechanical Intelligence, Amsterdam: North Holland. pp. 87- 105.

  • Turing, A.M. (1948), 'Intelligent Machinery', reprinted in D.C. Ince (1992), ed., Collected Works of A.M. Turing: Mechanical Intelligence, Amsterdam: North Holland. pp. 87- 106.

  • Turing, A.M. (1950), 'Computing Machinery and Intelligence', in D.C. Ince (1992), ed., Collected Works of A.M. Turing: Mechanical Intelligence, Amsterdam: North Holland.

    Google Scholar 

  • Turing, A.M. (1951a), 'Intelligent Machinery, a Heretical Theory,' Lecture given to '51 Society' at Manchester (c) 1951, AMT B.4, Contemporary Scientific Archives Centre, King's College Library, Cambridge. Printed in E.S. Turing (1959), Alan M. Turing, Cambridge: Heffer & Sons, pp. 128- 134, and in B.J. Copeland (1999), 'A Lecture and Two Radio Broadcasts on Machine. Intelligence by Alan Turing', in K. Furukawa, D. Michie, and S. Muggleton, eds., Machine Intelligence 15, Oxford: Oxford University Press.

    Google Scholar 

  • Turing, A.M. (1951b), Programmers' Handbook for the Manchester Electronic Computer. University of Manchester Computing Laboratory. Also available at <http://www.AlanTuring.net/programmers_handbook>.

  • Turing, A.M. (1951c), 'Can digital computers think?' Typescript of talk broadcast in BBC Third Programme 15 May 1951, AMT B.5, Contemporary Scientific Archives Centre, King's College Library, Cambridge. Printed in B.J. Copeland (1999), 'A Lecture and Two Radio Broadcasts on Machine Intelligence by Alan Turing', in K. Furukawa, D. Michie, and S. Muggleton, eds., Machine Intelligence 15, Oxford: Oxford University Press.

    Google Scholar 

  • Turing, A.M. (1952), 'Can automatic calculating machines be said to think?' Typescript of broadcast discussion in BBC Third Programme, 14 and 23 January 1952, between M.H.A. Newman, A.M. Turing, Sir Geoffrey Jefferson, R.B. Braithwaite, AMT B.6, Contemporary Scientific Archives Centre, King's College Library, Cambridge. Printed in B.J. Copeland (1999), 'A Lecture and Two Radio Broadcasts on Machine Intelligence by Alan Turing', in K. Furukawa, D. Michie, and S. Muggleton, eds., Machine Intelligence 15, Oxford: Oxford University Press.

  • Turing, A.M. (1953), 'Digital Computers Applied to Games', in B.V. Bowden, ed., Faster Than Thought, London: Pittman, pp. 286–310, reprinted in D.C. Ince (1992), ed., Collected Works of A.M. Turing: Mechanical Intelligence, Amsterdam: North Holland, pp. 161- 185.

    Google Scholar 

  • Turing, A.M. (1954), 'Solvable and Unsolvable Problems', reprinted in D.C. Ince (1992), ed., Collected Works of A.M. Turing: Mechanical Intelligence, Amsterdam: North Holland, pp. 187- 203.

  • Turing, A.M. (undated), Letter to Ashby, NPL M11, Archives of the Science Museum Library, London. Also available at <http://www.AlanTuring.net/turing_ashby>.

  • Turing, E.S. (1959), Alan M. Turing, Cambridge: Heffer & Sons.

    Google Scholar 

  • van Heijenoort, J. ed., (1967) From Frege to Gödel, Cambridge, MA: Harvard University Press.

    Google Scholar 

  • von Neumann, J. (1931), 'The Formalist Foundations of Mathematics', Erkenntnis 2, pp. 91–121, reprinted in P. Benacerraf and H. Putnam (1964), Philosophy of Mathematics, Englewoods Cliffs, NJ: Prentice-Hall, pp. 50- 54.

    Google Scholar 

  • von Neumann, J. (1951), 'The General and Logical Theory of Automata', in A. H. Taub, ed., (1963), Collected Works; Vol V, London: Pergamon Press, pp. 288–328.

    Google Scholar 

  • Wang, H. (1974), From Mathematics to Philosophy, New York: Humanities Press.

    Google Scholar 

  • Watson, A.G.D. (1938), 'Mathematics and Its Foundations', Mind 47, pp. 440–451.

    Google Scholar 

  • Webb, J.C. (1980), Mechanism, Mentalism, and Metamathematics, Dordrecht: Reidel.

    Google Scholar 

  • Whitehead, A.N. and Russell, B. (1910- 1913), Principia Mathematica, Cambridge: Cambridge University Press.

    Google Scholar 

  • Wilkes, M.V. (1985), Memoirs of a Computer Pioneer, Cambridge, MA: MIT Press.

    Google Scholar 

  • Wittgenstein, L. (1976), Wittgenstein's Lectures on the Foundations of Mathematics Cambridge, 1939, in C. Diamond, ed., Ithaca, NY: Cornell University Press.

    Google Scholar 

  • Wittgenstein, L. (1980), Remarks on the Philosophy of Psychology, Vol. 1, G.E.M. Anscombe, and G.H. von Wright, eds., Chicago: University of Chicago Press.

    Google Scholar 

  • Wright, C. (1995), 'Intuitionists Are Not (Turing) Machines', Philosophia Mathematica 3, pp. 86–102.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of History and Philosophy of Science, University of Pittsburgh, 1017 Cathedral of Learning, Pittsburgh, PA, 15260, USA

    Gualtiero Piccinini

Authors
  1. Gualtiero Piccinini
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Piccinini, G. Alan Turing and the Mathematical Objection. Minds and Machines 13, 23–48 (2003). https://doi.org/10.1023/A:1021348629167

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021348629167

Search

Navigation