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.