\(\lambda\)-definability and recursiveness

From MaRDI portal
Revision as of 10:42, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2645327

DOI10.1215/S0012-7094-36-00227-2zbMath0014.38505WikidataQ56040844 ScholiaQ56040844MaRDI QIDQ2645327

Stephen C. Kleene

Publication date: 1936

Published in: Duke Mathematical Journal (Search for Journal in Brave)




Related Items (33)

Self-quotation in a typed, intensional lambda-calculusWhat is the Church-Turing Thesis?Functional programming with combinatorsThe challenge of computer mathematicsUnsolvable algorithmic problems for semigroups, groups and ringsOn Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theoryThe Mathematical Work of S.C.KleeneFormalism and intuition in computabilityAn RNA-based theory of natural universal computationOn quantum lambda calculi: a foundational perspectivePre-recursive categoriesComputability and RecursionStep by Recursive Step: Church's Analysis of Effective CalculabilityThe Impact of the Lambda Calculus in Logic and Computer ScienceWhy Turing’s Thesis Is Not a ThesisPrograms as data structures in \(\lambda\)SF-calculusAlonzo church:his life, his work and some of his miraclesNon-deterministic structures of computationOn procedures as open subroutines. IIThe work of Kurt GödelA hypercomputational alienComputability and λ-definabilityThe þ-function in λ-K-conversionA global representation of the recursive functions in the \(\lambda\)- calculusOn the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicateOn notation for ordinal numbersOn a measurement-free quantum lambda calculus with classical controlModels of logical systemsWhat the Liar taught AchillesThe theory of recursive functions, approaching its centennialTheoretical PearlsEnumerators of lambda terms are reducingTheoretical Pearls:Representing ‘undefined’ in lambda calculusOn effectively computable realizations of choice functions







This page was built for publication: \(\lambda\)-definability and recursiveness