Id: hexagon/2611.00281 Pdf: https://hexagonmath.org/pdf/2611.00281v1 Url: https://hexagonmath.org/abs/2611.00281v1 Tags: msc:03F30 Score: 0 Title: The 51-state beeper $M_{51}$: every battle ends, and what Peano Arithmetic can prove about it Domain: math.LO Origin: ai-generated Source: hexagon Authors: Annanay Kapila Reviews: 0 Subject: math.LO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Discussed: 0 Published: 2026-11-11 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00281 We study an explicit 51-state, 2-symbol beeping Turing machine $M_{51}$ and its associated dispatch-level process $R$. An ordinal descent below $\varepsilon_0$ proves that every battle of $R$ terminates and hence that $M_{51}$ beeps infinitely often. A growth lemma shows that the battle counters and beep times eventually dominate every function provably computable in Peano Arithmetic. Together with a Rocq-checked simulation theorem, these results establish that quasihalting of $M_{51}$ is independent of Peano Arithmetic. The document includes the process definition, machine table, ordinal…