01
GÖDEL NEVER PUT A CHATBOT ON TRIAL
The incompleteness theorem concerns what certain consistent formal systems can prove. It does not say an AI must invent case citations, fake biographies or wrong dates a fixed percentage of the time. Extending that theorem to chatbot behavior takes extra assumptions.
02
TWO PAPERS SAY 'INEVITABLE.' THEY DON'T SAY THE SAME THING.
Xu, Jain and Kankanhalli prove limitations in a formal setting where models face computable ground-truth functions as general solvers. Banerjee, Agarwal and Singla argue from Gödel and undecidability that errors run through the language-model pipeline. These are published research claims with specific assumptions, not measurements of a floor on everyday hallucination rates.
03
THE EXAM REWARDS A CONFIDENT GUESS
OpenAI researchers argued in 2025 that many evaluations award points for a correct guess and none for admitting uncertainty. If a model doesn't know, guessing can improve its score while making the answer less trustworthy. A grading rule can create hallucinations without any appeal to Gödel.
04
'I DON'T KNOW' IS AN ENGINEERING FEATURE
An ACL 2025 paper tested selective abstention training across question-answering datasets and reported fewer hallucinations from the knowledge-misalignment problem it studied. Refusing an uncertain question is not a proof of truthfulness, but it changes the practical error tradeoff.
05
THE NUMBER THAT MATTERS IS MISSING FROM THE THEOREM
A universal impossibility result does not tell a user whether a system gets one in ten, one in ten thousand, or none of the questions wrong in a particular tested workflow. That requires measurements that count incorrect answers, correct answers and refusals separately.