Kavli Affiliate: Chris Xu | First 5 Authors: The bbchallenge Collaboration, The bbchallenge Collaboration, , , | Summary: 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 […]
Continue.. Determination of the fifth Busy Beaver value