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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

The present paper explores the interaction between two recursion-theoretic notions: program self-reference and learning partial…

2013

This paper presents results from the first effort to quantitatively roadmap reductions in non-hardware, soft costs for…

1997

In a recent paper an author has suggested a series of dimensions which include as first terms dimension of a vector space…

Highly Cited

1995

Highly Cited

1995

We address the two-pole simulation of interconnect trees via the moment matching technique. We simulate the interconnect network…

1994

1993

1987

We show that when the (possibly unbounded) linear operator -A generates a bounded holomorphic semigroup of angle 6, and n(7r/2 6…

1986

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…

1980

1973

Perhaps the two most basic phenomena discovered by the recent application of recursion theoretic methods to the developing…