HOT RADAR
llmHEAT 13.4°

AI CLUSTERED EVENT · 10/13/2026

BB(10) Exceeds Graham's Number: Machine-Verified Turing Machine Records and Coq Proofs

1 reports archived1 independent sourcesupdated 10/13/2026, 20:40:04
Synthesis & Latest Updates
1 Sources Cross-Validated

This project releases machine-verified Busy Beaver (BB) results, demonstrating that an 8-state Turing machine halts with a score exceeding Graham's number. The key breakthrough lies in using the Coq proof assistant to formally verify the machine's behavior without relying on unproven axioms. This provides a rigorous, reproducible benchmark for studying undecidability and hyper-computation.

LATEST/This project releases machine-verified Busy Beaver (BB) results, demonstrating that an 8-state Turing machine halts with a score exceeding Graham's number. The key breakthrough lies in using the Coq proof assistant to formally verify the machine's behavior without relying on unproven axioms. This provides a rigorous, reproducible benchmark for studying undecidability and hyper-computation.

HEAT TRENDHourly heat curve

3 fully observed hours
Now
13.4
Peak
14.123:00
24h change
–

The line compares only sources observed throughout; gap hours are interpolated to keep the trend continuous.

TIMELINECoverage timeline

Total 1 reports · Latest first
  1. Hacker News AIT2·68 pts
    • The BB(8) Turing machine, verified via Coq, mathematically exceeds Graham's number in both steps and output.
    • The project employs an 'axiom-free' proof strategy, cross-validating results with independent simulators and formal proofs.
    • A complete toolchain (Python simulator + Coq scripts) is provided to support community reproduction and exploration of higher-order BB problems.
BB(10) Exceeds Graham's Number: Machine-Verified Turing Machine Records and Coq Proofs | Today for AI