Hilbert–Church thesis

Hilbert–Church thesis
Name	Hilbert–Church thesis
Field	Mathematical logic; Theoretical computer science
Proposed	Early 20th century
Key figures	David Hilbert; Alonzo Church; Kurt Gödel; Alan Turing; Emil Post
Influenced	Proof theory; Lambda calculus; Turing machines; Recursive function theory

Hilbert–Church thesis The Hilbert–Church thesis is an historical and methodological assertion about the formalizability of mathematical proof and effective calculability, arising from interactions among David Hilbert, Alonzo Church, Kurt Gödel, Alan Turing, and Emil Post. It connects efforts at formal proof systems pursued at the University of Göttingen and Princeton University with the formulation of effective procedures at the Institute for Advanced Study and the University of Cambridge, shaping later work at institutions such as Harvard University and Columbia University. Scholars at the University of California, Berkeley and the University of Chicago further debated its scope, while applications influenced projects at Bell Labs and laboratories of IBM.

Introduction

The thesis emerged from exchanges among David Hilbert, Alonzo Church, Kurt Gödel, Alan Turing, and Emil Post during the period of the Hilbert program and the aftermath of the Gödel incompleteness theorems. Hilbert’s emphasis on formal proof in lectures at the Königsberg area and at the University of Göttingen intersected with Church’s work on the lambda calculus and Turing’s introduction of the Turing machine at Trinity College, Cambridge; these strands converged in debates at venues including the International Congress of Mathematicians and exchanges in publications from the American Mathematical Society. The thesis influenced curricula at the University of Paris and shaped research agendas at the Royal Society where many foundational results were discussed.

Statement and formulations

The Hilbert–Church thesis is typically expressed informally as the claim that any effectively realizable method of demonstrating mathematical truths can be captured by a formal system equivalent to Church’s notion of effective calculability (via lambda calculus) or Turing’s model of computation (via Turing machine). Key formal variants include Church’s thesis as articulated in publications in journals linked to the American Journal of Mathematics and Turing’s formulation presented in papers read at the London Mathematical Society. Equivalent formal systems named in the literature include Kleene’s recursive functions developed at Princeton University and Post’s production systems from research in New York University. Subsequent formalizers invoked models such as the register machine and the μ-recursive functions studied at institutions like Brown University and Yale University.

Historical background and development

The intellectual roots trace to problems posed by David Hilbert in his lists of problems and programmatic addresses delivered at meetings hosted by the International Congress of Mathematicians; debates intensified after Kurt Gödel published the incompleteness results in journals associated with the Princeton University Press. Alonzo Church introduced lambda-definability in papers circulated at Yale University and later revisited at seminars at Harvard University, while Alan Turing formulated the machine model during his time at King’s College, Cambridge and at the National Physical Laboratory in Teddington. Cross-pollination occurred through correspondence involving figures at the Institute for Advanced Study and through conferences organized by the Royal Society and the American Philosophical Society. Work by Emil Post at Columbia University and investigations by Stephen Kleene further crystallized equivalences among the distinct formulations.

Relation to Church–Turing thesis and computability theories

The Hilbert–Church thesis is intertwined with the Church–Turing thesis as articulated by Alonzo Church and Alan Turing; both assert an identification between informal notions of effective procedure and specific formal models such as lambda calculus and Turing machine. Formal computability theories developed by Stephen Kleene, Emil Post, and researchers at Princeton University and MIT established technical theorems showing equivalences among partial recursive functions, μ-recursive functions, and models studied in seminars at Carnegie Mellon University. Debates at meetings of the Association for Symbolic Logic and publications from the American Mathematical Society treated differences in emphasis between proof-theoretic formalization championed by David Hilbert and mechanistic computation emphasized by Alan Turing.

Implications and applications

If accepted as a working principle, the thesis guided formal proof efforts in areas influenced by laboratories and departments at IBM, Bell Labs, Stanford University, and Caltech, informing automated theorem proving systems and early efforts in program verification at Carnegie Mellon University and Princeton University. It underpins theoretical limits results such as undecidability theorems disseminated at workshops sponsored by the National Science Foundation and influenced development of programming language theory at Massachusetts Institute of Technology and University of Washington. Philosophers at Oxford University and Cambridge University incorporated the thesis into discussions of mathematical realism and mechanistic accounts of reasoning presented in forums like the British Academy.

Criticisms and alternative perspectives

Critics from institutions including Ludwig Maximilian University of Munich and University of Vienna questioned whether human mathematical creativity can be exhaustively modeled by formal systems, echoing challenges raised in seminars at the Collège de France and in writings associated with the Vienna Circle. Alternative views appeared in essays circulated at the American Philosophical Association and symposia at ETH Zurich, proposing models sensitive to interactive, probabilistic, or resource-bounded reasoning considered by researchers at University of Edinburgh and École Polytechnique. Contemporary work at Google and Microsoft Research exploring machine learning and heuristics in problem solving has reopened empirical discussions about the thesis beyond the classical formal calculability frameworks elaborated by Alonzo Church and Alan Turing.

Category:Mathematical logic