Alonzo Church
Encyclopedia : A : AL : ALO : Alonzo Church
Alonzo Church (June 14, 1903 – August 11, 1995) was an American mathematician and logician who was responsible for some of the foundations of theoretical computer science. Born in Washington, DC, he received a bachelor's degree from Princeton University in 1924, completing his Ph.D. there in 1927, under Oswald Veblen. After a postdoc at Göttingen, he taught at Princeton, 1929–1967, and at the University of California, Los Angeles, 1967–1990.
Mathematical work
Church is best known for the following accomplishments:- His proof that Peano arithmetic and first-order logic are undecidable. The latter result is known as Church's theorem.
- His articulation of what has come to be known as Church's thesis.
- He was the founding editor of the Journal of Symbolic Logic, editing its reviews section until 1979.
- His creation of the lambda calculus.
The lambda calculus influenced the design of the LISP programming language and functional programming languages in general. The Church encoding is named in his honor.
Students
Church's doctoral students were an extraordinarily accomplished lot, including C. Anthony Anderson, Martin Davis, Leon Henkin, John George Kemeny, Stephen Kleene, Michael O. Rabin, Hartley Rogers, Jr, J. Barkley Rosser, Dana Scott, Raymond Smullyan, and Alan Turing. See [link].Death
He died in 1995 and was buried in Princeton Cemetery.
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
Academic Impact
Notable teachers
Notable students
|}
See also
Books
Alonzo Church, Introduction to Mathematical Logic (ISBN 0-691-02906-7)Sources and external links
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.
