Greedy Busy Beaver: Difference between revisions
Jump to navigation
Jump to search
Loader3229 (talk | contribs) No edit summary |
Loader3229 (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
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 <code>1RZ</code> changed to a transition to the new state. Undefined transition <code>---</code> of previous states can be filled with any transitions. | 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 <code>1RZ</code> changed to a transition to the new state. Undefined transition <code>---</code> of previous states can be filled with any transitions. | ||
== Champions == | |||
{| class="wikitable" | |||
|- | |||
! n !! gBB(n) !! Machines | |||
|- | |||
| 1 || 1 || {{TM|1RZ---|halt}} | |||
|- | |||
| 2 || 6 | |||
|{{TM|0RB---_1LA1RB|halt}} | |||
{{TM|1RB---_0LB1LA|halt}} | |||
{{TM|1RB0LB_1LA---|halt}} | |||
{{TM|1RB1LB_1LA---|halt}} | |||
{{TM|1RB---_1LB1LA|halt}} | |||
|- | |||
| 3 || >= 15 | |||
|{{TM|0RB1LC_1LA1RB_0LA---|halt}} | |||
{{TM|0RB1LC_1LA1RB_1LB---|halt}} | |||
|} | |||
[[Category:Functions]] | [[Category:Functions]] | ||
Revision as of 08:10, 15 November 2026
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 | 0RB---_1LA1RB (bbch)
|
| 3 | >= 15 | 0RB1LC_1LA1RB_0LA--- (bbch)
|