BB(8): Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Polygon (talk | contribs)
Referenced champion
C7X (talk | contribs)
Add History
Line 4: Line 4:


In November 2025, an enumeration of a test sample of BB(8) TMs has shown the enumeration of one of the 1 million subtasks to take 7.5 hours and produce 35,000 [[holdouts]].<ref>https://discord.com/channels/960643023006490684/1084047886494470185/1441512023774199940</ref> These values are 225 times longer and 350 times larger than for BB(7). This makes BB(8) even harder to enumerate than [[BB(2,7)]]. It is expected that an enumeration of this domain will leave about 147,000,000,000 holdouts.<ref>https://discord.com/channels/960643023006490684/960643023530762341/1484060947424477235</ref>
In November 2025, an enumeration of a test sample of BB(8) TMs has shown the enumeration of one of the 1 million subtasks to take 7.5 hours and produce 35,000 [[holdouts]].<ref>https://discord.com/channels/960643023006490684/1084047886494470185/1441512023774199940</ref> These values are 225 times longer and 350 times larger than for BB(7). This makes BB(8) even harder to enumerate than [[BB(2,7)]]. It is expected that an enumeration of this domain will leave about 147,000,000,000 holdouts.<ref>https://discord.com/channels/960643023006490684/960643023530762341/1484060947424477235</ref>
== History ==
{| class="wikitable mw-collapsible"
|+
! colspan="6" |Timeline of bounds established for Σ(8) and S(8)
|-
!Time of discovery
!Machine
!S(8)
!Σ(8)
!Discoverer
!Notes
|-
|November 1964
| style="background: #CCFFFF;" |{{TM|1LB1RZ_0LC1LC_0LD0LC_1LE1RA_0LF0LE_1LG1RD_0LH0LG_1RH1RF|halt}}
|
| <math>\frac{7 \cdot 3^{93} - 3}{2} > 8.247 \times 10^{44}</math>
|Green, M. W.<ref>sligocki, "[https://www.sligocki.com/2023/10/19/greens-machines.html Green's Machines]" (2023). Accessed 29 October 2026.</ref>
|This is the <math>n = 8</math> [[Green's machines|Green's machine]].
|-
|July 2000
| style="background: #CCFFFF;" |{{TM|1RB0RC_0LA0RD_1RD1RZ_1LE0LD_1RF1LB_1RA1RE|halt}}
| <math> > 5.3\times 10^{42}</math>
| <math> > 2.5\times 10^{21}</math>
| Marxen, H., Buntrock, J.<ref name="heiner-bb-list">https://turbotm.de/~heiner/BB/bb-list</ref>
|
|-
| rowspan="2" |August 2000
| style="background: #CCFFFF;" |{{TM|1RB0LC_1LA1RC_1RA0LD_1LE1LC_1RF1RZ_1RA1RE|halt}}
| <math> > 6.1\times 10^{119}</math>
| <math> > 1.4\times 10^{60}</math>
| Marxen, H., Buntrock, J.<ref>sligocki, "[https://www.sligocki.com/2023/10/19/greens-machines.html Green's Machines]" (2023). Accessed 29 October 2026.</ref>
|
|-
| style="background: #CCFFFF;" |{{TM|1RB0LB_0RC1LB_1RD0LA_1LE1LF_1LA0LD_1RH1LE|halt}}
| <math> > 6.1\times 10^{925}</math>
| <math> > 6.4\times 10^{60}</math>
| rowspan="2" |Marxen, H., Buntrock, J.<ref name="heiner-bb-list" /><ref name="heiner-bb-6list">https://turbotm.de/~heiner/BB/bb-6list</ref>
|
|-
|February 2001
| style="background: #CCFFFF;" |{{TM|1RB0LF_0RC0RD_1LD1RE_0LE0LD_0RA1RC_1LA1RZ|halt}}
| <math> > 3.00\times 10^{1,730}</math>
| <math> > 1.29\times 10^{865}</math>
|
|-
|November&nbsp;2007
| style="background: #CCFFFF;" |{{TM|1RB0RF_0LB1LC_1LD0RC_1LE1RZ_1LF0LD_1RA0LE|halt}}
| <math> > 8.92\times 10^{1,762}</math>
| <math> > 2.50\times 10^{881}</math>
| rowspan="2" |Ligocki, T., Ligocki,&nbsp;S.<ref name=":2">https://web.archive.org/web/20160420171959/http://www.drb.insel.de/~heiner/BB/bbsimtab.html</ref>
|
|-
|December 2007
| style="background: #CCFFFF;" |{{TM|1RB0LE_1LC0RA_1LD0RC_1LE0LF_1LA1LC_1LE1RZ|halt}}
| <math> > 2.58\times 10^{2,879}</math>
| <math> > 4.64\times 10^{1,439}</math>
|
|-
|May 2010
| style="background: #CCFFFF;" |{{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LA0RB_0RC0RE|halt}}
| <math> > 3.80\times 10^{21,132}</math>
| <math> > 3.18\times 10^{10,566}</math>
| rowspan="2" |Kropitz, P.<ref name=":2" />
|
|-
|June 2010
| style="background: #CCFFFF;" |{{TM|1RB1LE_1RC1RF_1LD0RB_1RE0LC_1LA0RD_1RZ1RC|halt}}
| <math> > 7.41\times 10^{36,534}</math>
| <math> > 3.51\times 10^{18,267}</math>
|
|-
|13 May 2022
| style="background: #CCFFFF;" |{{TM|1RB1RC_1LC0RF_1RA0LD_0LC0LE_1LD0RA_1RE1RZ|halt}}
| <math> > 9.66\times 10^{78,913}</math>
| <math> > 6.02\times 10^{39,456}</math>
|Ligocki, S.<ref name=":0">https://www.sligocki.com/2022/06/21/bb-6-2-t15.html</ref>
|
|-
|15 May 2022
| style="background: #CCFFFF;" |{{TM|1RB1RZ_1RC1RA_1RD0RB_1LE0RC_0LF0LD_0LB1LA|halt}}
| <math> > 5.42\times 10^{197,282}</math>
| <math> > 2.01\times 10^{98,641}</math>
| rowspan="2" |Kropitz, P.<ref name=":0" />
|
|-
|22 May 2022
| style="background: #CCFFFF;" |{{TM|1RB1RZ_0LC0LD_1LD1LC_1RE1LB_1RF1RD_0LD0RA|halt}}
| <math> > 8.27\times 10^{1,292,913,985}</math>
| <math> > 1.76\times 10^{646,456,993}</math>
|
|-
|27 May 2022
| style="background: #CCFFFF;" |{{TM|1RB0LA_1LC1LF_0LD0LC_0LE0LB_1RE0RA_1RZ1LD|halt}}
| colspan="2" | <math> > 10\uparrow\uparrow 5.63</math>
|Ligocki, S.<ref name=":0" />
|-
|30 May 2022
| style="background: #CCFFFF;" |{{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE|halt}}
| colspan="2" | <math> > 10\uparrow\uparrow 15.60</math>
|Kropitz, P.<ref>S. Ligocki, "[https://www.sligocki.com/2022/06/21/bb-6-2-t15.html BB(6, 2) > 10↑↑15]". Blog post, 2022. Accessed 20 June 2024.</ref>
|
|-
|2024
| {{TM|1RH1RF_0LC0LH_0RD1LC_0RE1RA_1RB1RE_1RZ1RG_1RF0RE_1LB1LH|halt}}
| colspan="2" | <math> > 2 \uparrow^5 4</math>
|racheline
|
|-
|10 May 2025
| style="background: #CCFFFF;" |{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF|halt}}
| colspan="2" | <math> > 2 \uparrow^{11} 2 \uparrow^{11} 3</math>
|Kropitz, P.<ref>https://discord.com/channels/960643023006490684/1369339127652159509/1370678203395604562</ref>
|This was the first example of a 7-state, 2-symbol Ackermann-level machine.
|-
|4 October 2026
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_1LC0RH_1RG1LF|halt}}
|colspan="2" | <math> > 2 \uparrow^{37} 3</math>
|Ketchersid, J.,<ref>https://discord.com/channels/960643023006490684/1448375857046360094/1556422395776995408</ref><ref>https://github.com/jeff87654/busy-beaver/commit/d8d00340fc3435684c0baf506f5c1d84b6f7f4a8</ref> Claude Opus 5.5, and Gemini 4 Argon
|
|-
|19 October 2026
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LH0LC_1RG1LD_0RG0RF_1RG1RZ|halt}}
|colspan="2" | <math> > f^3_\omega(12)</math>
|Ketchersid, J.,<ref>https://github.com/jeff87654/busy-beaver/commit/be7b08caf8b6bc30a32c0c6274c1ce7f14f5c2d3</ref> Claude Opus 5.5, and Gemini 4 Argon
|
|}
Machines highlighted in <span style="background: #CCFFFF">blue</span> were inherited from the hunt for smaller machines.


