Search results
Alonzo Church (June 14, 1903 – August 11, 1995) was an American mathematician, computer scientist, 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 ...
Oct 21, 2021 · Alonzo Church (1903–1995) was a renowned mathematical logician, philosophical logician, philosopher, teacher and editor. He was one of the founders of the discipline of mathematical logic as it developed after Cantor, Frege and Russell.
Jun 10, 2024 · Alonzo Church (born June 14, 1903, Washington, D.C., U.S.—died Aug. 11, 1995, Hudson, Ohio) was a U.S. mathematician. He earned a Ph.D. from Princeton University. His contributions to number theory and the theories of algorithms and computability laid the foundations of computer science.
- The Editors of Encyclopaedia Britannica
Sep 5, 1995 · Alonzo Church, an eminent contributor to mathematical logic and teacher of a generation of American logicians, died in Hudson, Ohio, on Aug. 11. He was 92.
Aug 11, 1995 · His work is of major importance in mathematical logic, recursion theory, and in theoretical computer science. Early contributions included the papers On irredundant sets of postulates (1925), On the form of differential equations of a system of paths (1926), and Alternatives to Zermelo's assumption (1927).
Church, Alonzo (b. 14 June 1903 in Washington, D.C.; d. 11 August 1995 in Hudson, Ohio), mathematician, logician, philosopher of mathematics, and computer scientist best known for three contributions to mathematical logic: Church’s thesis, Church’s theorem, and the lambda calculus.
People also ask
How did Alonzo Church contribute to computer science?
Who is Alonzo Church?
Who were Alonzo Church parents?
Where can I find a book about Alonzo Church?
Alonzo Church. 1903-1995. American Mathematician. Like his more famous pupil Alan Turing (1912-1954), Alonzo Church contributed significantly to the foundations of computer science. He is credited, along with Turing, with formulating a key principle concerning computer logic involving recursion, or the recurring repetition of a given operation.
