User:MrSolis/Playground

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

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, Failed to parse (unknown function "\c"): {\displaystyle \begin{align} g(3x)& \xrightarrow{5x^2+19x+15}&g(5x+6),\\ g(3x+1)&\xrightarrow{5x^2+25x+27}&g(5x+9),\c\ g(3x+2)&\xrightarrow{6x+12}&0^\infty\;1\;\textrm{Z>}\;01\;001^{x+1}\;1\;0^\infty. \end{array}} g(x)→5x+183if x≡0(mod3)g(x)→5x+223if x≡1(mod3)g(x)→HALTif x≡2(mod3)

  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