BB(1,m)

BB(1) refers to the busy beaver problem for 1 state and 2 symbols. It is relatively trivial with only 3 different turing machines in TNF: One halting: 1RZ--- (bbch) and two trivial Translated Cyclers: 0RA--- (bbch) and 1RA--- (bbch). TMs in BB domains with just a single state have the special property of only having access to one of their transitions (A0), effectively making them 1-instruction TMs in BBi. As a result S(1,m) = 1 and Σ(1,m) = 1.

Champions

S(1) = 1, achieved by:

• 1RZ--- (bbch)

Σ(1) = 1, achieved by:

• 1RZ--- (bbch)