Researchers Formally Verify Fifth Busy Beaver Value S(5) = 47,176,870 Using Coq Proof Assistant

We prove that $S(5) = 47,176,870$ using the Coq proof assistant. The Busy Beaver value $S(n)$ is the maximum number of steps that an $n$-state 2-symbol Turing machine can perform from the all-zero tape before halting, and $S$ was historically introduced b

0

arxiv.org10mo ago