Nonhalting and PA-independence for a 196-state Turing machine
Source: github.com/jamesyc/BusyBeaver/tree/407cdc356f6b586635e71ac9…
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-13-000007
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-13-000007/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-13-000007/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'