enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Stephen Cole Kleene - Wikipedia

    en.wikipedia.org/wiki/Stephen_Cole_Kleene

    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 ...

  3. Alonzo Church - Wikipedia

    en.wikipedia.org/wiki/Alonzo_Church

    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]

  4. Deaths in January 1994 - Wikipedia

    en.wikipedia.org/wiki/Deaths_in_January_1994

    The following is a list of notable deaths in January 1994.. Entries for each day are listed alphabetically by surname. A typical entry lists information in the following sequence:

  5. Regular expression - Wikipedia

    en.wikipedia.org/wiki/Regular_expression

    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 ...

  6. Portal : History of science/Selected anniversaries/January

    en.wikipedia.org/wiki/Portal:History_of_science/...

    1994 - Death of Stephen Cole Kleene, American mathematician (b. 1909) 2006 - Three independent observing campaigns announce the discovery of OGLE-2005-BLG-390Lb through gravitational microlensing , the first cool rocky/icy extrasolar planet around a main-sequence star

  7. S. C. Kleene - Wikipedia

    en.wikipedia.org/?title=S._C._Kleene&redirect=no

    From Wikipedia, the free encyclopedia. Redirect page

  8. Kleene's T predicate - Wikipedia

    en.wikipedia.org/wiki/Kleene's_T_predicate

    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

  9. Stephen Kleene - Wikipedia

    en.wikipedia.org/?title=Stephen_Kleene&redirect=no

    From Wikipedia, the free encyclopedia. ... Stephen Cole Kleene; This page is a redirect. The following categories are used to track and monitor this redirect: