Alonzo Church
Church’s formal account of effective computation, developed alongside the work of his student Alan Turing, is a core foundation for understanding what computation can and cannot do—including the limits relevant to cryptography and security analysis.
American mathematician and logician whose work on computability established enduring foundations for computer science and the formal analysis of algorithms.
Historical contribution
Church’s formal account of effective computation, developed alongside the work of his student Alan Turing, is a core foundation for understanding what computation can and cannot do—including the limits relevant to cryptography and security analysis.
In memoriam
Alonzo Church died in 1995. This archive remembers their contribution with care and credits the historical record on which this account relies.
Timeline
- 1903-06-14Born in Washington, D.C.
- 1932Develops the lambda calculus.
- 1936Publishes An Unsolvable Problem of Elementary Number Theory.
- 1937Alan Turing completes doctoral work under Church at Princeton.
- 1995-08-11Dies in Hudson, Ohio.
Alonzo Church
- Type
- Person
- Era
- 1930s-1995
- Born
- 1903
- Died
- 1995
- Known for
- Lambda calculus; Church–Turing thesis; Foundations of computability
- Tags
- logic, computability, cryptography, academic-research
Created by Joas A Santos · Something wrong or want it removed? Open an issue.