Maximum number of steps executed by an n-state 2-symbol Turing machine that halts on empty input. Uncomputable (grows faster than any computable function). BB(5) = 47,176,870 settled 2024 by the bbchallenge.org collaboration.
Maximum number of steps executed by an n-state 2-symbol Turing machine that halts on empty input. Uncomputable (grows faster than any computable function). BB(5) = 47,176,870 settled 2024 by the bbchallenge.org collaboration.