In 1951, Kurt Gödel stood at a podium at Brown University to deliver the Einstein Award lecture and made a claim that went considerably beyond mathematics. Drawing on his own Incompleteness Theorems, he argued that the human mind could perceive mathematical truths that no mechanical procedure could ever capture, and that this fact had profound consequences for how we understood the relationship between human consciousness and the formal systems we build to represent it. It was a characteristically Gödelian move: beginning with a technical result of irrefutable logical precision and following it, with perfect seriousness, into philosophical territory that most of his colleagues found either thrilling or alarming, depending on their temperament. Gödel himself was entirely untroubled by the implications. He was a committed Platonist who believed that mathematical objects existed independently of human minds, that intuition was a genuine cognitive faculty capable of perceiving them, and that any account of the mind that reduced it to a machine was not merely incomplete but demonstrably false. He had, after all, the proof.
Kurt Gödel (1906–1978) is one of those rare thinkers whose single greatest achievement is both perfectly precise and endlessly generative. His Incompleteness Theorems, published in 1931 when he was just 25 years old, demonstrated with airtight logical rigor that any formal system powerful enough to express basic arithmetic must contain true statements it cannot prove, and that no such system can establish its own consistency from within. The target was Hilbert's program, the grandest ambition in the history of mathematics: to place the entire discipline on unassailable formal foundations. Gödel did not merely set that program back. He ended it permanently, showing that the dream of a complete and self-certifying mathematical system was not a practical difficulty but a logical impossibility. It was one of the most consequential negative results in the history of human thought, and its implications have been reverberating across mathematics, philosophy, and cognitive science ever since.
The most contested of those implications concerns the nature of mind itself. If formal systems are inherently incomplete, and if human mathematicians can recognize truths that lie beyond any given system's reach, does that mean human thought is something fundamentally different from, and irreducible to, any mechanical or computational process? It is a question with stakes far beyond the philosophy of mathematics, touching everything we believe about consciousness, free will, and the ultimate limits of artificial intelligence. It is also a question that admits of no easy answer, which is precisely why it has generated some of the most heated and most productive philosophical arguments of the past seventy years, drawing in mathematicians, philosophers, cognitive scientists, and computer theorists who frequently talk past each other with great conviction.
No philosopher has pursued those implications with more sustained rigor or more willingness to follow the argument wherever it leads than John Randolph Lucas, emeritus Fellow of Merton College, Oxford, and Fellow of the British Academy, whose landmark 1961 paper "Minds, Machines and Gödel" opened one of the defining debates in the philosophy of mind by arguing, with direct appeal to Gödel's results, that no automaton could fully represent a human mathematician. In a wide-ranging career that has encompassed the philosophy of mathematics, the philosophy of mind, free will and determinism, and the philosophy of science, Lucas has remained one of the most intellectually courageous voices in contemporary philosophy, committed to taking Gödel's theorems seriously in all their consequences rather than confining them safely within the boundaries of mathematical logic. In this interview, he reflects on what Gödel proved, what it means for our understanding of mind and machine, and why a result arrived at nearly a century ago continues to generate arguments we are nowhere near finishing.
Charles Carlini: When did you first become acquainted with Kurt Gödel and his Incompleteness Theorems? And what was it about his work that impressed you?
John Lucas: I first heard of a strange piece of work that coded things using prime numbers in June 1948, while talking to a tutor about switching from Mathematics to "Greats" (Philosophy and Ancient History). I was probably trying to explain a thought that had come to me earlier at school, when I had been listening to an essay by one of my contemporaries, who was putting forward an extremely materialistic world-view. I countered that if such a view was true, there was no room for truth or rational conviction: he could not hope to persuade me that it was true; if I came to believe it, it would only be because he had successfully manipulated my nervous system, not because it was true, and I had been rationally convinced by his arguments.
While I was reading philosophy as an undergraduate, I made considerable use of this type of argument to refute the Verification Principle, Marxism, and Freudianism. But I found it very difficult to formulate it in a watertight way. There were great difficulties in securing self-reference. Russell’s Theory of Types stood in the way of most of my efforts. Gödel, however, had managed to circumvent the difficulties. So when my Junior Research Fellowship at Merton was coming to an end, I decided to go to Princeton, and really master it.
CC: How would you explain Gödel’s Theorems to a layman?
JL: I tried my best in a talk I gave to undergraduates in King’s College, London, which I put on the web as "A Simple Exposition of Gödel’s Theorem."
CC: You’re best known for your paper "Minds, Machines and Gödel," which was published in 1961 in the journal Philosophy. In it, you argue, with the help of Gödel’s proof, that a mechanist or computationalist view of the mind is untenable. Can you briefly explain the gist of your argument?
JL: It is a version of the Turing test, a dialogue between a mind and a purported mechanist representation of it. The principles on which the mechanist representation works are subject to Gödel’s Theorem, and so there is a Gödelian sentence that is true, but cannot be proved to be true by the machine from the principles on which it was constructed. The mind, however, informed of the principles on which the machine was constructed, can work out that this is its Gödelian sentence, and see that it is true. Thus, there is something the mind can do, and the machine cannot do, and so the machine is not an adequate representation of the mind.
CC: How did you come to apply a purely mathematical proof like Gödel’s theorem to the problem of minds and machines?
JL: Because I needed my argument to be incontrovertible. Many others had thought of the argument that the materialist is somehow cutting off the branch on which he is sitting when he argues for materialism (I list some of them in an appendix in my book, The Freedom of the Will, Oxford, 1970); but their arguments, though cogent, could not get a grip on a hard-nosed skeptic. I needed to start from where the skeptic stood, and use arguments he could not deny on pain of self-contradiction. Gödel’s Theorem enabled me to do it.
CC: "Minds, Machines and Gödel" was attacked on many fronts over the ensuing years by various critics, many of whom weren’t in accord with where your argument supposedly failed, if at all. How has your argument held up since it was first presented?
JL: I am not the best judge, being partial to my own case. It seems to me that the Artificial Intelligence people have largely conceded that a Turing machine cannot be an adequate representation of the mind, but claim that this is a narrow victory, because they are dreaming up artificial intelligences that are not Turing machines.
CC: In Gödel, Escher, Bach, Richard Hofstadter cites your paper as one of the driving forces behind many of the ideas developed in his book. However, from the path you paved, he diverges. Can you briefly explain his view?
JL: I find it difficult. He seems to be giving my sort of argument, but then draws back from the conclusion to which he was tending. I suspect he has not fully understood the import of the Church-Kleene theorem and thinks that because there is no algorithm for naming transfinite numbers, a mind would be stumped to name one. But a mind is not confined to algorithmic procedures.
CC: Did you ever consider using Turing’s argument instead of Gödel’s in developing your views in "Minds, Machines and Gödel"?
JL: Yes, but only to reject it. The great virtue of Gödel’s theorem (and Tarski’s) is that it invokes the concept of truth, which was crucial in my original schoolboy thoughts and is prominent in mental activities.
CC: In more recent times, mathematician Roger Penrose has taken up the same problem you covered in your original paper in his book The Emperor’s New Mind and, more recently, "Shadows of the Mind." Are you familiar with his version? If so, how does his differ from yours?
JL: Yes. I reviewed The Emperor’s New Mind in the Oxford Magazine. I discuss Penrose’s version in "Turn Over the Page" as well as Gödel’s. (I was quite unaware that Gödel had had similar thoughts when I was developing my argument. I wish I had been able to discuss them with him when I was in Princeton in 1957-8.)
CC: Since Gödel first presented his Incompleteness Theorems over 75 years ago, the mathematical community has proceeded unabated as if his findings were never announced. Why?
JL: Not so.
1. Hilbert’s program was abandoned.
2. Robinson was able to use non-standard numbers (whose existence is a corollary of Gödel’s theorem) to re-establish infinitesimals as respectable members of the mathematical ontology.
3. Mathematical logic is now a vigorous part of mathematics.
CC: What other philosophical lessons may we draw from Gödel’s work?
JL: It vindicates a widespread belief in the creative power of reason. Aristotle distinguishes reason generally, meta logou, from algorithmic reason, reason in accordance with the correct rule, kata ton orthon logon. But the distinction is difficult to draw and has been denied by many, who assume that for something to be reasonable, it must be in accordance with some rule. Gödel shows that, however many rules of inference we formulate, there will still be some valid inferences not covered by them. I see this as supporting a philosophy of "more-than-ism" rather than the "nothing-but-ery" of the reductionists.



0 comments