BB(1,m)

From BusyBeaverWiki

Revision as of 21:13, 24 August 2025 by Sligocki (talk | contribs) (Note how small this domain is.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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).

Champions

S(1) = 1, achieved by:

1RZ--- (bbch)

Σ(1) = 1, achieved by:

1RZ--- (bbch)

Retrieved from "https://wiki.bbchallenge.org/w/index.php?title=BB(1,m)&oldid=3301"

BB Domains