Kleene's second recursion theorem

Layer 0 — Mathematicsin the formal-systems-limits subtree

Every total computable f: ℕ → ℕ has an index e such that φ_e and φ_{f(e)} compute the same partial function. Proof by s_m_n plus diagonal. Corollary: quines exist — programs that output their own source code.

Related concepts

Explore Kleene's second recursion theorem on the interactive knowledge graph →