1936
Alonzo Church
1903–1995
Computability & Lambda Calculus
Used formal computation to establish undecidability, helping define what an algorithm can and cannot do.
Church developed lambda calculus in the early 1930s. In 1936 his paper An Unsolvable Problem of Elementary Number Theory established an important undecidability result.
Together with Turing's independent work, this helped shape the modern account of effective computation. Lambda calculus also influenced functional programming languages used in AI.
Dated contributions
1936
Computability & Lambda Calculus
Alonzo Church
Used formal computation to establish undecidability, helping define what an algorithm can and cannot do.
Paper · 1936 — An Unsolvable Problem of Elementary Number Theory ↗
