Construct · 1 fields · 1 citations

Kleene's recursion theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Theory of computation

the result that any computable transformation of programs has a program whose behavior is unchanged by it, which lets programs refer to their own code.

In theory of computation, Kleene's recursion theorem refers to the result that any computable transformation of programs has a program whose behavior is unchanged by it, which lets programs refer to their own code. This meaning comes from Kleene (1938) in Journal of Symbolic Logic.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Kleene's recursion theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

code3 fields · 6 citationsjingle · one word, three constructs program2 fields · 2 citationsjingle · one word, two constructs recursion4 fields · 8 citationsjingle · one word, four self-referring constructs

References

Kleene, S. C. (1938). On notation for ordinal numbers. Journal of Symbolic Logic, 3(4), 150-155. https://doi.org/10.2307/2267778

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct