BusyBeaver(230) proven independent of ZFC, formalized in Rocq — new record for the BB challenge
MoonL88537 · x · 2026-10-19
Elliot Glazer announces that BusyBeaver(230) is independent of ZFC: he has verified in the Rocq proof assistant that a 230-state Turing machine halts iff ZFC is inconsistent. This beats the previous non-formalized 243-state machine and the formalized 254-state machine, pushing the known boundary of the Busy Beaver challenge lower. Quipped as "playing code golf with the universe."
More from Research
- What should a robot model predict? Four paradigms compared on the same robot data — GlenBerseth · 2026-10-19
- Stanford's Potts weighs in on superposition critique: RAVEL author says alternative explanations viable — gregd_nlp · 2026-10-19
- Ben Goertzel: Which Minds Emerge Beneficial Basic AI Drives as They Become Superintelligent? — bengoertzel · 2026-10-19
- Robots ace blind precision assembly using only joint encoder signals, no cameras — kevin_zakka · 2026-10-19
- Sparse retrieval may beat dense-vector compression while keeping inverted-index search fast — IgorCarron · 2026-10-19
- Why sparse vectors matter: inverted indexes only touch documents sharing query concepts — IgorCarron · 2026-10-19