The 51-state beeper $M_{51}$: every battle ends, and what Peano Arithmetic can prove about it
Source: hexagonmath.org/abs/2611.00281v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00281
curl -X POST /api/v1/records/hexagon/2611.00281/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00281/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'