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.
2016
2016
Kleene's Two Kinds of Recursion
This is an elementary expository article regarding the application of Kleene's Recursion Theorems in making definitions by… 
2014
2014
Distributed consensus-based Kalman filtering in sensor networks with quantised communications and random sensor failures
This study investigates the signal estimation problem in noisy sensor networks with quantised communications. The sensors are… 
2013
2013
Effectivity Questions for Kleene's Recursion Theorem
The present paper explores the interaction between two recursion-theoretic notions: program self-reference and learning partial… 
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… 
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
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… 
1986
1986
An analytic set-valued selection and its applications to the corona theorem, to polynomial hulls and joint spectra
It is shown that for every annulus P = {z 6 Cn : 6 < \z\ < r}, b > 0, there exists a set-valued correspondence z —> K{z): P —> 2C… 
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)