9 citations · 9 across the 3 of their papers we have counts for
1 paper · 1 filter
The bbchallenge Collaboration, Justin Blanchard, Daniel Briggs +17
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. S was historically introd…