Stephen Cole Kleene (/ˈkleɪni/ KLAY-nee; January 5, 1909 – January 25, 1994) was an American mathematician. One of the students of Alonzo Church, Kleene... 15 KB (1,354 words) - 13:07, 21 April 2024 |
In mathematical logic and computer science, the Kleene star (or Kleene operator or Kleene closure) is a unary operation, either on sets of strings or... 7 KB (1,013 words) - 16:52, 18 July 2023 |
functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938 and appear in his 1952 book Introduction to Metamathematics... 21 KB (3,163 words) - 03:53, 19 December 2023 |
In mathematics, a Kleene algebra (/ˈkleɪni/ KLAY-nee; named after Stephen Cole Kleene) is an idempotent (and thus partially ordered) semiring endowed... 16 KB (1,914 words) - 16:10, 29 August 2023 |
"thesis")? In the course of studying the problem, Church and his student Stephen Kleene introduced the notion of λ-definable functions, and they were able to... 57 KB (6,697 words) - 14:19, 27 March 2024 |
systems of formal logic. The paradox was exhibited by Stephen Kleene and J. B. Rosser in 1935. Kleene and Rosser were able to show that both systems are... 2 KB (185 words) - 18:30, 30 January 2023 |
synonymous with this notion are becoming or constructive. For example, Stephen Kleene describes the notion of a Turing machine tape as "a linear 'tape', (potentially)... 25 KB (3,291 words) - 12:02, 25 March 2024 |
Arithmetical hierarchy (redirect from Kleene hierarchy) arithmetical hierarchy, arithmetic hierarchy or Kleene–Mostowski hierarchy (after mathematicians Stephen Cole Kleene and Andrzej Mostowski) classifies certain... 25 KB (4,582 words) - 20:13, 1 April 2024 |
Turing in 1939 in terms of oracle machines. Later in 1943 and 1952 Stephen Kleene defined an equivalent concept in terms of recursive functions. In 1944... 12 KB (1,825 words) - 11:44, 2 April 2024 |