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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
This is an elementary expository article regarding the application of Kleene's Recursion Theorems in making definitions by… 
2014
2014
The focus of this study is on the attitude estimation of the four-rotor helicopter known as quadrotor. The choice of the… 
2010
2010
A multiuser switched diversity scheduling scheme with per-user feedback threshold is proposed and analyzed in this paper. The… 
2006
2006
The recursive construction of a function f : A → Θ consists, paradigmatically, of finding a functor T and maps α : A→ TA and… 
1997
1997
Three types of ternary decision diagrams (TDDs) are considered: AND-TDDs, EXOR-TDDs, and Kleene-TDDs. Kleene-TDDs are useful for… 
1995
1995
In this paper a method for the analysis of the influence input variables have on the output of a fitted model is presented. It is… 
1994
1994
This article examines the problem of concept formation in machine learning, and focuses in particular on the problem of… 
1988
1988
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
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
Perhaps the two most basic phenomena discovered by the recent application of recursion theoretic methods to the developing…