Comment by karmakaze

3 months ago

The busy beaver numbers form an uncomputable sequence.

For BB(5) the proof of its value is an indirect computation. The verification process involved both computation (running many machines) and proofs (showing others run forever or halt earlier). The exhaustiveness of crowdsourced proofs was a tour de force.