2 citations · 2 across the 5 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
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,…
cs.LO2021
Hardness of busy beaver value BB(15)
Tristan Stérin, Damien Woods
The busy beaver value BB(n) is the maximum number of steps made by any n-state, 2-symbol deterministic halting Turing machine starting on blank tape. The busy beaver function $n \m…