Theoretical computer scientists made historic progress on the Busy Beaver problem, bounding BB(5) and mapping the frontier where simple Turing machine halting behavior transitions from provably decidable arithmetic into undecidable statements independent of ZFC set theory. quantamagazine.org