Kleene's recursion theorem

Known as: Kleene Recursion theorem, Recursive equation 
In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1998-2017
01219982017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
This lecture will summarise core ideas in the theory of computing, including basic recursive function theory, using concepts from… (More)
Is this relevant?
2013
2013
The present paper explores the interaction between two recursion-theoretic notions: program self-reference and learning partial… (More)
Is this relevant?
2009
2009
Kleene’s Recursion Theorem, though provable in only a few lines, is fundamental to computability theory and allows strong self… (More)
Is this relevant?
2009
2009
Intuitively, a recursion theorem asserts the existence of self-referential programs . Two well-known recursion theorems are… (More)
  • figure 1
Is this relevant?
2007
2007
The interest is in characterizing insightfully the power of program self-reference in effective programming systems ( $\mathsf… (More)
Is this relevant?
2007
2007
In the paper we completely describe the set of all solutions of a recursive equation, arising from the Bethe lattice models over… (More)
Is this relevant?
2005
2005
We are concerned with theoretical aspects of computer viruses. For this, we suggest a new definition of viruses which is clearly… (More)
Is this relevant?
2005
2005
We are concerned with theoretical aspects of computer viruses. For this, we suggest a new definition of viruses which is clearly… (More)
Is this relevant?
2001
2001
Acceptable programming systems have many nice properties like s-m-n-Theorem, Composition and Kleene Recursion Theorem. Those… (More)
Is this relevant?
1998
1998
In 1] Buchholz presented a method to build notation systems for innnite sequent-style derivations, analogous to well-known… (More)
Is this relevant?