== References ==
== References ==


[[Category:BB Domains]]
[[Category:BB Domains]]

Revision as of 20:48, 29 October 2026

The 8-state, 2-symbol busy beaver problem BB(8) is unsolved and largely unexplored. It is assumed that the longest running machine will run for more than Graham's number steps.

The current BB(8) champion is 1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LH0LC_1RG1LD_0RG0RF_1RG1RZ (bbch), which takes over fω3(12) steps to halt.[1] It was constructed by Jeff Ketchersid in 2026 by modifying the Pavel Kropitz's former BB(7) champion.

In November 2025, an enumeration of a test sample of BB(8) TMs has shown the enumeration of one of the 1 million subtasks to take 7.5 hours and produce 35,000 holdouts.[2] These values are 225 times longer and 350 times larger than for BB(7). This makes BB(8) even harder to enumerate than BB(2,7). It is expected that an enumeration of this domain will leave about 147,000,000,000 holdouts.[3]

History

Timeline of bounds established for Σ(8) and S(8)
Time of discovery Machine S(8) Σ(8) Discoverer Notes
November 1964 1LB1RZ_0LC1LC_0LD0LC_1LE1RA_0LF0LE_1LG1RD_0LH0LG_1RH1RF (bbch) 7⋅393−32>8.247×1044 Green, M. W.[4] This is the n=8 Green's machine.
July 2000 1RB0RC_0LA0RD_1RD1RZ_1LE0LD_1RF1LB_1RA1RE (bbch) >5.3×1042 >2.5×1021 Marxen, H., Buntrock, J.[5]
August 2000 1RB0LC_1LA1RC_1RA0LD_1LE1LC_1RF1RZ_1RA1RE (bbch) >6.1×10119 >1.4×1060 Marxen, H., Buntrock, J.[6]
1RB0LB_0RC1LB_1RD0LA_1LE1LF_1LA0LD_1RH1LE (bbch) >6.1×10925 >6.4×1060 Marxen, H., Buntrock, J.[5][7]
February 2001 1RB0LF_0RC0RD_1LD1RE_0LE0LD_0RA1RC_1LA1RZ (bbch) >3.00×101,730 >1.29×10865
November 2007 1RB0RF_0LB1LC_1LD0RC_1LE1RZ_1LF0LD_1RA0LE (bbch) >8.92×101,762 >2.50×10881 Ligocki, T., Ligocki, S.[8]
December 2007 1RB0LE_1LC0RA_1LD0RC_1LE0LF_1LA1LC_1LE1RZ (bbch) >2.58×102,879 >4.64×101,439
May 2010 1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LA0RB_0RC0RE (bbch) >3.80×1021,132 >3.18×1010,566 Kropitz, P.[8]
June 2010 1RB1LE_1RC1RF_1LD0RB_1RE0LC_1LA0RD_1RZ1RC (bbch) >7.41×1036,534 >3.51×1018,267
13 May 2022 1RB1RC_1LC0RF_1RA0LD_0LC0LE_1LD0RA_1RE1RZ (bbch) >9.66×1078,913 >6.02×1039,456 Ligocki, S.[9]
15 May 2022 1RB1RZ_1RC1RA_1RD0RB_1LE0RC_0LF0LD_0LB1LA (bbch) >5.42×10197,282 >2.01×1098,641 Kropitz, P.[9]
22 May 2022 1RB1RZ_0LC0LD_1LD1LC_1RE1LB_1RF1RD_0LD0RA (bbch) >8.27×101,292,913,985 >1.76×10646,456,993
27 May 2022 1RB0LA_1LC1LF_0LD0LC_0LE0LB_1RE0RA_1RZ1LD (bbch) >10↑↑5.63 Ligocki, S.[9]
30 May 2022 1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE (bbch) >10↑↑15.60 Kropitz, P.[10]
2024 1RH1RF_0LC0LH_0RD1LC_0RE1RA_1RB1RE_1RZ1RG_1RF0RE_1LB1LH (bbch) >2↑54 racheline
10 May 2025 1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF (bbch) >2↑112↑113 Kropitz, P.[11] This was the first example of a 7-state, 2-symbol Ackermann-level machine.
4 October 2026 1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_1LC0RH_1RG1LF (bbch) >2↑373 Ketchersid, J.,[12][13] Claude Opus 5.5, and Gemini 4 Argon
19 October 2026 1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LH0LC_1RG1LD_0RG0RF_1RG1RZ (bbch) >fω3(12) Ketchersid, J.,[14] Claude Opus 5.5, and Gemini 4 Argon

Machines highlighted in blue were inherited from the hunt for smaller machines.

References