Alonzo Church

From Example Problems
Jump to navigation Jump to search

Alonzo Church (June 14, 1903August 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-67, and at the University of California, Los Angeles, 1967-90.

Church is best known for the following accomplishments:

The lambda calculus emerged in his famous 1936 paper showing the existence of an "undecidable problem". This result preempted Alan Turing's famous work on the halting problem which also demonstrated the existence of a problem unsolvable by mechanical means. He and Turing then showed that the lambda calculus and the Turing machine used in Turing's halting problem were equivalent in capabilities, and subsequently demonstrated a variety of alternative "mechanical processes for computation" had equivalent computational abilities. This resulted in the Church-Turing thesis.

The lambda calculus influenced the design of the LISP programming language and functional programming languages in general. The Church boolean is named in his honor.

Church's doctoral students were an extraordinarily accomplished lot, including Stephen Kleene, J. Barkley Rosser, Alan Turing, Leon Henkin, John George Kemeny, Martin Davis, Michael O. Rabin, Dana Scott, Raymond Smullyan, and Hartley Rogers, Jr. See [1].

See also


Alonzo Church, Introduction to Mathematical Logic (ISBN 0-691-02906-7)

Sources and external links

bn:আলোন্‌জো চার্চ cs:Alonzo Church de:Alonzo Church es:Alonzo Church eo:Alonzo CHURCH fr:Alonzo Church it:Alonzo Church ja:アロンゾ・チャーチ ko:알론조_처치 he:אלונזו צ'רץ' nl:Alonzo Church pl:Alonzo Church pt:Alonzo Church ru:Чёрч, Алонзо sk:Alonzo Church sl:Alonzo Church uk:Чорч Алонзо zh:阿隆佐·邱奇