{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-11","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"some"}