Greedy Busy Beaver: Difference between revisions
Jump to navigation
Jump to search
Loader3229 (talk | contribs) Created page with "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 changed to a transition to the new state. Category:Functions" |
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 changed to a transition to the new state. | 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 changed to a transition to the new state. Undefined transition of previous states can be filled with new transitions. | ||
[[Category:Functions]] | [[Category:Functions]] | ||
Revision as of 08:03, 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 changed to a transition to the new state. Undefined transition of previous states can be filled with new transitions.