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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-13 Formalized: true Formalizes: title=Nonhalting and PA-independence for a 196-state Turing machine identifier= relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-13-000007 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.