Difference between revisions of "Alonzo Church" - New World Encyclopedia
Keisuke Noda (talk | contribs) (imported from wiki) |
Keisuke Noda (talk | contribs) |
||
| Line 1: | Line 1: | ||
| + | {{claimed}} | ||
{{otheruses4|the mathematician and logician|the president of the University of Georgia|Alonzo S. Church}} | {{otheruses4|the mathematician and logician|the president of the University of Georgia|Alonzo S. Church}} | ||
[[Image:Alonzo Church.jpg|thumb|250px|Alonzo Church (1903-1995)]] | [[Image:Alonzo Church.jpg|thumb|250px|Alonzo Church (1903-1995)]] | ||
| − | '''Alonzo Church''' ( | + | '''Alonzo Church''' (June 14, 1903 – August 11, 1995) was an [[United States|American]] [[mathematician]] and [[list of logicians|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 [[Doctor of Philosophy|Ph.D.]] there in 1927, under [[Oswald Veblen]]. After a [[postdoc]] at [[Georg August University of Göttingen|Göttingen]], he taught at Princeton, 1929–1967, and at the [[University of California, Los Angeles]], 1967–1990. |
==Mathematical work== | ==Mathematical work== | ||
| Line 12: | Line 13: | ||
*His creation of the [[lambda calculus]]. | *His creation of the [[lambda calculus]]. | ||
| − | The [[lambda calculus]] emerged in his famous | + | 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." This resulted in the [[Church-Turing thesis]]. |
The lambda calculus influenced the design of the [[LISP programming language|LISP]] programming language and [[functional programming]] languages in general. The [[Church encoding]] is named in his honor. | The lambda calculus influenced the design of the [[LISP programming language|LISP]] programming language and [[functional programming]] languages in general. The [[Church encoding]] is named in his honor. | ||
| Line 24: | Line 25: | ||
{{academia | {{academia | ||
|teachers=[[Oswald Veblen]] | |teachers=[[Oswald Veblen]] | ||
| − | |students=[[C. Anthony Anderson]]<br/>[[Peter Andrews]]<br/>[[George Alfred Barnard]]<br/>[[Martin Davis]]<br/>[[Leon Henkin]]<br/>[[David Kaplan (philosopher)|David Kaplan]]<br/>[[John George Kemeny]]<br/>[[Stephen Kleene]]<br/>[[John McCarthy (computer scientist)]]<br/>[[Michael O. Rabin]]<br/>[[Hartley Rogers, Jr]]<br/>[[J. Barkley Rosser]]<br/>[[Dana Scott]]<br/>[[Raymond Smullyan]]</ | + | |students=[[C. Anthony Anderson]]<br/>[[Peter Andrews]]<br/>[[George Alfred Barnard]]<br/>[[Martin Davis]]<br/>[[Leon Henkin]]<br/>[[David Kaplan (philosopher)|David Kaplan]]<br/>[[John George Kemeny]]<br/>[[Stephen Kleene]]<br/>[[John McCarthy (computer scientist)]]<br/>[[Michael O. Rabin]]<br/>[[Hartley Rogers, Jr]]<br/>[[J. Barkley Rosser]]<br/>[[Dana Scott]]<br/>[[Raymond Smullyan]]<br/>[[Alan Turing]] |
}} | }} | ||
| Line 52: | Line 53: | ||
[[Category:Princeton University faculty|Church, Alonzo]] | [[Category:Princeton University faculty|Church, Alonzo]] | ||
[[Category:University of California, Los Angeles faculty|Church, Alonzo]] | [[Category:University of California, Los Angeles faculty|Church, Alonzo]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
{{credit|82046749}} | {{credit|82046749}} | ||
Revision as of 16:36, 16 June 2007
- This article is about the mathematician and logician. For the president of the University of Georgia, see Alonzo S. 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 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." 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 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 [1].
Death
He died in 1995 and was buried in Princeton Cemetery.
| Academic Genealogy | |
|---|---|
| Notable teachers | Notable students |
| Oswald Veblen | C. Anthony Anderson Peter Andrews George Alfred Barnard Martin Davis Leon Henkin David Kaplan John George Kemeny Stephen Kleene John McCarthy (computer scientist) Michael O. Rabin Hartley Rogers, Jr J. Barkley Rosser Dana Scott Raymond Smullyan Alan Turing |
See also
- Church-Turing thesis
- Church-Turing-Deutsch principle
- Higher-order logic
Books
Alonzo Church, Introduction to Mathematical Logic (ISBN 0-691-02906-7)
Sources and external links
- John J. O'Connor and Edmund F. Robertson. Alonzo Church at the MacTutor archive
- H B Enderton, In memoriam: Alonzo Church
- Alonzo Church at the Mathematics Genealogy Project
- "Fine Hall in its golden age: Remembrances of Princeton in the early fifties" by Gian-Carlo Rota. Contains a section on Church at Princeton.
- Interview of Church about his time at Princeton
- Archived papers
Credits
New World Encyclopedia writers and editors rewrote and completed the Wikipedia article in accordance with New World Encyclopedia standards. This article abides by terms of the Creative Commons CC-by-sa 3.0 License (CC-by-sa), which may be used and disseminated with proper attribution. Credit is due under the terms of this license that can reference both the New World Encyclopedia contributors and the selfless volunteer contributors of the Wikimedia Foundation. To cite this article click here for a list of acceptable citing formats.The history of earlier contributions by wikipedians is accessible to researchers here:
The history of this article since it was imported to New World Encyclopedia:
Note: Some restrictions may apply to use of individual images which are separately licensed.
