\(\lambda\)-definability and recursiveness
From MaRDI portal
Publication:2645327
DOI10.1215/S0012-7094-36-00227-2zbMath0014.38505WikidataQ56040844 ScholiaQ56040844MaRDI QIDQ2645327
Publication date: 1936
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Related Items
Self-quotation in a typed, intensional lambda-calculus, What is the Church-Turing Thesis?, Functional programming with combinators, The challenge of computer mathematics, Unsolvable algorithmic problems for semigroups, groups and rings, On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory, The Mathematical Work of S.C.Kleene, Formalism and intuition in computability, An RNA-based theory of natural universal computation, On quantum lambda calculi: a foundational perspective, Pre-recursive categories, Computability and Recursion, Step by Recursive Step: Church's Analysis of Effective Calculability, The Impact of the Lambda Calculus in Logic and Computer Science, Why Turing’s Thesis Is Not a Thesis, Programs as data structures in \(\lambda\)SF-calculus, Alonzo church:his life, his work and some of his miracles, Non-deterministic structures of computation, On procedures as open subroutines. II, The work of Kurt Gödel, A hypercomputational alien, Computability and λ-definability, The þ-function in λ-K-conversion, A global representation of the recursive functions in the \(\lambda\)- calculus, On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate, On notation for ordinal numbers, On a measurement-free quantum lambda calculus with classical control, Models of logical systems, What the Liar taught Achilles, The theory of recursive functions, approaching its centennial, Theoretical PearlsEnumerators of lambda terms are reducing, Theoretical Pearls:Representing ‘undefined’ in lambda calculus, On effectively computable realizations of choice functions
