Skip to search formSkip to main contentSkip to account menu

Kleene's recursion theorem

Known as: Kleene Recursion Theorem, Recursion theorem, KRT 
In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
Admissible numberingComplete numberingComputable functionDenotational semantics

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
On the convergence of adaptive gPC for non-linear random difference equations: Theoretical analysis and some practical recommendations
In this paper, the application of adaptive generalized polynomial chaos (gPC) to quantify the uncertainty for non-linear random… 
2015
2015
Analysis of network navigation with scheduling strategies
Network navigation is an emerging paradigm for enabling location-awareness in wireless networks. The limited wireless resource… 
2013
2013
Preliminary non-hardware (“soft”) cost-reduction Roadmap for residential and small commercial solar photovoltaics, 2013-2020
This paper presents results from the first effort to quantitatively roadmap reductions in non-hardware, soft costs for… 
2009
2009
Personal construct theory
The development of any discipline is related to the strength of its underpinning theoretical base. Wellestablished disciplines… 
1995
1995
STOCHASTIC DECISION-MAKING IN A FUZZY ENVIRONMENT
In this paper we consider multistage decision processes in Bellman and Zadeh's paper "Decision­ making in a fuzzy environment… 
1994
1994
A Recursion Theorem for Predicate Transformers on Inductive Data Types
1993
1993
From First to Second-Order Theory of Linear Discrete Event Systems
1988
1988
The blow-up surface for nonlinear wave equations with small spatial velocity
On considere le probleme de Cauchy pour u tt -e 2 Δu=f(u) a d dimensions d'espace≤3, ou f(u) est superlineaire et non negative… 
1987
1987
Powers of generators of holomorphic semigroups
We show that when the (possibly unbounded) linear operator -A generates a bounded holomorphic semigroup of angle 6, and n(7r/2 6… 
1973
1973
Easy constructions in complexity theory: Gap and speed-up theorems
Perhaps the two most basic phenomena discovered by the recent application of recursion theoretic methods to the developing… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)