User:MrSolis/Playground

From BusyBeaverWiki
Revision as of 19:22, 1 February 2025 by MrSolis (talk | contribs)
Jump to navigation Jump to search

5-state busy beaver winner (Remake)

The 5-state busy beaver (BB(5)) winner is 1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA (bbch). Discovered by Heiner Marxen and Jürgen Buntrock in 1989[1], this machine proved that BB⁡(5)≥47176870 and Σ(5)≥4098 at the time.

Analysis

Let g(x):=0∞<A1x0∞. Then, g(3x)→5x2+19x+15g(5x+6),g(3x+1)→5x2+25x+27g(5x+9),g(3x+2)→6x+120∞1Z>01001x+110∞

  1. ↑ H. Marxen and J. Buntrock. Attacking the Busy Beaver 5. Bulletin of the EATCS, 40, pages 247-251, February 1990. https://turbotm.de/~heiner/BB/mabu90.html