-definability and recursiveness

Cited in

(40)

On effectively computable realizations of choice functions
Functional programming with combinators
Unsolvable algorithmic problems for semigroups, groups and rings
On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
Pre-recursive categories
On procedures as open subroutines. II
A global representation of the recursive functions in the \(\lambda\)- calculus
What the Liar taught Achilles
Lambda terms definable as combinators
Programs as data structures in \(\lambda\)SF-calculus
The definability of \(\mathbb{E}\) in self-iterable mice
Self-quotation in a typed, intensional lambda-calculus
A hypercomputational alien
An RNA-based theory of natural universal computation
Formalism and intuition in computability
On quantum lambda calculi: a foundational perspective
λ-definable functionals andβη conversion
On a measurement-free quantum lambda calculus with classical control
The theory of recursive functions, approaching its centennial
The work of Kurt Gödel
Step by Recursive Step: Church's Analysis of Effective Calculability
The Impact of the Lambda Calculus in Logic and Computer Science
Alonzo church:his life, his work and some of his miracles
scientific article; zbMATH DE number 1984520 (Why is no real title available?)
Why Turing’s Thesis Is Not a Thesis
scientific article; zbMATH DE number 2182490 (Why is no real title available?)
Theoretical PearlsEnumerators of lambda terms are reducing
Theoretical Pearls:Representing ‘undefined’ in lambda calculus
The Mathematical Work of S.C.Kleene
What is the Church-Turing Thesis?
scientific article; zbMATH DE number 7178020 (Why is no real title available?)
The challenge of computer mathematics
scientific article; zbMATH DE number 6792351 (Why is no real title available?)
Computability and Recursion
Non-deterministic structures of computation
Computability and λ-definability
The þ-function in λ-K-conversion
On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate
On notation for ordinal numbers
Models of logical systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2645327)