Stephen Cole Kleene was an American mathematician and logician, born on 5 January 1909 and died on 25 January 1994. A student of Alonzo Church, he is best known as a founder, with Rozsa Peter, Alan Turing, Emil Post and others, of the branch of mathematical logic known as recursion theory, which helped provide the foundations of theoretical computer science. A number of concepts are named after him, including the Kleene hierarchy, Kleene algebra, the Kleene star, Kleene's recursion theorem and the Kleene fixed-point theorem. He also invented regular expressions in 1951.
Facts
Connections
In Branch
Source Stephen Cole Kleene (Wikipedia)
Source Stephen Cole Kleene (Wikipedia)
Proofs Credited
Source Kleene's Recursion Theorem (Wikipedia)
Source Wikipedia: Smn theorem
In the Other Atlases
Sources
1. Stephen Cole Kleene (Wikipedia)
Lead paragraph
He also invented regular expressions in 1951 to describe McCull
Lead paragraph [nationality-culture]
was an American mathematician
In Branch: Computability Theory, Lead paragraph [in-branch]
recursion theory
In Branch: Logic and Foundations, Lead paragraph [in-branch 2]
mathematical logic
View the SourceKleene's Recursion Theorem (Wikipedia)
Wikimedia FoundationProofs Credited: Kleene's Recursion Theorem, Lead paragraphQuote, Proofs Credited: Kleene's Recursion Theorem, Lead paragraph
In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions.
Wikipedia: Smn theorem
WikipediaProofs Credited: S-m-n Theorem, Lead paragraphQuote, Proofs Credited: S-m-n Theorem, Lead paragraph
of the partial computable functions) (Soare 1987, Rogers 1967). It was first proved by Stephen Cole Kleene (1943). The name
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.