Peter O'Hearn
@peterohearn.bsky.social
Researcher at Meta (FAIR) & Prof at UCL.
Working on AI, code and reasoning.
Separation logic, Incorrectness logic, Infer. Gödel Prize. Royal Society.
Working on AI, code and reasoning.
Separation logic, Incorrectness logic, Infer. Gödel Prize. Royal Society.
LLMs vs the Halting Problem. Why not try LLMs on the first code reasoning task: halting. Turing's undecidability proof showed basic limits. Fun bit: no matter how superintelligent AI becomes, it can never solve this. 1/5
arxiv.org/abs/2601.18987 #AcademicSky #FormalMethods #AIReasoning
arxiv.org/abs/2601.18987 #AcademicSky #FormalMethods #AIReasoning
February 2, 2026 at 1:54 PM
LLMs vs the Halting Problem. Why not try LLMs on the first code reasoning task: halting. Turing's undecidability proof showed basic limits. Fun bit: no matter how superintelligent AI becomes, it can never solve this. 1/5
arxiv.org/abs/2601.18987 #AcademicSky #FormalMethods #AIReasoning
arxiv.org/abs/2601.18987 #AcademicSky #FormalMethods #AIReasoning