2 papers
cs.LO2026
Determination of the fifth Busy Beaver value
The bbchallenge Collaboration, Justin Blanchard, Daniel Briggs +17
The Busy Beaver value is the maximum number of steps that an -state 2-symbol Turing machine can perform from the all-zero tape before halting. was historically introd…
cs.LO2025
Turing machines deciders, part I
The bbchallenge Collaboration, Justin Blanchard, Konrad Deka +9
The Busy Beaver Challenge (or bbchallenge) aims at collaboratively solving the following conjecture: "" [Radó, 1962], [Marxen and Buntrock, 1990], [Aaronson…