Greedy Busy Beaver

From BusyBeaverWiki
Revision as of 08:02, 15 November 2026 by 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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.