BB(1,m)

BB(1,m) is the Busy Beaver problem for 1-state, m-symbol TMs. They are relatively trivial. No matter how many symbols you have, TNF only has access to a single transition, the initial A0 transition. In fact, there are only 3 different turing machines in TNF: One halting: A0:1RZ and 2 trivial Translated Cyclers: A0:0RA and A0:1RA. These are effectively 1-instruction TMs in BBi. As a result S(1,m) = 1 and Σ(1,m) = 1.

Champions

S(1,m) = 1, achieved by:

• 1RZ--- (bbch)

Σ(1,m) = 1, achieved by:

• 1RZ--- (bbch)