Stephen Cole Kleene
American mathematician (1909–1994)
Stephen Cole Kleene ( KLAY-nee; January 5, 1909 – January 25, 1994) was an American mathematician and logician. One of the students of Alonzo Church, Kleene, along with Rózsa Péter, Alan Turing, Emil Post, and others, is best known as a founder of the branch of mathematical logic known as recursion theory, which subsequently helped to provide the foundations of theoretical computer science.2
From Wikipedia’s article on Stephen Cole Kleene (this version), CC BY-SA 4.0.
Born Jan 5, 1909, died Jan 25, 1994.1
About
Kleene's work grounds the study of computable functions. A number of mathematical concepts are named after him: Kleene hierarchy, Kleene algebra, the Kleene star (Kleene closure), Kleene's recursion theorem and the Kleene fixed-point theorem. He also invented regular expressions in 1951 to describe McCulloch-Pitts neural networks, and made significant contributions to the foundations of mathematical intuitionism.
From Wikipedia’s article on Stephen Cole Kleene, shared under CC BY-SA 4.0.2
Companies
- Association for Symbolic LogicChair 1956 to 195813
Early life and education
Career
Occupation: logician, university teacher, philosopher, computer scientist, mathematician.6
- 1956 to 1958Chair, Association for Symbolic Logic5
- 1946 to 1979Worked at University of Wisconsin–Madison4
- 1942 to 1946Worked at United States Navy4
- 1941 to 1942Worked at Amherst College4
- 1935 to 1941Worked at University of Wisconsin–Madison4
- 1934 to 1935Worked at Princeton University4
Known for: Kleene star, Kleene's theorem, Kleene–Brouwer order, Kleene's algorithm, The foundations of intuitionistic mathematics, Kleene's T predicate, Church–Kleene ordinal, Kleene algebra, Kleene's recursion theorem, lambda calculus.7
Personal life
Awards
Links
Sources
The numbers on this page point here. Each one links to the record it came from.
- 1WikidataStephen Cole Kleene on Wikidata
- 2WikipediaStephen Cole Kleene on Wikipedia
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14