Pages that link to "Item:Q2645327"

The following pages link to \(\lambda\)-definability and recursiveness (Q2645327):

Displaying 40 items.

• On effectively computable realizations of choice functions (Q1072545) (← links)
• Functional programming with combinators (Q1098628) (← links)
• Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
• On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
• Pre-recursive categories (Q1164127) (← links)
• On procedures as open subroutines. II (Q1216944) (← links)
• A global representation of the recursive functions in the \(\lambda\)- calculus (Q1245931) (← links)
• What the Liar taught Achilles (Q1283319) (← links)
• Lambda terms definable as combinators (Q1349878) (← links)
• Programs as data structures in \(\lambda\)SF-calculus (Q1744389) (← links)
• The definability of \(\mathbb{E}\) in self-iterable mice (Q2105098) (← links)
• Self-quotation in a typed, intensional lambda-calculus (Q2130593) (← links)
• A hypercomputational alien (Q2497874) (← links)
• An RNA-based theory of natural universal computation (Q2670144) (← links)
• Formalism and intuition in computability (Q2941588) (← links)
• On quantum lambda calculi: a foundational perspective (Q2973238) (← links)
• λ-definable functionals andβη conversion (Q3322071) (← links)
• On a measurement-free quantum lambda calculus with classical control (Q3625676) (← links)
• The theory of recursive functions, approaching its centennial (Q3946156) (← links)
• The work of Kurt Gödel (Q4140948) (← links)
• Step by Recursive Step: Church's Analysis of Effective Calculability (Q4359525) (← links)
• The Impact of the Lambda Calculus in Logic and Computer Science (Q4359526) (← links)
• Alonzo church:his life, his work and some of his miracles (Q4391354) (← links)
• (Q4428885) (← links)
• Why Turing’s Thesis Is Not a Thesis (Q4637226) (← links)
• (Q4681365) (← links)
• <i>Theoretical Pearls</i>Enumerators of lambda terms are reducing (Q4763984) (← links)
• Theoretical Pearls:<i>Representing ‘undefined’ in lambda calculus</i> (Q4764617) (← links)
• The Mathematical Work of S.C.Kleene (Q4837673) (← links)
• What is the Church-Turing Thesis? (Q5055286) (← links)
• (Q5219128) (← links)
• The challenge of computer mathematics (Q5301849) (← links)
• (Q5369483) (← links)
• Computability and Recursion (Q5689263) (← links)
• Non-deterministic structures of computation (Q5740658) (← links)
• Computability and λ-definability (Q5768087) (← links)
• The þ-function in λ-<i>K</i>-conversion (Q5768088) (← links)
• On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate (Q5772181) (← links)
• On notation for ordinal numbers (Q5772803) (← links)
• Models of logical systems (Q5792477) (← links)