Tag
This article presents a Tarski-inspired diagonal argument showing that no linear probe on an LLM's embedding space can reliably detect truth, drawing parallels to Gödel's incompleteness and Turing's halting problem. It critiques the linear representation hypothesis for truth in language models.