Difference between revisions of "Stephen Cole Kleene"
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
[[File:Kleene.jpg|thumb|Stephen Kleene, 1978.]] |
[[File:Kleene.jpg|thumb|Stephen Kleene, 1978.]] |
||
| − | Stephen Cole Kleene ( |
+ | [[Stephen Cole Kleene]] (5 January 1909 – 25 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. |
{{Bio}} |
{{Bio}} |
||
| − | {{ |
+ | {{Featured}} |
{{Maths}} |
{{Maths}} |
||
{{STEM 365}} |
{{STEM 365}} |
||
Latest revision as of 07:07, 2 January 2025
Stephen Cole Kleene (5 January 1909 – 25 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.