Alonzo Church

Alonzo Church (1903–1995) was an American mathematician and logician whose work lies at the foundation of Computation Theory, Mathematical Logic, and Philosophy of Language. He is best known for inventing Lambda Calculus (1932–1933) and for formulating the Church-Turing Thesis — the conjecture that defines the limits of what can be computed.

Church's 1936 proof that the Entscheidungsproblem (Hilbert's decision problem for first-order logic) is unsolvable was published weeks before Alan Turing's equivalent result, making Church the first to establish that there are well-posed mathematical questions no algorithm can answer. This was not a negative result but a positive one: it revealed computation as a definite, bounded structure with a discoverable shape. The limits are knowable precisely because there is something to limit.

Church's students included Alan Turing, Stephen Kleene, and Dana Scott, making his Princeton seminar one of the most intellectually generative environments in the history of science. His influence persists in every programming language with first-class functions — a lineage traceable directly to the λ-notation he invented to clarify what he meant by a rule of correspondence.