⬢github Rocq Prover · 6 ★ +5 since we first saw it · pushed 35 min ago
jeff87654/busy-beaver
Busy beaver work: an 8-state machine running the BB(7) champion's program with 36 digits (sigma = 12*(2^^37 3)+59, machine-checked in busycoq), analysis in Ligocki's notation
A collection of tiny Turing machines (8, 9, and 10 states) that halt after unimaginably many steps, breaking busy-beaver records. The repo provides detailed analyses of each machine's run in Ligocki's notation, plus fully machine-checked Coq/Rocq proofs (no axioms) of their exact or lower-bound scores, comparing them against prior champions.
Why now: It introduces a BB(10) machine proven to produce more ones than Graham's number, beating existing BB(8)/BB(9)/BB(10) champions — evidently discussed on Hacker News alongside that claim.
Who it is for: Busy-beaver researchers and enthusiasts interested in record-breaking Turing machines and formal verification of their scores.
Stars over our 110 snapshots: 1 to 6, since 1 d ago.
Where people talked about it
- Yhn BB(10) > Graham's Number 23 h ago
API: https://socialmediatrends-api.osmike.com/v1/repos/jeff87654/busy-beaver