BB(1,m): Difference between revisions
Jump to navigation
Jump to search
(Note how small this domain is.) |
(Added additional information) |
||
| Line 1: | Line 1: | ||
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: {{TM|1RZ---|halt}} and two trivial [[Translated Cyclers]]: {{TM|0RA---}} and {{TM|1RA---}}. | 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: {{TM|1RZ---|halt}} and two trivial [[Translated Cyclers]]: {{TM|0RA---}} and {{TM|1RA---}}. TMs in BB domains with just a single state have the special property of only having access to one of their transitions (A0). As a result S(1,m) = 1 and Σ(1,m) = 1. | ||
==Champions== | ==Champions== | ||
Revision as of 21:24, 24 August 2025
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). 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)