LLMs versus the Halting Problem: Characterizing Program Termination Reasoning 事件

LLMs versus the Halting Problem: Characterizing Program Termination Reasoning arXiv:2601.18987v5 Announce Type: replace Abstract: Determining whether a program terminates is a central problem in computer science. Turing's Halting Problem established termination as undecidable, showing that no algorithm can universally determine termination for all programs and inputs. Hence, verification tools approximate termination, sometimes failing to prove or disprove; these tools rely on problem specific