User:MrSolis/Playground
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 and at the time.
Analysis
Let . 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}}
- ↑ 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