Stephen Cole Kleene - Wikipedia
Stephen Cole Kleene (/ˈkleɪni/ KLAY-nee;[a] January 5, 1909 – January 25, 1994) was an American mathematician. 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. 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. Kleene was awarded a bachelor's degree from Amherst College in 1930. He was awarded a Ph.D. in mathematics from Princeton University in 1934, where his thesis, entitled A Theory of Positive
Stephen Cole Kleene - Wikipedia Jump to content From Wikipedia, the free encyclopedia American mathematician (1909–1994) This article is about the American mathematician. For the German mathematician, creator of the Klein bottle , see Felix Klein . This article needs more citations . Please help improve this article by adding citations to reliable sources . Unsourced material may be challenged and removed . Find sources: "Stephen Cole Kleene" – news · newspapers · books · scholar · JSTOR ( September 2022 ) ( Learn how and when to remove this message ) [[Princeton University]]"},"doctoral_advis
related reading
- Claude Shannon - Wikipediaen.wikipedia.org
- Kleene's recursion theorem - Wikipediaen.wikipedia.org
- Formalizing Fermat's Last Theoremanthropic.com
- Lambda calculus - Wikipediaen.wikipedia.org
- godel-letter.pdfanilada.com
- Gödel's incompleteness theorems - Wikipediaen.wikipedia.org
- Arithmetical hierarchy - Wikipediaen.wikipedia.org
- Andrey Kolmogorov - Wikipediaen.wikipedia.org
- Will Computers Redefine the Roots of Math? | Quanta Magazinequantamagazine.org
- The Church-Turing Thesis (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Computational Complexityblog.computationalcomplexity.org
- propositions-as-types.pdfhomepages.inf.ed.ac.uk