When a Language Model Refers to Itself, What Is "Itself"?
A Turing-complete Transformer inherits Kleene-style self-reference, but the self it refers to is the prompt, not the weights. Notes on what that does and does not say about …
•
13 min read
A Turing-complete Transformer inherits Kleene-style self-reference, but the self it refers to is the prompt, not the weights. Notes on what that does and does not say about …
Kleene's recursion theorem, the Y combinator, and a contraction mapping all give you x = f(x). They answer different questions, and it helps to keep them apart before talking about …