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 ...
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.
Regular expressions originated in 1951, when mathematician Stephen Cole Kleene described regular languages using his mathematical notation called regular events. [ 6 ] [ 7 ] These arose in theoretical computer science , in the subfields of automata theory (models of computation) and the description and classification of formal languages ...
In computability theory, the T predicate, first studied by mathematician Stephen Cole Kleene, is a particular set of triples of natural numbers that is used to represent computable functions within formal theories of arithmetic.
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]
Her killer, Stephen Cole, 32, was suffering from a psychotic episode and is now detained in hospital indefinitely. ... The inquest heard Mr Cole was discharged from prison with a supply of ...
However, Stephen Cole was not deemed to be an "exceptional" risk to the public, the hearing was told. Marta Elena Vento, 27, was punched, kicked and attacked with hair clippers for 42 minutes ...
Numerous results in recursion theory were obtained in the 1940s by Stephen Cole Kleene and Emil Leon Post. Kleene [36] introduced the concepts of relative computability, foreshadowed by Turing, [37] and the arithmetical hierarchy. Kleene later generalized recursion theory to higher-order functionals.