{"id":"palomar/PALOMAR-2026-11-13-000007","url":"https://github.com/jamesyc/BusyBeaver/tree/407cdc356f6b586635e71ac92be394255f4bfea4","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-13-000007-v1.json","repo":"https://github.com/jamesyc/BusyBeaver","tags":["math.LO","cs.LO","msc:03F30","msc:03D10"],"score":0,"title":"Nonhalting and PA-independence for a 196-state Turing machine","trust":"high","domain":"math.LO","source":"palomar","authors":["James Chang"],"reviews":0,"subject":"math.LO","summary":"An explicit binary Turing machine with 196 working states searches for a contradiction in ordinary first-order Peano arithmetic. Lean proves blank-tape nonhalting and that PA proves neither the exact arithmetic halting sentence nor its negation. A refutation compiler connects the PA proof predicate to the literal 392-row table. The axiom command uses a transposed quantifier code and a guarded equality-vacuity clause.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-13","reactions":{},"formalized":true,"formalizes":[{"title":"Nonhalting and PA-independence for a 196-state Turing machine","identifier":"","relationship":"formalizes"}]}