Search results
Results from the WOW.Com Content Network
Stephen Cole Kleene (/ ˈ k l eɪ n i / 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 ...
The predicates can be used to obtain Kleene's normal form theorem for computable functions (Soare 1987, p. 15; Kleene 1943, p. 52—53). This states there exists a fixed primitive recursive function such that a function : is computable if and only if there is a number such that for all , …, one has
Stephen Cole Kleene, 1934 Simon B. Kochen, 1959 Maurice L'Abbé, 1951 Isaac Malitz, 1976 Gary R. Mar, 1985 Michael O. Rabin, 1957 Nicholas Rescher, 1951 Hartley Rogers, Jr, 1952 J. Barkley Rosser, 1934 Dana Scott, 1958 Norman Shapiro, 1955 Raymond Smullyan, 1959 Alan Turing, 1938 [1]
From Wikipedia, the free encyclopedia. Redirect page. Redirect to: Stephen Cole Kleene
From Wikipedia, the free encyclopedia. Redirect page
Semantical systems claiming to capture such intuitions, due to offering meaningful concepts of “constructive truth” (rather than merely validity or provability), are Kurt Gödel’s dialectica interpretation, Stephen Cole Kleene’s realizability, Yurii Medvedev’s logic of finite problems, [2] or Giorgi Japaridze’s computability logic ...
In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938 [ 1 ] and appear in his 1952 book Introduction to Metamathematics . [ 2 ]
In mathematics and theoretical computer science, a Kleene algebra (/ ˈ k l eɪ n i / KLAY-nee; named after Stephen Cole Kleene) is a semiring that generalizes the theory of regular expressions: it consists of a set supporting union (addition), concatenation (multiplication), and Kleene star operations subject to certain algebraic laws.