BB(1,m): Difference between revisions
Jump to navigation
Jump to search
(Update to BB(1,m)) |
(→Champions: Made champions section consistent with other domain pages) |
||
| Line 2: | Line 2: | ||
==Champions== | ==Champions== | ||
S(1,m) = 1 | S(1,m) = 1 and Σ(1,m) = 1 are both achieved by only one [[champion]] in TNF: | ||
Σ(1,m) = 1 | |||
* {{TM|1RZ---|halt}} | * {{TM|1RZ---|halt}} | ||
[[Category:BB Domains]] | [[Category:BB Domains]] | ||
Revision as of 14:30, 30 August 2025
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 and Σ(1,m) = 1 are both achieved by only one champion in TNF:
1RZ---(bbch)