Alonzo Church | |
---|---|
Born | Washington, D.C., U.S. | June 14, 1903
Died | August 11, 1995 Hudson, Ohio, U.S. | (aged 92)
Alma mater | Princeton University (BS, PhD) |
Known for | Lambda calculus Simply typed lambda calculus Church encoding Church's theorem Church–Kleene ordinal Church–Turing thesis Frege–Church ontology Church–Rosser theorem Intensional logic |
Scientific career | |
Fields | computer science, mathematics, logic |
Institutions | Princeton University (1929–67) UCLA (1967–95) |
Thesis | Alternatives to Zermelo's Assumption (1927) |
Doctoral advisor | Oswald Veblen |
Doctoral students | C. Anthony Anderson, 1977 Peter Andrews, 1964 George Alfred Barnard, 1936 William W. Boone, 1952 Martin Davis, 1950 William Easton, 1964 Alfred Foster, 1930 Leon Henkin, 1947 John George Kemeny, 1949 Stephen Cole Kleene, 1934 Simon B. Kochen, 1959 Maurice L'Abbé, 1951 Isaac Malitz, 1976 Gary R. Mar, 1985 Michael O. Rabin, 1957 Nicholas Rescher, 1951 Hartley Rogers, Jr, 1952 J. Barkley Rosser, 1934 Dana Scott, 1958 Norman Shapiro, 1955 Raymond Smullyan, 1959 Alan Turing, 1938[1] |
Alonzo Church (June 14, 1903 – August 11, 1995) was an American computer scientist, mathematician, logician, and philosopher who made major contributions to mathematical logic and the foundations of theoretical computer science.[2] He is best known for the lambda calculus, the Church–Turing thesis, proving the unsolvability of the Entscheidungsproblem ("decision problem"), the Frege–Church ontology, and the Church–Rosser theorem. Alongside his doctoral student Alan Turing, Church is considered one of the founders of computer science.[3][4]