Greedy Busy Beaver
The Forced Extensioned Busy Beaver function or Greedy Busy Beaver gBB(n) is the largest number of steps taken by an n-state 2-symbol Turing machine, but where its first n-1 states (in the order encountered during running the machine) must also be a machine taking gBB(n-1) steps with the halting transition 1RZ changed to a transition to the new state. Undefined transition --- of previous states can be filled with any transitions.
Champions
| n | gBB(n) | Machines |
|---|---|---|
| 1 | 1 | 1RZ--- (bbch)
|
| 2 | 6 | 0RB1RZ_1LA1RB (bbch)
|
| 3 | >= 15 | 0RB1LC_1LA1RB_0LA1RZ (bbch)
|