<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.bbchallenge.org/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Sligocki</id>
	<title>BusyBeaverWiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.bbchallenge.org/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Sligocki"/>
	<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/wiki/Special:Contributions/Sligocki"/>
	<updated>2026-11-20T06:58:43Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.5</generator>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Champions&amp;diff=11250</id>
		<title>Champions</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Champions&amp;diff=11250"/>
		<updated>2026-11-19T19:19:55Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Conjectured */ Conjectured -&amp;gt; Conditional. Add a little intro and move Notes out to main text with adjusted wording.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Busy Beaver &#039;&#039;&#039;Champions&#039;&#039;&#039; are the current record holding [[Turing machine|Turing machines]] which maximize a [[Busy Beaver function]]. In this article we focus specifically on the longest running TMs. Some have been proven to be the longest running of all (and so are the ultimate champion) while others are only current champions and may be usurped in the future. For smaller domains, Pascal Michel&#039;s website is the canonical source for [https://bbchallenge.org/~pascal.michel/bbc Busy Beaver champions] and the [https://bbchallenge.org/~pascal.michel/ha History of Previous Champions]. 1-state domains are omitted as [[BB(1,m)]] = 1 for m &amp;gt; 1.&lt;br /&gt;
&lt;br /&gt;
== Trivial Champions ==&lt;br /&gt;
[[BB(n,1)]] = n&lt;br /&gt;
&lt;br /&gt;
[[BB(1,m)]] = 1&lt;br /&gt;
&lt;br /&gt;
== 2-Symbol TMs ==&lt;br /&gt;
Rows are blank if no champion has been found which surpasses a smaller size problem. Also take note that the &amp;lt;math&amp;gt;f_{x}(n)&amp;lt;/math&amp;gt; used in the lower bounds represent the [[Fast-Growing Hierarchy]] while &amp;lt;math&amp;gt;\uparrow&amp;lt;/math&amp;gt; represents [[wikipedia:Knuth&#039;s_up-arrow_notation|Knuth&#039;s up-arrow notation]]; see [[measuring large numbers]] for more information. Machines below 6 states are listed in [[Tree Normal Form|TNF]] format, where machines which tie for champion are all listed. Note that most champions above 6 states are self-reported and have not been independently verified.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- For editors: If someone used an LLM to find TMs, please always attribute their name, because machine discoveries can&#039;t be attributed to LLMs only, according to laws. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;6&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1LB_1LA1RZ|halt}} {{TM|1RB0LB_1LA1RZ|halt}} {{TM|1RB1RZ_1LB1LA|halt}} {{TM|1RB1RZ_0LB1LA|halt}} {{TM|0RB1RZ_1LA1RB|halt}}&lt;br /&gt;
|[[Tibor Radó]]&lt;br /&gt;
|Direct Simulation&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;21&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1RZ_1LB0RC_1LC1LA|halt}}&lt;br /&gt;
|Proven by [[Shen Lin]]&lt;br /&gt;
|Direct Simulation&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;107&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1LB_1LA0LC_1RZ1LD_1RD0RA|halt}}&lt;br /&gt;
|Allen Brady&lt;br /&gt;
|Direct Simulation&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(5)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;47\,176\,870&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA|halt}}&lt;br /&gt;
|Heiner Marxen &amp;amp; Jürgen Buntrock in 1989&lt;br /&gt;
|Direct Simulation&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 8&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1RA_1RC1RZ_1LD0RF_1RA0LE_0LD1RC_1RA0RE|halt}}&lt;br /&gt;
|mxdys in 2025&lt;br /&gt;
|See mxdys&#039;s analysis on the TM page&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(7)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 3 \uparrow^{20} 3 &amp;gt; f_\omega(20)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB0RG_1RC1RB_0RD1RZ_0LE0LD_0LF1LE_1RA1LF_1LC0RB|halt}}&lt;br /&gt;
|Jeff Ketchersid and Gemini in Oct 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB7/1RB0RG_1RC1RB_0RD---_0LE0LD_0LF1LE_1RA1LF_0LD0RB.md Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(8)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_\omega^3(12)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LH0LC_1RG1LD_0RG0RF_1RG1RZ|halt}}&lt;br /&gt;
|Jeff Ketchersid and Gemini in Oct 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB8/1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LH0LC_1RG1LD_0RG0RF_1RG---.md Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(9)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_\omega^7(12)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_0LH0LC_1RG1LD_0RG0RF_0LI1RZ_1RI1RC|halt}}&lt;br /&gt;
|Jeff Ketchersid and Gemini in Oct 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB9/1RB0RA_1LC1LF_1RD0LB_1RA1LE_0LH0LC_1RG1LD_0RG0RF_0LI---_1RI1RC.md Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(10)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}(2 \uparrow^{36} 3) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LI0LC_0RG1LD_1RH1LG_1LC0RG_0LJ0LI_1RZ0LC|halt}}&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1557806386073702622 Jeff Ketchersid and Claude in Oct 2026 (claimed)]&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB10 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(11)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+2}^2(f_5(34))&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1RH_1RC0LD_1LD1RJ_1LE1LB_1LF1LE_1RG0LE_1RA1RG_0LI1LF_0RC1LI_1RK0RG_1RZ0LB|halt}}&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB11 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(12)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+2}^8(f_3(6))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_1RZ1RF_0LL0RA_1RA0LH_1LG1LH_1RK0LJ_1LH1LI_0LL0RD_0LH1LK|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB12 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(13)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+3}(19)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_0LM1RF_1RG0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_1RZ0LL_0LM1LK_0LG1LL|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB13 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(14)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+3}(f_\omega(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_0LK1RF_1RM0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_1RZ0LL_1LN1LK_1RK0LH_1LD0RK|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB14 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(15)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(13)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LH0LG_0LI1RC_0LD1LA_0RE1LD_0RH1RL_1RB1RF_1LA1LG_1RF0RO_1LJ1LI_0LK1LI_1RL1RE_0RL0RF_0LA0RN_0LA1RO_1RZ1RM|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB15 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(16)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(f_\omega(14))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LG1LA_0LI1RC_0LD1LG_0RE1LD_0RM1RL_1RB1RF_1LH0LA_1RF0RN_1LJ1LI_0LK1LI_1RL1RE_0RL0RF_0LG0RN_0RP1RO_1RZ1RM_1LB1LI|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB16 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(17)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(f_\omega^4(13))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LG1RH_0LI1RC_0LD1LQ_0RE1LD_0RP1RL_1RB1RF_1LQ1LG_1RF0RO_1LJ1LI_0LK1LI_1RL1RE_0RL0RF_0LQ0RN_0LQ1RO_1RZ1RM_0LQ0RA_1LH0LG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB17 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(18)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(f_{\omega+1}(f_4(2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LH0LG_0LI1RC_0LD1LA_0RE1LD_0RH1RL_1RB1RF_1LA1LG_1RF1RM_1LJ1LI_0LK1LI_1RL1RE_0RL0RF_0LN1RM_1LQ0LO_0LR1LP_1LQ1LN_1LF0LM_0RC1RZ|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB18 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(19)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}^2(f_5(2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LB0LM_1RC1RN_1RD1RC_0LE1RQ_1LF1LE_0LG1LE_1RH1RI_0RH0RC_0RJ1RH_0RS0RK_1LN1RL_1LM1RJ_1LA1LM_0LA0RO_0LC1RP_0LA1RN_0LR1LA_0RI1LR_1RZ1LL|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB19 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(20)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}^3(f_5(2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LB0LM_1RC1RN_1RD1RC_0LE1RQ_1LF1LE_0LG1LE_1RH1RI_0RH0RC_0RJ1RH_0RT0RK_1LS1RL_1LM1RJ_1LA1LM_0LA0RO_0LC1RP_0LA1RN_0LR1LA_0RI1LR_0LA0LA_1RZ1LK|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB20 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(21)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2}^3(4 \uparrow\uparrow 341)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|0LI0LF_0RJ1RG_0RD1LC_1RH1RE_1LO0RH_1LA1LF_0LC1LA_1RB1RH_1RD0LF_1LP0RK_0LM1LL_0LL1LM_1LE1LN_0RQ0LM_0RP1LO_1LR0RH_1LF1RQ_1RZ0LS_1LH0LT_1LH1LU_0LE1LR|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1026577255754903572/1274471360206344213 Racheline in 2024]&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB21 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(25)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2}^5(4 \uparrow\uparrow 341)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|0LI0LF_0RJ1RG_0RD1LC_1RH1RE_1LO0RH_1LA1LF_0LC1LA_1RB1RH_1RD0LF_1LP0RK_0LM1LL_0LL1LM_1LE1LN_0RQ0LM_0RP1LO_1LR0RH_1LF1RQ_1RZ0LS_1LH0LT_1LH1LU_0LE1LV_0LH0LW_1LH0LX_1LH1LY_0LE1LR|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB25 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(29)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^\omega}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB29/hydra29.md]&lt;br /&gt;
|mxdys in Oct 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB29 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(30)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^\omega}(9)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB30/hydra30.md]&lt;br /&gt;
|Jeff Ketchersid and Gemini Argon in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB30 Claimed analysis by Gemini Argon] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(31)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \uparrow \uparrow 4}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB31/hydra31.md]&lt;br /&gt;
|mxdys in Oct 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB31 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(32)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \uparrow \uparrow 4}(8)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB32/hydra32.md]&lt;br /&gt;
|Jeff Ketchersid and Gemini Argon in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB32 Claimed analysis by Gemini Argon] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(33)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \uparrow \uparrow 6}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB33/hydra33.md]&lt;br /&gt;
|mxdys in Oct 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB33 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(34)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \uparrow \uparrow 6}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB34_2/hydra34.md]&lt;br /&gt;
|Jeff Ketchersid and Gemini Argon in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB34_2 Claimed analysis by Gemini Argon] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(48)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_1}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1567585091172040726]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1567585091172040726 roromachine14 and Gemini in 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(150)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{lim(BMS)}(10\uparrow\uparrow 15)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://morphett.info/turing/turing.html?c95a199c8e8a3dd56452f8b7e28fabbf too large to show]&lt;br /&gt;
|Patcail in 2025&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1026577255754903572/1328863966688182345&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(1015)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; D^{5}(99)&amp;lt;/math&amp;gt; = Loader&#039;s Number&lt;br /&gt;
|&lt;br /&gt;
|CatsAreFluffy in 2024&amp;lt;ref&amp;gt;https://github.com/CatsAreFluffy/metamath-turing-machines/commit/85948b04fc4aeb983ca6d63d6aee5ad6ef308bfe&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Conditional ===&lt;br /&gt;
The following champions have been proven to halt conditional on additional axioms (beyond standard ZFC). If they halt, they beat the champions in the main section.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;q(n)&amp;lt;/math&amp;gt; is derived from [[wikipedia:Laver table|Laver tables]]. The q function was proven total assuming ZFC+I3, but not in standard ZFC. hzyhhzy proved that if &amp;lt;math&amp;gt;q(5)&amp;lt;/math&amp;gt; is defined, &amp;lt;math&amp;gt;q(5) &amp;gt; f_{lim(BMS)+\omega+1}(3)&amp;lt;/math&amp;gt; (Not independently verified). If these machines are infinite then [[Logical_independence|ZFC+I3 is inconsistent]].&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
|-&lt;br /&gt;
|BB(27)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 2^{q(5)}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://github.com/hzyhhzy/laver-table-atlas/blob/main/busy-beaver/q5-27/machine.tm hzyhhzy GitHub]&lt;br /&gt;
|hzyhhzy and GPT Astra in Nov 2026&lt;br /&gt;
|-&lt;br /&gt;
|BB(67)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; q^{81}(q(5)-2)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://wiki.bbchallenge.org/wiki/Talk:Champions]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1339669138510970881 racheline in 2025] &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 3-Symbol TMs ==&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,3)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;38&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB2LB1RZ_2LA2RB1LB|halt}}&lt;br /&gt;
|Allen Brady in 1988&lt;br /&gt;
|Direct Simulation&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,3)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{17}&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|0RB2LA1RA_1LA2RB1RC_1RZ1LB1LC|halt}}&lt;br /&gt;
|Terry &amp;amp; Shawn Ligocki in 2007&lt;br /&gt;
|[https://bbchallenge.org/~pascal.michel/beh#tm33h Analysis by Pascal Michel]&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,3)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10 \uparrow^4 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1RD1LC_2LB1RB1LC_1RZ1LA1LD_0RB2RA2RD|halt}}&lt;br /&gt;
|Pavel Kropitz in 2024&lt;br /&gt;
|See Polygon&#039;s analysis on the TM page &lt;br /&gt;
|-&lt;br /&gt;
|BB(5,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_\omega(2 \uparrow^7 7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1LC1RA_1LA2LC1RB_1LB1LD2LC_2RE2LD1RA_1RZ2RE1RB|halt}}&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed) &lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB53 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_\omega^2(10\uparrow\uparrow\uparrow 6)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1LE2LD2LC_2RB1RB1RA_2RB1LC0LC_1RB1LD2LD_2RD2LE2LF_1RZ---1LE|halt}}&lt;br /&gt;
|Jacobzheng in 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}(11)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|2RD1LE2RA_0LE2LE2RB_1RF1RC2RB_0RC0LG1LD_1RC2LE1LG_1RG0LA1RZ_1LD2RA2LG|halt}}&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|[https://github.com/loader3229/busy-beaver/tree/main/BB73 Claimed analysis by Hunyuan] Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}^3(f_\omega^3(14)) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|2LH1LE2RA_0LE2LE2RB_1RF1RC2RB_0RC0LD0RH_1RC2LE1LG_0LA0LD1RZ_1LD2RA2LG_2RD1LF1LG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|[https://github.com/loader3229/busy-beaver/tree/main/BB83 Claimed analysis by Hunyuan] Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(9,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+2}^3(f_{\omega+1}^2(f_\omega(14)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|2LI1LE2RA_0LE2LE2RB_1RF1RC2RB_0RC0LD2RA_1RC2LE1LG_0LA0LD1RH_1LD2RA2LG_1RZ2LA2LI_1RD1LI2LH|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(10,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(11)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA_2LE2LH2RB_1LI1RC2RB_0RC1RD0LG_0LF1LE1LE_1RG1RZ---_0RC1LH2RG_1RC2LH1LA_1RJ2LI2LB_0RF1LA0RI|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(11,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2+1}(21)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA_2LE2LH2RB_1LG1RC2RB_0RC1RD0LG_0LF1LE1LE_1RG1RI1LK_0RC1LH2RG_1RC2LH1LA_0RI2RI2RJ_1LK0LH1RZ_1RA2LB0RA|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(12,3)&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BB(13,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2+1}^3(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA_2LE2LH2RB_2LM1RC2RB_0RC1RD0LG_0LF1LE1LE_1RG1RI1LM_0RC1LH2RG_1RC2LH1LA_0RI2RI2RJ_1RZ0LH1LK_0LK2LL1LK_0LF1RB2RA_2RL0LL0LL|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(14,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2+2}(14)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA_2LE2LH2RB_2LM1RC2RB_0RC1RD0LG_0LF1LE1LE_1RG1RI1LL_0RC1LH2RG_1RC2LH1LA_0RI2RI2RJ_1RZ0LH1LK_0LK2LL1LK_0LF1LG0LM_0LN2RM2LM_2RF1RB0RB|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(17,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2}(5)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|0LL1LE2RA_0LG2LE2RB_1RC1RC2RB_0LF2RA2LD_1RC2LE1LD_0RC0RC2RN_0RJ2RH1LG_1LI2RH1LP_1LQ1LI0LG_0RK2RJ2RJ_1RZ1RK2RB_2LN1LI0LH_0RM2LE2RM_2RN2RN2LL_0RM0LP0LP_2LO2LO2LP_1RQ0LQ2RL|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(20,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+1}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LT1LE2RA_0LG2LE2RB_1RC1RC2RB_0LF2RA2LD_1RC2LE1LD_0RC0RC2RN_0RJ2RH1LG_1LI2RH1LP_0LQ1LI0LG_0RK2RJ2RJ_0RL1RK2RB_1RZ0LI0LH_0RM2LE2RM_2RN2RN2LL_0RM0LP0LP_2LO2LO2LP_1LR1LQ1LQ_1RS1LP1LQ_0LR1RS0RD_2LQ1LL1LA|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(21,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+1}(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LT1LE2RA_0LG2LE2RB_1RC1RC2RB_0LF2RA2LD_1RC2LE1LD_0RC0RC2RN_0RJ2RH1LG_1LI2RH1LP_0LQ1LI0LG_0RK2RJ2RJ_0RL1RK2RB_1RZ0LI0LH_0RM2LE2RM_2RN2RN2LL_0RM0LP0LP_2LO2LO2LP_1LR1LQ1LQ_1RS1LP1LQ_0LR1RS2LU_0RD0LS0LU_2LR2LA1RA|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(36,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_0}(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/BB(36,3)&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(37,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_0}(373\,676\,378)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/BB(37,3)&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 4-Symbol TMs ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,4)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;3\,932\,964&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB2LA1RA1RA_1LB1LA3RB1RZ|halt}}&lt;br /&gt;
|Terry &amp;amp; Shawn Ligocki in 2005&lt;br /&gt;
|Pascal Michel, Heiner Marxen, Allen Brady&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,4)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|Pavel Kropitz in 2024&lt;br /&gt;
|[https://www.sligocki.com/2024/05/22/bb-3-4-a14.html Analysis by Shawn Ligocki]&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,4)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_\omega(2 \uparrow^{5} 3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB2LC3RA1RZ_2RC3LB2LB0LC_1LB2RC3RA1LD_2RC1LC3RD2LD|halt}}&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB44 Claimed analysis by Claude] Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(5,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}(65\,536) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3LC1LD2RA_2RC1RZ2LB2LB_1LD3RC1LE2RA_3RC0LB1LD3LD_3RC1LC3LE2RE|halt}}&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in Nov 2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB54 Claimed analysis by Claude] Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}^6(65\,536)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB3LC1LD2RA_2RC3RF2LB2LB_1LD3RC1LE2RA_3RC0LB1LD3LD_3RC1LC3LE2RE_0LC1RF0LB1RZ|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|@Big_numbers in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+3}(21)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|3RD1LE2RA1LF_0LE2LE2RB2RD_1RF1RC2RB0LB_0RC0LD3RC2RA_1RC2LE1LG2RF_0LA0LD3LG1RZ_1LD2RA2LG0RB|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|[https://github.com/loader3229/busy-beaver/tree/main/BB74 Claimed analysis by Hunyuan] Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+8}^2(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA---_2LE2LH2RB1LF_2LA1RC2RB---_0RC1RD0LG1RH_0LF1LE1LE3LB_1RG1RZ3RD3LF_0RC1LH2RG0LC_1RC2LH1LA2LB|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(9,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2}(18)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA3LG_1LI2LH2RB2RF_1LG1RC2RB3LG_0RC1RC1LD3RD_3RD1LE1LE3LE_1RZ3LD2LE3LE_1RG1LH2RG3LG_1RC2LH1LA1LE_0RC3LI1RI0RI|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(10,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2}^3(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA3LG_0LI2LH2RB2RF_1LB1RC2RB3LG_0RC1RC1LD3RD_3RD1LE1LE3LE_1RI3LD2LE3LE_1RG1LH2RG3LG_1RC2LH1LA1LE_0LJ1RZ0RE0LI_3RC3LJ3LJ3LJ|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(11,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+1}(f_{\omega^2}(f_{\omega+3}^2(4)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA3LG_2LI2LH2RB2RF_3RB1RC2RB3LG_0RC1RC1LD3RD_3RD1LE1LE3LE_1RI3LD2LE3LE_1RG1LH2RG3LG_1RC2LH1LA1LE_0LJ0LK1RZ1LI_3RC3LJ3LJ3LJ_0LF0LK0LK0LK|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(12,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+2}(15)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA3LG_2LL2LH2RB2RF_1LG1RC2RB3LG_0RC1RC1LD3RD_3RD1LE1LE3LE_1RI3LD2LE3LE_1RG1LH2RG3LG_1RC2LH1LA1LE_0LJ0LK1RZ---_3RC3LJ3LJ3LJ_0LF0LK0LK0LK_1LF1LL1LL---|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(13,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+3}(15)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA3LG_3LM2LH2RB2RF_1LG1RC2RB3LG_0RC1RC1LD3RD_3RD1LE1LE3LE_1RI3LD2LE3LE_1RG1LH2RG3LG_1RC2LH1LA1LE_0LJ0LK1LL1RZ_3RC3LJ3LJ3LJ_0LF0LK0LK0LK_0LK1LL1LL1LL_2LF2LM2LM---|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(31,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_0}(373\,676\,378)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/BB(31,4)&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 5-Symbol TMs ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,5)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{10^{10^{3\,314\,360}}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3LA4RB0RB2LA_1LB2LA3LA1RA1RZ|halt}}&lt;br /&gt;
|Daniel Yuan in 2024&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1259770421046411285/1379877629288644722 mxdys in Rocq]&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,5)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_\omega(2 \uparrow^{15} 5) &amp;gt; f_\omega^2(15)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3LB4LC2RA4LB_2LC3RB1LC2RA1RZ_3RB1LB3LC2RC4LC|halt}}&lt;br /&gt;
|Racheline in 2024&lt;br /&gt;
|[https://github.com/loader3229/busy-beaver/tree/main/BB35 Claimed analysis by MiniMax] Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}(27\,041) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3LB4LC2RA4LB_2LC3RB1LC2RA4RD_3RB1LB3LC2RC4LC_2RC2RD1RZ4RB1LC|halt}}&lt;br /&gt;
|[[User:Loader3229]] in Oct 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(5,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+2}(55)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|4LE3RA1LC2RB4RE_1RZ3LA1LD2RB2LE_3RA1LA3LC2RC1RE_3RA4LD1LD3LD1RD_2RC4RA2LE2LE1RA|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(10^{19728})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LF3LB4LC2RA4LB_2LE3RB1LC2RA2RD_3RB1LB3LC2RC4LC_1RZ4LD1LE2RD2RD_3RF1LD3LE2RE3LF_1LC3RF4LE2RD4LC|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(2 \uparrow^{12} 5)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LF3LB4LC2RA4LB_1LG3RB1LC2RA2RD_3RB1LB3LC2RC4LC_1RZ4LD1LE2RD2RD_3RF1LD3LE2RE3LF_2LC3RF4LE2RD4LC_4RF2RG1RC0RC1RG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2}(13)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA3LG---_4LC2LH2RB2RF0RB_4LE1RC2RB3LG4RB_0RC1RC1LD3RD3LA_3RD1LE1LE3LE4RE_1RZ3LD2LE3LE4RD_1RG1LH2RG3LG3LF_1RC2LH1LA1LE---|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(9,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+1}(6)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA3LG---_4RI2LH2RB2RF0LD_4LC1RC2RB3LG4RB_0RC1RC1LD3RD4LB_3RD1LE1LE3LE---_3LI3LD2LE3LE1RZ_1RG1LH2RG3LG---_1RC2LH1LA1LE---_0RC3LI3LI3LI0LI|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(10,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+2}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|3LB2LH2RA2RF0LE_1LD2RG2LB3LG3LG_0LJ1RC2RA3LG1RZ_0RC1RC1LD3RD---_3RD1LE1LE3LE0LA_4RC3LD2LE3LE3LI_1RG1LH2RG3LG---_1RC2LH1LB1LE4RE_0RC3LI3LI3LI---_3RB4LJ4LJ4LJ4RH|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(11,5)&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BB(12,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^\omega}^6(14)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LH3RA1LD2RB---_1RZ3LA4LH2RB3LL_3RA1LA3LC2RC---_2RE---3LC2RC---_3RA2RE2RE4RF2LG_1LG1RF3LG3RF4LG_2RJ0LH2LG2LI4LK_0LD1LH1LG3LH4LH_2RC1LI3LG3LI4LI_4LE1RJ2RJ3RJ4RF_---1LK3LE3LK---_3RA1LL1LL1LL---|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(13,5)&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BB(14,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^\omega+1}(51)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|2LG3LB2RM2RA3LL_2LC3RB1LD2RA1RL_3RB1LB3LC2RC3LB_2RE---3LC2RC---_3RB2RE2RE4RF4LB_1LG1RF3LG3RF4LG_2RJ0LH2LG2LI4LK_3RF1LH1LG3LH4LH_4LB1LI3LG3LI4LI_0RH1RJ2RJ3RJ4RF_---1LK3LE3LK---_3RB1LL1LL1LL---_1RZ0RF2LN------_3RC---4LN3LN---|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(17,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_0}(20)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|4RF---0RF0RD1LQ_1RZ1RB2LC------_0LI4RC2RC3RC2RC_1LE1RD2RD3RD---_3LA1LE2LE3LE1LG_0LG1RF2RF3RF---_0RI0LH4RD3RI2LH_2LA1LH2LH3LH0RC_3RN---0LA0LI2RF_2RO---2LJ3LJ---_2LL---2RK3RK4RK_3RO2RO2LL3LL4LL_3LL---2RM3RM4RM_4LJ1LN2LN3LN1LO_1RB4RP1RK0RM4LN_4LJ1RP2RP3RP0RP_1RB1LQ2LQ3LQ1LQ|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(19,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_0}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB2LA1RA2LB2LA_0LA2RB3RB4RA1LQ_1RZ1RC2LD------_0LK3RD2RD2RD4RD_------0RH1LS0RF_1LG1RF2RF---4RF_4LE1LG2LG---4LG_0LI1RH2RH---4RH_0RK0LJ------4RK_2LE1LJ2LJ---4LJ_4RP---0LE---0LK_2RQ---2LL---4LL_2LN---2RM3RM4RM_4RQ2RQ2LN3LN4LN_4LN---2RO3RO4RO_3LL1LP2LP1LQ4LP_1RC3RR1RM3LP0RO_3LL1RR2RR0RR4RR_1RC1LS2LS1LS4LS|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/BB(19,5)&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(94,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi_0(\Omega_2)}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User_blog:Wythagoras/Hydra_machines&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 6-Symbol TMs ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,6)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10 \uparrow\uparrow 10 \uparrow\uparrow 10^{10^{115}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3RB5RA1LB5LA2LB_2LA2RA4RB1RZ3LB2LA|halt}}&lt;br /&gt;
|Pavel Kropitz in 2023&lt;br /&gt;
|[https://www.sligocki.com/2023/05/20/bb-2-6-p3.html Analysis by Shawn Ligocki] &lt;br /&gt;
|-&lt;br /&gt;
|BB(3,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_\omega^3(15)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3LB4LC2RA4LB5LB_2LC3RB1LC2RA5LC1RZ_3RB1LB3LC2RC4LC5LC|halt}}&lt;br /&gt;
|[[User:Loader3229]] in Oct 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+2}(29)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|5LD3LB5LC2RA4LB4LC_1RZ3RB1LC2RA3RD0LA_3RB1LB3LC2RC4LC1RA_3RB0LA2LC4LD4LC4LD|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(5,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+3}(31)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LE3LB2LA2RA4LB5RA_1RZ3RB1LC2RA3RD4RA_3RB1LB3LC2RC4LC2LB_3RB0LA5LE4LD4LC4LD_4LC5LC0RE5LE1RE2RE|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}^2(f_\omega^2(29))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|5RE3LB4LF2RA4LB1RZ_5LE3RB1LD2RA3LF3RD_3RB1LB3LC2RC4LC0LE_3RB2RD3LC2RC1LE3RE_5RC3RE2RA4LC2LE2LA_5RB1RZ1LF1LF1RF5LF|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2}^2(6)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LE3LB2LF2RA4LB2RA_4LF3RB1LD2RA3LF5RB_3RB1LB3LC2RC4LC1LE_3RB3RE3LC2RC1RZ3RD_5RB3RE1RZ4LC3LG5LE_5RB4RF1LF1LF2LF5RG_5LF5RG1LA1LG1RD5LG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+2}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|2LF3LB2LH2RA4LB4LH_1RH3RB1LD2RA3LF5RB_3RB1LB3LC2RC4LC1LE_3RB3RE3LC2RC1RZ3RD_5RB3RE4RG4LC3LG5LE_5RB5RE1RZ1LF5LF5LF_5LF4RG1LB1LG2LH5LG_1RA1RZ1LH1LH2LH5RG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(9,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+2}(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|4LH3LB2LH2RA4LB2RI_4LA3RB1LD2RA3LF5RB_3RB1LB3LC2RC4LC1LE_3RB3RE3LC2RC5LC3RD_5RB3RE4RG4LC3LG5LE_5RB5RB1RH1LF5LF5LF_5LF4RG1LB1LG2RG5LG_1LC1RD1LH1LH5RC5RG_1RZ5LI2LI2LI1LB5RG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(10,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+3}(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LJ3LB2LH2RA4LB2RI_1LA3RB1LD2RA3LF5RB_3RB1LB3LC2RC4LC1LE_3RB3RE3LC2RC2RF3RD_5RB3RE4RG4LC3LG5LE_5RB5RB1LA1LF5LF5LF_5LF4RG1LB1LG4LJ5LG_1RJ3LD1LH1LH3RD5RG_1RZ4LH2LI2LI5LI5RG_1RD1RI0LB3RB4LJ5RH|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(11,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+4}(8)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|2RK3LB2LH2RA4LB2RI_0LK3RB1LD2RA3LF5RB_3RB1LB3LC2RC4LC1LE_3RB3RE3LC2RC2RF3RD_5RB3RE4RG4LC3LG5LE_5RB1RJ1LA1LF5LF5LF_5LF4RG1LB1LG4LJ5LG_2LE2RF1LH1LH3RD5RG_1RZ4LH1LJ5LJ5LK0RC_3RB5LA1LJ1LJ4LJ5RH_1RH4RA2LK2LK0LD5RG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(12,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^\omega+1}(330)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|5LC3LB4LH2RA3LL1RZ_2LC3RB1LD2RA4RB0LC_3RB1LB3LC2RC0RL5LG_2RE2RD3LC2RC------_3RB2RE2RE4RF------_1LG1RF3LG3RF4LG1RB_2RJ0LH2LG2LI4LK---_---1LH1LG3LH4LH---_2RC1LI3LG3LI4LI---_---1RJ2RJ3RJ4RF1RA_---1LK3LE3LK------_3RB1LL1LL1LL------|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(61,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi_0(\Omega_2)}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User_blog:Wythagoras/Hydra_machines&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 7-Symbol TMs ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,7)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 155&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA_2LA6RA4RB1RZ3LB6LA4RB|halt}}&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/960643023530762341/1563057558011252761 roromachine14 in 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(3,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}(117) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|6LC3LB6RA2RA4LB5LC5LA_1RZ3RB1LC2RA3RB4LC5RA_3RB1LB3LC2RC4LC1RA6LA|halt}}&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+3}(34)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|5LC3LB6LA2RA4LB2LD3RB_1RZ3RB1LC2RA3RD2LC4LC_3RB1LB3LC2RC4LC1RA5LD_3RB5LD6LC4LD4LC4LD6LC|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(5,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(97)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|4RB3LB1RZ2RA6LD3LB5RA_2LC3RB1LD2RA4RB1LB1LC_3RB1LB3LC2RC1LE6LD1LC_6RE4LB3LC2RC6RD4LE5RA_6RD5RE1LB5LC4LD6LE5RE|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2+1}(6)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|6RD3LB6LF2RA4LB1RZ6LA_6LC3RB1LD2RA3LF4RE6LB_3RB1LB3LC2RC4LC0LE5LA_3RB2RD3LC2RC1LA3RE1LE_5RC3RE2RA4LC2LE2LE5RB_5RB3RD1LF1LF6LE5RF5LB|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+1}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|6LF3LB6LA2RA4LB5RC5LA_1RZ3RB1LD2RA3LF5RB6LD_3RB1LB3LC2RC4LC1LE5RB_3RB3RE3LC2RC0LE3RD1LA_5RB3RE2LE4LC3LG5LE1RZ_5RB5RB4RF1LF2LD5LF4RG_5LF1RZ5LB1LG2RG5LG1RZ|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+2}(8)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|6LC3LB2LH2RA4LB6LH1RZ_5RA3RB1LD2RA3LF5RB0RH_3RB1LB3LC2RC4LC1LE4LH_3RB3RE3LC2RC5RF3RD1RZ_5RB3RE4RG4LC3LG5LE1RZ_5RB5RB1RZ1LF5LF5LF1RH_5LF4RG1LB1LG5LD5LG2LH_5LA0LH1LH1LH2LH5RG1RZ|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(9,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+3}(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|2RH3LB2LH2RA4LB4RI6LH_1LH3RB1LD2RA3LF5RB3RC_3RB1LB3LC2RC4LC1LE3RD_3RB3RE3LC2RC3LC3RD3RE_5RB3RE4RG4LC3LG5LE2RA_5RB5RB6RD1LF5LF5LF6RE_5LF4RG1LB1LG6RI5LG2LH_1LF6RC1LH1LH2LH5RG5LE_1RZ5LI6LI6LI6LI5RB1RZ|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(10,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+4}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|2RH3LB2LH2RA4LB4RI6LH_4RJ3RB1LD2RA3LF5RB3RC_3RB1LB3LC2RC4LC1LE3RD_3RB3RE3LC2RC0LD3RD3RE_5RB3RE4RG4LC3LG5LE2RA_5RB1RJ1RD1LF5LF5LF1RZ_5LF4RG1LB1LG4LG5LG2LH_2RG2RF1LH1LH2LH5RG1RZ_1RZ5LJ1LI1LI1LI5RH1RZ_4LG5LA6LJ6LJ6LJ5RB1RZ|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(11,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+5}(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|2RK3LB2LH2RA4LB4RI6LH_6LJ3RB1LD2RA3LF5RB3RC_3RB1LB3LC2RC4LC1LE3RD_3RB3RE3LC2RC3RG3RD3RE_5RB3RE4RG4LC3LG5LE2RA_5RB1RJ2RA1LF5LF5LF5LH_5LF4RG1LB1LG2RF5LG2LH_2RD2RF1LH1LH2LH5RG6RF_1RZ5LJ1LI1LI1LI5RH4LK_1LA5LA6LJ6LJ6LJ5RB6RF_6LC5LH4LK4LK4LK5RD2LB|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(18,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_0}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB2LA1RA2LB2LA------_0LA2RB3RB4RA1LP------_0RZ1RC2LD------------_0LJ3RD2RD2RD4RD------_4LE1LE0RG1LR0RF2LE4LE_1LE1RF5RF---6RF------_0LH1RG2RG---4RG------_0RJ0LI------4RJ------_2LE1LI2LI---4LI------_4RO---0LE---0LJ------_2RP---2LK---4LK------_2LM---2RL3RL4RL------_4RP2RP2LM3LM4LM------_4LM---2RN3RN4RN------_3LK1LO2LO1LP4LO------_1RC3RQ1RL3LO0RN------_3LK1RQ2RQ0RQ4RQ------_1RC1LR2LR1LR4LR------|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/BB(18,7)&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(46,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi_0(\Omega_2)}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User_blog:Wythagoras/Hydra_machines&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(134,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi_0(\Omega_\omega)}(2\,050)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|LittlePeng9+Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/Analysis_of_LittlePeng9%27s_work/Hydra_machines&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 8-Symbol TMs ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|BB(2,8)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 155&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA1RZ_2LA6RA4RB7RA3LB6LA4RB4RA|halt}}&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1084047886494470185/1563070360956698804 roromachine14 in 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(3,8)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}^2(f_\omega(30))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|7LC3LB5LA2RA4LB4LC5LA6LA_1RZ3RB1LC2RA3RB4LC6LC2LC_3RB1LB3LC2RC4LC7RA6LC5RA|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,8)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+4}(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|5LC3LB7LA2RA4LB1LB4LB6LA_1RZ3RB1LC2RA3RD3RA4LC0RD_3RB1LB3LC2RC4LC7LC5LD7RA_3RB3LA6LC4LD4LC4LD6LC7LA|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(5,8)&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,8)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2+2}(11)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|5RE3LB7LF2RA4LB6LF1RZ5RF_5LE3RB1LD2RA3LF7RC3LB3RA_3RB1LB3LC2RC4LC0LE6LE5LF_3RB6RD3LC2RC5LA3RE2LE1LB_5RC3RE2RA4LC6RA5LA2LE3RE_5RB7RD1LF1LF5RA5RF5LE0RD|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,8)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+2}(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|7LD3LB6LA2RA4LB5RC5LA2LG_1RZ3RB1LD2RA3LF5RB6LD4RG_3RB1LB3LC2RC4LC1LE5RB3RF_3RB3RE3LC2RC7RB3RD1LA7LD_5RB3RE7RD4LC3LG5LE0LA1LG_5RB5RB2RA1LF2LA5LF5RD7LF_5LF3LA7LA1LG7LA5LG7RD0RG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,8)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+3}(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|6LB3LB2LH2RA4LB1RZ6LH7LH_7RG3RB1LD2RA3LF5RB3RC7LC_3RB1LB3LC2RC4LC1LE2RA4RB_3RB3RE3LC2RC6LD3RD3RB7LG_5RB3RE4RG4LC3LG5LE1RZ7LD_5RB5RB0RD1LF5LF5LF2LG7LD_5LF4RG1LB1LG7RH5LG2LH6LD_7LA7LA1LH1LH2LH5RG1RZ7RF|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(9,8)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+4}(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|5RC3LB2LH2RA4LB6RI6LH7LH_3LI3RB1LD2RA3LF5RB3RC3RC_3RB1LB3LC2RC4LC1LE2RA3RE_3RB3RE3LC2RC6LD3RD3RB1RZ_5RB3RE4RG4LC3LG5LE5LG3RF_5RB5RB2LB1LF5LF5LF1RZ2RA_5LF4RG1LB1LG0LB5LG2LH6LD_1RZ1RZ1LH1LH2LH5RG1RZ1RZ_1RZ5LI7LI7LI1RZ5RB7LI1RZ|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(10,8)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+5}(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RJ3LB2LH2RA4LB6RI6LH7LH_7LE3RB1LD2RA3LF5RB3RC3RC_3RB1LB3LC2RC4LC1LE2RA3RE_3RB3RE3LC2RC6LD3RD3RB7RB_5RB3RE4RG4LC3LG5LE6LH3RF_5RB1RJ7RI1LF5LF5LF0LD2RA_5LF4RG1LB1LG5RJ5LG2LH6LD_7RH2RF1LH1LH2LH5RG3RJ6RH_1RZ5LJ1LI1LI6LB5RH1LI5RH_4RF5LA7LJ7LJ1RZ5RB7LJ6LG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(11,8)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+6}(10)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LJ3LB2LH2RA4LB6RI6LH7LH_7RE3RB1LD2RA3LF5RB3RC3RC_3RB1LB3LC2RC4LC1LE2RA3RE_3RB3RE3LC2RC6LD3RD3RB5RB_5RB3RE4RG4LC3LG5LE3RF3RF_5RB1RJ2RA1LF5LF5LF2RH2RA_5LF4RG1LB1LG1RZ5LG2LH6LD_1RK2RF1LH1LH2LH5RG5LF5RC_1RZ5LJ1LI1LI1RZ5RH1LI6LK_2LK5LA7LJ7LJ5RD5RB7LJ5RH_2LB7LC6LK6LK0LG5RE6LK4LG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1572862196029984838 roromachine14 in Nov 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(17,8)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_0}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB2LA1RA2LB2LA---------_0LA2RB3RB4RA1LO---------_0RZ1RC2LD---------------_0LJ3RD2RD2RD4RD---------_4LE1LE0RG1LQ0RF2LE4LE---_1LE1RF5RF---6RF---------_0LH1RG2RG---4RG---------_0RJ0LI------4RJ---------_2LE1LI2LI---4LI---------_4RN---0LE---0LJ---------_2RO2RO2LK3LK4LK2LK4LK4RO_2LK---5RL3RL6RL---------_4LK---5RM3RM6RM---------_3LK1LN2LN1LO4LN---------_1RC3RP1RL3LN7RM---------_3LK1RP2RP0RP4RP---------_1RC1LQ2LQ1LQ4LQ---------|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/BB(17,8)&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 9-Symbol TMs ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|BB(2,9)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 155&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA8RA1RZ_2LA6RA4RB7RA3LB6LA4RB4RA4RA|halt}}&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1084047886494470185/1563070360956698804 roromachine14 in 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(3,9)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+2}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|7LC3LB5LA2RA4LB4LC5LA8RC6LB_1RZ3RB1LC2RA3RB4LC6LC8LC8RC_3RB1LB3LC2RC4LC8LB6LC5RB7RA|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in Nov 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(42,9)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi_0(\Omega_2)}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User_blog:Wythagoras/Hydra_machines&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Zoology ==&lt;br /&gt;
There are many types of champions.&lt;br /&gt;
&lt;br /&gt;
Note: the scale here is not formally defined. It mostly serves to estimate the average values produced by a type of champions.&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Classification&lt;br /&gt;
!Description&lt;br /&gt;
!Examples&lt;br /&gt;
!Scale&lt;br /&gt;
|-&lt;br /&gt;
|Trivial&lt;br /&gt;
|The simplest champions that can exist. They mostly appear in some BB-adjacent functions like [[Fractran|BBf]] or [[CounterScript|BBCS]].&lt;br /&gt;
|&lt;br /&gt;
* {{TM|1RZ---|halt}}&lt;br /&gt;
* {{TM|0RA_0RZ|halt}}&lt;br /&gt;
* {{TM|0RA_0RB_0RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;O(n)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|Chaotic&lt;br /&gt;
|Have a chaotic behavior with repeating patterns that go back and forth.&lt;br /&gt;
|&lt;br /&gt;
* {{TM|1RB1LB_1LA1RZ|halt}}&lt;br /&gt;
* {{TM|1RB1RZ_1LB0RC_1LC1LA|halt}}&lt;br /&gt;
* {{TM|1RB1LB_1LA0LC_1RZ1LD_1RD0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;O(2^n)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|Countdown&lt;br /&gt;
|Compute a number then &amp;quot;count down&amp;quot; (usually while bouncing) until reaching 0. They are common in some BB-adjacent functions like [[Fractran|BBf]].&lt;br /&gt;
|&lt;br /&gt;
* {{TM|1RB2LB1RZ_2LA2RB1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;O(n^2)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|Collatz-like&lt;br /&gt;
|Compute a [[Collatz-like]] function. Repeatedly multiply and add a number depending of its modulo until reaching a number with a certain modulo.&lt;br /&gt;
|&lt;br /&gt;
* {{TM|1RB2LA1RA1RA_1LB1LA3RB1RZ|halt}}&lt;br /&gt;
* {{TM|1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;O(2^n)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|Random walk&lt;br /&gt;
|Compute a [[Collatz-like]] function with a random walk.&lt;br /&gt;
|&lt;br /&gt;
|&amp;lt;math&amp;gt;O(2^{2^n})&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|Tetrational&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&amp;lt;math&amp;gt;O(2 \uparrow\uparrow n)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|Ackermannian&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&amp;lt;math&amp;gt;O(2 \uparrow^n 3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
[[Category:Zoology]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Logical_independence&amp;diff=11162</id>
		<title>Logical independence</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Logical_independence&amp;diff=11162"/>
		<updated>2026-11-19T05:51:48Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Results by Theory */ Indicate the separation between theories in the language of arithmetic and set theory which affect how TMs are encoded.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;For any recursively enumerable and arithmetically sound axiomatic theory T, there exists an integer &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; such that T cannot prove the values of BB(n) for any &amp;lt;math&amp;gt;n \ge N_T&amp;lt;/math&amp;gt;. Let &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; denote the least such integer. For [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo–Fraenkel set theory]] (ZF), this value is known to be in the range:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;6 \le N_{ZF} \le 209&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This lower bound comes from the fact that [[BB(5)]] has been proven in Rocq.&amp;lt;ref group=&amp;quot;footnote&amp;quot;&amp;gt;The fact that this theorem has been proven in Rocq technically does not imply that the theorem must be provable in ZF, because the consistency strength of Rocq is actually higher than that of ZF. However, the BB(5) proof does not use any techniques that could not be formalized within ZF.&amp;lt;/ref&amp;gt; The upper bound comes from an explicit TM which halts if and only if ZFC has a finite proof of contradiction. Assuming ZF is consistent and sound, then it cannot prove whether or not it is consistent, hence it cannot prove whether or not this specific TM halts.&lt;br /&gt;
&lt;br /&gt;
Harvey Friedman spoke of embedding consistency statements within turing machines in a [https://fomarchive.ugent.be/2004-March/008003.html 2004 posting] on the &amp;quot;Foundations of Mathematics&amp;quot; mailing list. Scott Aaronson conjectured in his [[Busy Beaver Frontier]] survey that &amp;lt;math&amp;gt;N_{ZF} \le 20&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;N_{PA} \le 10&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;PA&amp;lt;/math&amp;gt; refers to the theory of [https://en.wikipedia.org/wiki/Peano%20axioms Peano Arithmetic]. Scott also mentioned (crediting Oscar Cunningham for the observation) that if there is an n-state machine that halts if and only if T is inconsistent, then &amp;lt;math&amp;gt;PA&amp;lt;/math&amp;gt; + “BB(n) = b” can prove the consistency of T, where b is the true value of BB(n).&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;Scott Aaronson. 2020. [https://www.scottaaronson.com/papers/bb.pdf The Busy Beaver Frontier]. SIGACT News 51, 3 (August 2020), 32–54. https://doi.org/10.1145/3427361.3427369&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Results by Theory ==&lt;br /&gt;
Most normal theories form a linear ordering with respect to consistency strength. All theories in the table below follow that linear order from top to bottom. Thus for any row X below Y, &amp;lt;math&amp;gt;N_X \le N_Y&amp;lt;/math&amp;gt;. Rows are empty if no better results is known than the result inherited from a previous row.&lt;br /&gt;
&lt;br /&gt;
Note: For extremely weak theories, &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; is not well defined without defining a specific TM encoding. Technically, &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; for any theory requires fixing some TM encoding into the language of the theory. But for EFA and stronger theories, they are strong enough to prove the equivalence between all common TM encodings (ex: binary, beta-function, prime-power, MRDP), so specifying the precise encoding is generally irrelevant. Below EFA, the prime-power encoding cannot be decoded due to exponentiation not being provably total.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Language&lt;br /&gt;
! Theory&lt;br /&gt;
! Upper bound on &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; (states)&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;6&amp;quot; |Set Theory&lt;br /&gt;
| ZF+Berkeley cardinal&lt;br /&gt;
| 1399&lt;br /&gt;
|-&lt;br /&gt;
| ZF+subtle cardinal&lt;br /&gt;
| 493&lt;br /&gt;
|-&lt;br /&gt;
| Zermelo-Fraenkel set theory (ZF) / ZFC&lt;br /&gt;
| 209&lt;br /&gt;
|-&lt;br /&gt;
| New Foundations + Axiom of Counting&lt;br /&gt;
| 201&lt;br /&gt;
|-&lt;br /&gt;
| Zermelo set theory&lt;br /&gt;
| 209 (via ZF)&amp;lt;ref group=&amp;quot;footnote&amp;quot;&amp;gt;Zermelo set theory is a subtheory of ZF. For the version with Choice, the same upper bound follows from inclusion in ZFC and [[#Axiom of Choice|the equality of the ZF and ZFC thresholds]].&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| New Foundations (NF) / Mac Lane&lt;br /&gt;
| 192&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;8&amp;quot; |Arithmetic&lt;br /&gt;
| Peano arithmetic (PA)&lt;br /&gt;
| 196 (direct)&amp;lt;br /&amp;gt;192 (conditional, via NF)&amp;lt;ref group=&amp;quot;footnote&amp;quot;&amp;gt;The 196-state PA construction also gives an upper bound for every row below PA. The smaller bound uses the proposed NF-to-PA transfer discussed in [[#Peano Arithmetic (PA)|the PA section]].&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| PRA / &amp;lt;math&amp;gt;I\Sigma_1&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;\mathrm{RCA}_0&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;\mathrm{WKL}_0&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\mathrm{EA}^{+}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| EFA&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;I\Delta_0+\Omega_1&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;S_2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;T^1_2&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;S^2_2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\mathrm{PV}_1&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;S^1_2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;I\Delta_0&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Axiom of Choice ==&lt;br /&gt;
Due to [[wikipedia:Absoluteness_(logic)#Shoenfield&#039;s_absoluteness_theorem|Shoenfield&#039;s absoluteness theorem]], it is known that any TM proven non-halting in ZFC can also be proven non-halting in ZF (and the converse is trivially true), therefore&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;N_{ZFC} = N_{ZF}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Therefore we refer to ZF and &amp;lt;math&amp;gt;N_{ZF}&amp;lt;/math&amp;gt; throughout this article since adding the Axiom of Choice does not have any effect on Turing machine decidability.&lt;br /&gt;
&lt;br /&gt;
== History ==&lt;br /&gt;
In a broad sense, the concept of a mechanical or computable procedure that was equivalent to the consistency of a formal theory was discovered by Kurt Gödel&#039;s incompleteness theorem, which is notable for introducing a meta-mathematical encoding of the statement that &amp;quot;T can prove statement S&amp;quot; (the provability predicate) which is used in all these machines. This was further clarified by Alan Turing and Alonzo Church&#039;s work on a formal definition of computability.&lt;br /&gt;
&lt;br /&gt;
Although not a traditional turing machine, in 2012 Merlin Carl and Boris Z. Moroz constructed a [[Diophantine Equation]] which had solutions if and only if NBG (Von Neumann–Bernays–Gödel set theory) is inconsistent. NBG is a conservative extension of ZFC, so solving this equation is independent of ZFC.&amp;lt;ref&amp;gt;Carl, M., &amp;amp; Moroz, B. Z. (2012). &#039;&#039;On a Diophantine representation of the predicate of provability.&#039;&#039; Zapiski Nauchnykh Seminarov POMI, 407, 77-104. (Republished in 2014 in the Journal of Mathematical Sciences) [https://webdoc.sub.gwdg.de/ebook/serien/e/mpi_mathematik/2006/129.pdf (preprint)]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Zermelo–Fraenkel set theory (ZF) ==&lt;br /&gt;
There is no one authoritative source on the history of TMs independent of ZF, this is our best understanding of the history of TMs found. The results before 2026 are taken from Scott Aaronson&#039;s blog announcements and Busy Beaver Frontier or self-reported by the individuals who discovered them. The Aaronson-Yedida machine used a compiler called &#039;&#039;Laconic&#039;&#039;, which was then updated with NQL or &amp;quot;Not Quite Laconic&amp;quot;, while the 432 machines use a compiler built by Andrew J. Wade. Many machines after 2026 have been generated by AI without a formal compiler.&lt;br /&gt;
&lt;br /&gt;
Note that only the results with a linked formal verification are known to have such a verification, with the 7910 machine in particular relying on a result from Harvey Friedman that has no published proof.&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of ZF independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|7910&lt;br /&gt;
|May 2016&lt;br /&gt;
|Adam Yedidia and Scott Aaronson&lt;br /&gt;
|Yedidia and Aaronson 2016&amp;lt;ref&amp;gt;A. Yedidia and S. Aaronson. A relatively small Turing machine whose behavior is independent of set theory. Complex Systems, (25):4, 2016. https://arxiv.org/abs/1605.04343&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|1919&lt;br /&gt;
|15 May 2016&lt;br /&gt;
|Stefan O&#039;Rear&lt;br /&gt;
|[https://github.com/sorear/metamath-turing-machines/blob/master/machines/2016-zf-sorear-1919/zf.nql Github NQL file], [https://groups.google.com/g/metamath/c/OumBq83Ksqs/m/FogyOlLIBwAJ Metamath Group Announcement]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|748&lt;br /&gt;
|May 2016&lt;br /&gt;
|Stefan O’Rear&lt;br /&gt;
|[https://github.com/sorear/metamath-turing-machines/blob/master/machines/2017-zf-sorear-748/zf2.nql Github NQL], Busy Beaver Frontier&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|745&lt;br /&gt;
|July 2023&lt;br /&gt;
|Johannes Riebel&lt;br /&gt;
|Riebel 2023 Bachelor Thesis&amp;lt;ref&amp;gt;Riebel, Johannes (March 2023). &#039;&#039;[https://www.ingo-blechschmidt.eu/assets/bachelor-thesis-undecidability-bb748.pdf The Undecidability of BB(748): Understanding Gödel&#039;s Incompleteness Theorems]&#039;&#039; (PDF) (Bachelor&#039;s thesis). University of Augsburg.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|643&lt;br /&gt;
|July 2024&lt;br /&gt;
|Rohan Ridenour&lt;br /&gt;
|[https://github.com/CatsAreFluffy/metamath-turing-machines Github NQL], [https://scottaaronson.blog/?p=8131 Aaronson Announcement]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|636&lt;br /&gt;
|31 August 2024&lt;br /&gt;
|Rohan Ridenour&lt;br /&gt;
|[https://github.com/CatsAreFluffy/metamath-turing-machines Github NQL] ([https://github.com/CatsAreFluffy/metamath-turing-machines/commit/6fc33bef6ba8885d26aed94c83e88bdabbedb0f1 commit])&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|588&lt;br /&gt;
|12 July 2025&lt;br /&gt;
|Andrew J. Wade&lt;br /&gt;
|[https://github.com/andrew-j-wade/metamath-turing-machines Github NQL] ([https://github.com/andrew-j-wade/metamath-turing-machines/commit/30d2e3194866615f68dd2f5101cb300fb039adca commit])&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|549&lt;br /&gt;
|16 July 2025&lt;br /&gt;
|Andrew J. Wade&lt;br /&gt;
|[https://github.com/andrew-j-wade/metamath-turing-machines Github NQL] ([https://github.com/andrew-j-wade/metamath-turing-machines/commit/5d676aec074a94f598959cb3b7733a8f7781762f commit])&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|432&lt;br /&gt;
|19 Aug 2025&lt;br /&gt;
|Andrew J. Wade&lt;br /&gt;
|[https://codeberg.org/ajwade/turing_machine_explorer/commit/33b30300054242201a95679aacf7e74312bd8803b0df9a85d2314095efd6804e git commit]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|335&lt;br /&gt;
|11 Oct 2026&lt;br /&gt;
|Jeff Ketchersid&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1559077555158392844 discord message]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|254&lt;br /&gt;
|13 Oct 2026&lt;br /&gt;
|[https://x.com/_mira___mira_ Mira] with use of ChatGPT, formalized by [https://github.com/jeff87654 Jeff Ketchersid] with Claude&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/zf-254/ZF/m254 Github]&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/zf-254/ZF/m254 Rocq file]&lt;br /&gt;
|-&lt;br /&gt;
|230&lt;br /&gt;
|19 Oct 2026&lt;br /&gt;
|[https://x.com/ElliotGlazer Elliot Glazer] with use of ChatGPT, formalized with GPT and Claude&lt;br /&gt;
|[https://github.com/elliotglazer/k230-rocq Github]&lt;br /&gt;
|[https://github.com/elliotglazer/k230-rocq Rocq file]&lt;br /&gt;
|-&lt;br /&gt;
|215&lt;br /&gt;
|21 Oct 2026&lt;br /&gt;
|[[wikipedia:Cleo_(mathematician)|Vladimir Reshetnikov]] formalized with Claude&lt;br /&gt;
|[https://github.com/VladimirReshetnikov/ProveIt/tree/c9dc79323429112c698100f3226a6e4d56c8b782/Computability/BusyBeaver/Research/ZFC/k225-formal Github]&lt;br /&gt;
|[https://github.com/VladimirReshetnikov/ProveIt/tree/c9dc79323429112c698100f3226a6e4d56c8b782/Computability/BusyBeaver/Research/ZFC/k225-formal/verification/k215 Rocq file]&lt;br /&gt;
|-&lt;br /&gt;
|209&lt;br /&gt;
|12 Nov 2026&lt;br /&gt;
|James Chang formalized with ChatGPT&lt;br /&gt;
|[https://github.com/jamesyc/BusyBeaver/commit/286324f9ad106bbeab32b70404e7a82be2cd660d Github]([https://discord.com/channels/960643023006490684/960643023530762341/1570618968060858439 discord message])&lt;br /&gt;
|[https://github.com/jamesyc/BusyBeaver/tree/main/ZF209/ProofSources Lean]&lt;br /&gt;
|-&lt;br /&gt;
|211&lt;br /&gt;
|17 Nov 2026&lt;br /&gt;
|Shivam Patel&lt;br /&gt;
|[[Media:K211-paper.pdf|Paper]]&lt;br /&gt;
|[[Media:K211-review-by-email.zip|Lean proof and replay]]&lt;br /&gt;
|}&lt;br /&gt;
[[File:ZFC Machine 254.png|thumb|The transition table of the ZF machine with 254 states. The initial state is 1.]]&lt;br /&gt;
Wade&#039;s 432-state champion also omits the [[wikipedia:Axiom_of_regularity|axiom of regularity]], as ZF-regularity is also equiconsistent with ZF.&lt;br /&gt;
&lt;br /&gt;
== New Foundations (NF) ==&lt;br /&gt;
&#039;&#039;New Foundations&#039;&#039; is a formal theory created by W.V.O. Quine in 1937, based around the principle of stratified comprehension of sets. It is known to be stronger than Peano Arithmetic and second-order arithmetic, but weaker than ZF. The Github page contains a proof in Lean that it is equiconsistent with Mac Lane set theory, which is a novel result as of the time of writing (November 2026). Mac Lane set theory is far more mainstream than NF, so the following machine could be seen as an efficient way of determining which Busy Beaver value MAC cannot verify.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of New Foundations (NF) independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|210&lt;br /&gt;
|8 November 2026&lt;br /&gt;
|@wlad-svennik&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/wlad-svennik/notes/tree/main/nf-bb210]&lt;br /&gt;
|-&lt;br /&gt;
|198&lt;br /&gt;
|12 November 2026&lt;br /&gt;
|@wlad-svennik&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/wlad-svennik/notes/commit/0a0c8fa5992dfdee35f18fcb718ec278378b2740]&lt;br /&gt;
|-&lt;br /&gt;
|192&lt;br /&gt;
|16 November 2026&lt;br /&gt;
|@wlad-svennik&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/wlad-svennik/notes/releases/tag/nf192-countdown]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== User-friendly theory ===&lt;br /&gt;
&lt;br /&gt;
The TM searches for an inconsistency in the theory &amp;quot;&#039;&#039;&#039;FunctionNF&#039;&#039;&#039;&amp;quot;. It is defined to equal stratified λ-calculus minus pairing, minus case-expressions, plus full functional extensionality, plus an equality checker.&amp;lt;pre&amp;gt;Terms     t ::= x | t u | λx.t | (s ≐ t) | ⊤ | ⊥&lt;br /&gt;
&lt;br /&gt;
Depth     Each subterm occurrence has a depth relative to the term it sits in:&lt;br /&gt;
            the term itself        0&lt;br /&gt;
            in  t u   at depth n:  t at n+1,  u at n&lt;br /&gt;
            in  λx.t  at depth n:  t at n−1&lt;br /&gt;
            in  s ≐ t at depth n:  s and t at n&lt;br /&gt;
&lt;br /&gt;
Formation λx.t is a term iff every free occurrence of x in t has depth 0 in t.&lt;br /&gt;
          Nothing else is constrained: other variables may occur at any depths.&lt;br /&gt;
&lt;br /&gt;
Axioms    (β)    (λx.t) u = t[u/x]&lt;br /&gt;
          (ext)  (∀x. f x = g x) → f = g&lt;br /&gt;
          (≐)    s = t → (s ≐ t) = ⊤        s ≠ t → (s ≐ t) = ⊥&lt;br /&gt;
          (nt)   ⊤ ≠ ⊥&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The logic is ordinary first-order logic with equality, so unstratified &#039;&#039;formulas&#039;&#039; are allowed. Only λ is restricted.&lt;br /&gt;
&lt;br /&gt;
It&#039;s not obvious, but the above suffices to prove the &#039;&#039;Axiom of Infinity&#039;&#039;, i.e. that the set of natural numbers exists and has all of its expected properties. It&#039;s then possible to define the set of real numbers in any of the usual ways, and do nearly all of extant mathematics.&lt;br /&gt;
&lt;br /&gt;
=== NF vs Mac Lane vs other set theories ===&lt;br /&gt;
The Github link contains proofs in Lean that:&lt;br /&gt;
&lt;br /&gt;
* NF interprets FunctionNF (which is very short),&lt;br /&gt;
* FunctionNF in turn interprets NFU+Infinity (which is similar to Specker&#039;s proof of the &amp;quot;Axiom of Infinity&amp;quot; within NF),&lt;br /&gt;
* NFU+Infinity interprets NF, which is a novel and hard result that is not yet found in the literature,&lt;br /&gt;
* NFU+Infinity interprets Mac Lane set theory,&lt;br /&gt;
* Mac Lane set theory interprets TSTI (Theory of Simple Types plus (Axiom of) Infinity),&lt;br /&gt;
* TSTI is equiconsistent with NFU+Infinity.&lt;br /&gt;
&lt;br /&gt;
So overall, the machine halts iff there exists an inconsistency in &#039;&#039;any&#039;&#039; of the above theories. Regardless, Mac Lane set theory is actually &#039;&#039;weaker&#039;&#039; than NF in terms of &#039;&#039;intepretability strength&#039;&#039;, as opposed to just consistency strength.&lt;br /&gt;
&lt;br /&gt;
If we add the &#039;&#039;Axiom of Counting&#039;&#039; (AxCount) to NF, which is the rather tautological-looking axiom&amp;lt;blockquote&amp;gt;&amp;lt;nowiki&amp;gt;For any finite set S, |S| = |{{x}&amp;lt;/nowiki&amp;gt; : x ∈ S}|      (i.e. the number of elements of S doesn&#039;t change when you replace each element x with the singleton {x})&amp;lt;/blockquote&amp;gt;then it&#039;s sufficient to prove Con(Z). As of the time of this writing (November 2026) we&#039;ve used this to obtain a machine that is smaller (201 states) than any machine of Zermelo-strength or above.&lt;br /&gt;
&lt;br /&gt;
ZFC can prove Con(NF + AxCount).&lt;br /&gt;
&lt;br /&gt;
=== Implementation theory: The combinatory calculus ===&lt;br /&gt;
FunctionalNF is not implemented directly. Instead, a massively leaner form is implemented, in the form of a [https://en.wikipedia.org/wiki/combinatory_logic combinatory logic] which consists of just three nonlogical primitives:&lt;br /&gt;
&lt;br /&gt;
* Binary application &amp;lt;math&amp;gt;xy&amp;lt;/math&amp;gt;, associated to the left.&lt;br /&gt;
* A constant &amp;lt;math&amp;gt;q&amp;lt;/math&amp;gt;. This is a fixed-point tester.&lt;br /&gt;
* A binary function &amp;lt;math&amp;gt;H(x,y)&amp;lt;/math&amp;gt;. This is a merger between the &#039;&#039;K&#039;&#039; combinator and a [https://en.wikipedia.org/wiki/skolem_function Skolem function] for function extensionality.&lt;br /&gt;
&lt;br /&gt;
Define the convenient shorthands&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\begin{aligned}&lt;br /&gt;
K(x)&amp;amp;:=H(x,x),\\&lt;br /&gt;
r&amp;amp;:=(qq)q,\\&lt;br /&gt;
b&amp;amp;:=(q(qq))r.&lt;br /&gt;
\end{aligned}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The six axioms, with all free variables universally quantified, are:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! No.&lt;br /&gt;
! Axiom&lt;br /&gt;
! Role&lt;br /&gt;
|-&lt;br /&gt;
| 1&lt;br /&gt;
| &amp;lt;math&amp;gt;H(x,x)y=x&amp;lt;/math&amp;gt;&lt;br /&gt;
| Constant functions&lt;br /&gt;
|-&lt;br /&gt;
| 2&lt;br /&gt;
| &amp;lt;math&amp;gt;bxyz=(xH(z,z))(yz)&amp;lt;/math&amp;gt;&lt;br /&gt;
| Combinatory composition&lt;br /&gt;
|-&lt;br /&gt;
| 3&lt;br /&gt;
| &amp;lt;math&amp;gt;xy=y\implies(qx)y=b&amp;lt;/math&amp;gt;&lt;br /&gt;
| Positive equality test&lt;br /&gt;
|-&lt;br /&gt;
| 4&lt;br /&gt;
| &amp;lt;math&amp;gt;xy\ne y\implies(qx)y=r&amp;lt;/math&amp;gt;&lt;br /&gt;
| Negative equality test&lt;br /&gt;
|-&lt;br /&gt;
| 5&lt;br /&gt;
| &amp;lt;math&amp;gt;xH(x,y)=yH(x,y)\implies x=y&amp;lt;/math&amp;gt;&lt;br /&gt;
| Extensionality witness&lt;br /&gt;
|-&lt;br /&gt;
| 6&lt;br /&gt;
| &amp;lt;math&amp;gt;q(qq)\ne qq&amp;lt;/math&amp;gt;&lt;br /&gt;
| Nondegeneracy&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
In particular, &amp;lt;math&amp;gt;K(x)y=x&amp;lt;/math&amp;gt; follows immediately from axiom 1. It is not a separate axiom.&lt;br /&gt;
&lt;br /&gt;
=== Fragment of First-Order Logic ===&lt;br /&gt;
Notably, we &#039;&#039;&#039;do not&#039;&#039;&#039; implement the whole of First-Order Logic: The quantifier ∀ can be defined &#039;&#039;internally&#039;&#039; to CombNF / FunctionalNF. Moreover, we don&#039;t even implement variables thanks to our use of combinatory logic. The only fragment of First-Order Logic we do implement consists of &amp;quot;=&amp;quot;, the above function symbols, and propositional logic. This is similar to [https://en.wikipedia.org/wiki/primitive_recursive_arithmetic Primitive Recursive Arithmetic] and [https://en.wikipedia.org/wiki/system_T System T].&lt;br /&gt;
&lt;br /&gt;
Observe that:&amp;lt;blockquote&amp;gt;∀ := λP.(P ≐ λx.⊤)&lt;br /&gt;
&lt;br /&gt;
¬ := λp.(p ≐ ⊥)&lt;br /&gt;
&lt;br /&gt;
∃ := λP. ¬ (∀ λx. ¬ (P x))&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== What the symbols do ===&lt;br /&gt;
&amp;lt;math&amp;gt;q&amp;lt;/math&amp;gt; is an equality tester:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;(qx)y=&lt;br /&gt;
\begin{cases}&lt;br /&gt;
b,&amp;amp;xy=y,\\&lt;br /&gt;
r,&amp;amp;xy\ne y.&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;H&amp;lt;/math&amp;gt; has two jobs. On the diagonal it constructs constant functions:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;H(x,x)y=x.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Off the diagonal it supplies a witness to distinguish two functions whenever they are different:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;x\ne y\implies xH(x,y)\ne yH(x,y).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; supplies the composition law&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;bxyz=x(K(z))(yz).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt; are terms, not primitive constants.&lt;br /&gt;
&lt;br /&gt;
Once again, we do &#039;&#039;&#039;not&#039;&#039;&#039; implement the whole of First-Order Logic.&lt;br /&gt;
&lt;br /&gt;
The formalized proof for this machine&#039;s NF-undecidability is formalized as an &#039;&#039;external&#039;&#039; Lean metatheorem rather than a completed PA-internal derivation. As of this publication, a fresh independent clean build and community review have not been reported.&lt;br /&gt;
&lt;br /&gt;
== Peano Arithmetic (PA) ==&lt;br /&gt;
The ZF bound applies to PA because ZF proves the arithmetical theorems of PA. In turn, a proof of an exact Busy Beaver value in any theory listed below PA would give a PA proof of that same value. For &amp;lt;math&amp;gt;n \ge 196&amp;lt;/math&amp;gt;, a proof of &amp;lt;math&amp;gt;BB(n)=b&amp;lt;/math&amp;gt; would let PA decide whether the 196-state machine halts by padding it to &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; states and checking its first &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of Peano Arithmetic (PA) independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|372&lt;br /&gt;
|11 February 2026&lt;br /&gt;
|@LegionMammal978 (Matthew House)&lt;br /&gt;
|[https://github.com/LegionMammal978/turing_machine_explorer/blob/main/pa.py Github]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|196&lt;br /&gt;
|12 Nov 2026&lt;br /&gt;
|James Chang formalized with ChatGPT&lt;br /&gt;
|[https://github.com/jamesyc/BusyBeaver/commit/64ff1b3047b951b25129d4ab897ccf1728b66dbf Github]&lt;br /&gt;
|[https://github.com/jamesyc/BusyBeaver/tree/main/PA196/ProofSources Lean]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
This machine takes Wade&#039;s ZF champion and replaces the set theory axioms with one axiom schema of &amp;quot;adjunction + separation&amp;quot;, which has been shown to interpret PA.&amp;lt;ref&amp;gt;https://mathoverflow.net/questions/508137/interpreting-pa-with-only-adjunction-separation/508161&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The 192-state entries use the proposed transfer of the NF result to PA under the assumption that Mac Lane set theory is consistent. The published Lean theorem establishes in the metatheory that the machine halts exactly when NF proves a contradiction.&amp;lt;ref&amp;gt;[https://github.com/wlad-svennik/notes/releases/tag/nf192-countdown New Foundations: 192-state countdown machine and Lean verification], release notes.&amp;lt;/ref&amp;gt; To obtain the 192-state bound for PA, one also needs to show that PA cannot prove this particular machine runs forever. For example, it would suffice to derive in PA that its nonhalting implies the consistency of PA, and then apply Gödel&#039;s second incompleteness theorem. The separate 196-state construction directly establishes that PA proves neither halting nor nonhalting for its machine.&amp;lt;ref&amp;gt;James Chang, [https://github.com/jamesyc/BusyBeaver/commit/64ff1b3047b951b25129d4ab897ccf1728b66dbf PA196 proof package].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Weaker arithmetical theories ===&lt;br /&gt;
Even &amp;lt;math&amp;gt;R_0&amp;lt;/math&amp;gt;, a proper subtheory of Tarski–Mostowski–Robinson &amp;lt;math&amp;gt;R&amp;lt;/math&amp;gt;, proves every true individual halting assertion because it proves all true &amp;lt;math&amp;gt;\Sigma_1&amp;lt;/math&amp;gt; sentences in the usual language of arithmetic.&amp;lt;ref&amp;gt;Taishi Kurahashi and Albert Visser, [https://doi.org/10.1017/jsl.2024.84 Certified Σ₁-Sentences], §2, Theorem 2.3.&amp;lt;/ref&amp;gt; Between Robinson arithmetic &amp;lt;math&amp;gt;Q&amp;lt;/math&amp;gt; and bounded induction &amp;lt;math&amp;gt;I\Delta_0&amp;lt;/math&amp;gt; lie &amp;lt;math&amp;gt;\mathrm{PA}^{-}&amp;lt;/math&amp;gt;, the theory of discretely ordered semirings, and &amp;lt;math&amp;gt;\mathrm{IOpen}&amp;lt;/math&amp;gt;, which adds induction for quantifier-free formulas.&amp;lt;ref&amp;gt;Kazuyuki Tanaka, [https://hep.tsinghua.edu.cn/~liwj/AU2024-lec03-08.pdf Logic and Computation I, Part 3a. Formal Arithmetic], Corollary 3.43.&amp;lt;/ref&amp;gt; Further up, &amp;lt;math&amp;gt;\mathrm{EA}^{+}&amp;lt;/math&amp;gt; adds total superexponentiation to EFA. It proves the consistency of &amp;lt;math&amp;gt;I\Delta_0&amp;lt;/math&amp;gt;, which EFA cannot prove.&amp;lt;ref&amp;gt;Samuel R. Buss, [https://mathweb.ucsd.edu/~sbuss/ResearchWeb/handbookII/ChapterII.pdf First-Order Proof Theory of Arithmetic], §4.3.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Theories grouped in one arithmetic row have the same Busy Beaver threshold. For fixed standard &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt;, a counterexample to &amp;lt;math&amp;gt;BB(n)\le b&amp;lt;/math&amp;gt; is a halting computation of an &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;-state machine lasting more than &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; steps. A proposed computation can be checked in polynomial time in the length of its complete history. When &amp;lt;math&amp;gt;BB(n)=b&amp;lt;/math&amp;gt; is true, a particular halting run witnesses the matching lower bound.&lt;br /&gt;
&lt;br /&gt;
With this explicit history coding, &amp;lt;math&amp;gt;\mathrm{PV}_1&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;S^1_2&amp;lt;/math&amp;gt; agree on the universal equations expressing the upper bounds. Full bounded arithmetic &amp;lt;math&amp;gt;S_2&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;I\Delta_0+\Omega_1&amp;lt;/math&amp;gt; agree on sentences in their common arithmetical language.&amp;lt;ref&amp;gt;Jan Krajíček, [https://www.karlin.mff.cuni.cz/~krajicek/kniha.pdf Bounded Arithmetic, Propositional Logic, and Complexity Theory], Lemma 5.2.15 and Theorem 5.3.4.&amp;lt;/ref&amp;gt; Buss&#039;s conservation theorem similarly gives &amp;lt;math&amp;gt;T^1_2&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;S^2_2&amp;lt;/math&amp;gt; the same provable upper bounds.&amp;lt;ref&amp;gt;Samuel R. Buss, [https://mathweb.ucsd.edu/~sbuss/ResearchWeb/BAaxioms/camera.pdf Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic].&amp;lt;/ref&amp;gt; Finally, &amp;lt;math&amp;gt;I\Sigma_1&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\mathrm{RCA}_0&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\mathrm{WKL}_0&amp;lt;/math&amp;gt; agree with PRA on &amp;lt;math&amp;gt;\Pi^0_2&amp;lt;/math&amp;gt; arithmetic sentences, which suffices for all four to share a threshold.&amp;lt;ref&amp;gt;Jeremy Avigad, [https://www.andrew.cmu.edu/user/avigad/Papers/omegasubmodels.pdf Notes on Π¹₁-conservativity, ω-submodels, and the collection schema], §2.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Large cardinals ==&lt;br /&gt;
These tables are for theories stronger than ZFC.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of ZFC + &amp;quot;There exist arbitrarily large subtle cardinals&amp;quot; independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|493&lt;br /&gt;
|25 February 2026&lt;br /&gt;
|@LegionMammal978&lt;br /&gt;
|[https://github.com/Saoi2/turing_machine_explorer/blob/main/subtle.tm Github]&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
This machine takes Wade&#039;s ZF champion and adds the [[wikipedia:Axiom_of_choice|axiom of Choice]] and a statement from Harvey Friedman (Proposition 4.3 of [https://bpb-us-w2.wpmucdn.com/u.osu.edu/dist/1/1952/files/2014/01/PrimitiveIndResults071302-189vmn0.pdf &amp;quot;Primitive Independence Results&amp;quot;])&amp;lt;ref&amp;gt;H. Friedman, &amp;quot;[https://bpb-us-w2.wpmucdn.com/u.osu.edu/dist/1/1952/files/2014/01/PrimitiveIndResults071302-189vmn0.pdf Primitive Independence Results]&amp;quot; (2002). Accessed February 2026.&amp;lt;/ref&amp;gt; which Friedman showed to be equivalent to &amp;quot;There exist arbitrarily large subtle cardinals&amp;quot; over ZFC.&lt;br /&gt;
&lt;br /&gt;
For reference, this theory is between the strength of &amp;quot;strongly unfoldable&amp;quot; and &amp;quot;&amp;lt;math&amp;gt;0^\sharp&amp;lt;/math&amp;gt; exists&amp;quot; on the [[wikipedia:Large_cardinal|large cardinal hierarchy]] on Wikipedia.&lt;br /&gt;
&lt;br /&gt;
Note: The initial machine produced in 2016 by Yedidia and Aaronson is designed to halt iff a certain statement created by Harvey Friedman is true.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt; According to Friedman (without a published proof), this statement is independent of the theory &amp;quot;Stationary Ramsey Property&amp;quot; or &#039;&#039;SRP&#039;&#039;, which is equiconsistent with the theory &amp;lt;math&amp;gt;ZFC + \{\text{``There is a }k\text{-subtle cardinal``}\mid k\in\N\}&amp;lt;/math&amp;gt; which is also between the strength of &amp;quot;strongly unfoldable&amp;quot; and &amp;quot;&amp;lt;math&amp;gt;0^\sharp&amp;lt;/math&amp;gt; exists&amp;quot; on the large cardinal hierarchy.&amp;lt;ref&amp;gt;tlonuqbar, &amp;quot;[https://mathoverflow.net/questions/508364/what-is-the-consistency-strength-of-srp-stationary-ramsey-property What is the consistency strength of SRP (Stationary Ramsey Property)?]&amp;quot; (2026). MathOverflow post, accessed February 2026.&amp;lt;/ref&amp;gt; However, the theory used by the BB(493) machine is also independent of this theory.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of ZF + &amp;quot;There exists a Berkeley cardinal&amp;quot; independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|1399&lt;br /&gt;
|8 November 2026&lt;br /&gt;
|@Meganeuridae&lt;br /&gt;
|[https://github.com/Meganeuridae/large-cardinal-tms/blob/main/berkeley-rocq/machine/machine.tm Github]&lt;br /&gt;
|[https://github.com/Meganeuridae/large-cardinal-tms/tree/main/berkeley-rocq/coq/Berkeley Rocq file]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
Berkeley cardinals are perhaps the strongest family of large cardinals considered, initially proposed by Hugh Woodin at a lecture at UC Berkeley as an axiom that was &amp;quot;obviously inconsistent&amp;quot;.{{Citation needed}} However, no inconsistency has been found and many people now believe it may be consistent. Berkeley cardinals are known to be inconsistent with the axiom of choice.&lt;br /&gt;
&lt;br /&gt;
== Footnotes ==&lt;br /&gt;
&amp;lt;references group=&amp;quot;footnote&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Zoology]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Logical_independence&amp;diff=11161</id>
		<title>Logical independence</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Logical_independence&amp;diff=11161"/>
		<updated>2026-11-19T05:44:09Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Results by Theory */ Note issue with extremely weak theories and need for precise encoding function. Delete everything below I \Delta 0 since it seems like below the answer is extremely sensitive to encoding.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;For any recursively enumerable and arithmetically sound axiomatic theory T, there exists an integer &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; such that T cannot prove the values of BB(n) for any &amp;lt;math&amp;gt;n \ge N_T&amp;lt;/math&amp;gt;. Let &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; denote the least such integer. For [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo–Fraenkel set theory]] (ZF), this value is known to be in the range:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;6 \le N_{ZF} \le 209&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This lower bound comes from the fact that [[BB(5)]] has been proven in Rocq.&amp;lt;ref group=&amp;quot;footnote&amp;quot;&amp;gt;The fact that this theorem has been proven in Rocq technically does not imply that the theorem must be provable in ZF, because the consistency strength of Rocq is actually higher than that of ZF. However, the BB(5) proof does not use any techniques that could not be formalized within ZF.&amp;lt;/ref&amp;gt; The upper bound comes from an explicit TM which halts if and only if ZFC has a finite proof of contradiction. Assuming ZF is consistent and sound, then it cannot prove whether or not it is consistent, hence it cannot prove whether or not this specific TM halts.&lt;br /&gt;
&lt;br /&gt;
Harvey Friedman spoke of embedding consistency statements within turing machines in a [https://fomarchive.ugent.be/2004-March/008003.html 2004 posting] on the &amp;quot;Foundations of Mathematics&amp;quot; mailing list. Scott Aaronson conjectured in his [[Busy Beaver Frontier]] survey that &amp;lt;math&amp;gt;N_{ZF} \le 20&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;N_{PA} \le 10&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;PA&amp;lt;/math&amp;gt; refers to the theory of [https://en.wikipedia.org/wiki/Peano%20axioms Peano Arithmetic]. Scott also mentioned (crediting Oscar Cunningham for the observation) that if there is an n-state machine that halts if and only if T is inconsistent, then &amp;lt;math&amp;gt;PA&amp;lt;/math&amp;gt; + “BB(n) = b” can prove the consistency of T, where b is the true value of BB(n).&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;Scott Aaronson. 2020. [https://www.scottaaronson.com/papers/bb.pdf The Busy Beaver Frontier]. SIGACT News 51, 3 (August 2020), 32–54. https://doi.org/10.1145/3427361.3427369&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Results by Theory ==&lt;br /&gt;
Most normal theories form a linear ordering with respect to consistency strength. All theories in the table below follow that linear order from top to bottom. Thus for any row X below Y, &amp;lt;math&amp;gt;N_X \le N_Y&amp;lt;/math&amp;gt;. Rows are empty if no better results is known than the result inherited from a previous row.&lt;br /&gt;
&lt;br /&gt;
Note: For extremely weak theories, &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; is not well defined without defining a specific TM encoding. Technically, &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; for any theory requires fixing some TM encoding into the language of the theory. But for EFA and stronger theories, they are strong enough to prove the equivalence between all common TM encodings (ex: binary, beta-function, prime-power, MRDP), so specifying the precise encoding is generally irrelevant. Below EFA, the prime-power encoding cannot be decoded due to exponentiation not being provably total.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! Theory&lt;br /&gt;
! Upper bound on &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; (states)&lt;br /&gt;
|-&lt;br /&gt;
| ZF+Berkeley cardinal&lt;br /&gt;
| 1399&lt;br /&gt;
|-&lt;br /&gt;
| ZF+subtle cardinal&lt;br /&gt;
| 493&lt;br /&gt;
|-&lt;br /&gt;
| Zermelo-Fraenkel set theory (ZF) / ZFC&lt;br /&gt;
| 209&lt;br /&gt;
|-&lt;br /&gt;
| New Foundations + Axiom of Counting&lt;br /&gt;
| 201&lt;br /&gt;
|-&lt;br /&gt;
| Zermelo set theory&lt;br /&gt;
| 209 (via ZF)&amp;lt;ref group=&amp;quot;footnote&amp;quot;&amp;gt;Zermelo set theory is a subtheory of ZF. For the version with Choice, the same upper bound follows from inclusion in ZFC and [[#Axiom of Choice|the equality of the ZF and ZFC thresholds]].&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| New Foundations (NF) / Mac Lane&lt;br /&gt;
| 192&lt;br /&gt;
|-&lt;br /&gt;
| Peano arithmetic (PA)&lt;br /&gt;
| 196 (direct)&amp;lt;br /&amp;gt;192 (conditional, via NF)&amp;lt;ref group=&amp;quot;footnote&amp;quot;&amp;gt;The 196-state PA construction also gives an upper bound for every row below PA. The smaller bound uses the proposed NF-to-PA transfer discussed in [[#Peano Arithmetic (PA)|the PA section]].&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| PRA / &amp;lt;math&amp;gt;I\Sigma_1&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;\mathrm{RCA}_0&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;\mathrm{WKL}_0&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\mathrm{EA}^{+}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| EFA&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;I\Delta_0+\Omega_1&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;S_2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;T^1_2&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;S^2_2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\mathrm{PV}_1&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;S^1_2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;I\Delta_0&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Axiom of Choice ==&lt;br /&gt;
Due to [[wikipedia:Absoluteness_(logic)#Shoenfield&#039;s_absoluteness_theorem|Shoenfield&#039;s absoluteness theorem]], it is known that any TM proven non-halting in ZFC can also be proven non-halting in ZF (and the converse is trivially true), therefore&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;N_{ZFC} = N_{ZF}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Therefore we refer to ZF and &amp;lt;math&amp;gt;N_{ZF}&amp;lt;/math&amp;gt; throughout this article since adding the Axiom of Choice does not have any effect on Turing machine decidability.&lt;br /&gt;
&lt;br /&gt;
== History ==&lt;br /&gt;
In a broad sense, the concept of a mechanical or computable procedure that was equivalent to the consistency of a formal theory was discovered by Kurt Gödel&#039;s incompleteness theorem, which is notable for introducing a meta-mathematical encoding of the statement that &amp;quot;T can prove statement S&amp;quot; (the provability predicate) which is used in all these machines. This was further clarified by Alan Turing and Alonzo Church&#039;s work on a formal definition of computability.&lt;br /&gt;
&lt;br /&gt;
Although not a traditional turing machine, in 2012 Merlin Carl and Boris Z. Moroz constructed a [[Diophantine Equation]] which had solutions if and only if NBG (Von Neumann–Bernays–Gödel set theory) is inconsistent. NBG is a conservative extension of ZFC, so solving this equation is independent of ZFC.&amp;lt;ref&amp;gt;Carl, M., &amp;amp; Moroz, B. Z. (2012). &#039;&#039;On a Diophantine representation of the predicate of provability.&#039;&#039; Zapiski Nauchnykh Seminarov POMI, 407, 77-104. (Republished in 2014 in the Journal of Mathematical Sciences) [https://webdoc.sub.gwdg.de/ebook/serien/e/mpi_mathematik/2006/129.pdf (preprint)]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Zermelo–Fraenkel set theory (ZF) ==&lt;br /&gt;
There is no one authoritative source on the history of TMs independent of ZF, this is our best understanding of the history of TMs found. The results before 2026 are taken from Scott Aaronson&#039;s blog announcements and Busy Beaver Frontier or self-reported by the individuals who discovered them. The Aaronson-Yedida machine used a compiler called &#039;&#039;Laconic&#039;&#039;, which was then updated with NQL or &amp;quot;Not Quite Laconic&amp;quot;, while the 432 machines use a compiler built by Andrew J. Wade. Many machines after 2026 have been generated by AI without a formal compiler.&lt;br /&gt;
&lt;br /&gt;
Note that only the results with a linked formal verification are known to have such a verification, with the 7910 machine in particular relying on a result from Harvey Friedman that has no published proof.&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of ZF independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|7910&lt;br /&gt;
|May 2016&lt;br /&gt;
|Adam Yedidia and Scott Aaronson&lt;br /&gt;
|Yedidia and Aaronson 2016&amp;lt;ref&amp;gt;A. Yedidia and S. Aaronson. A relatively small Turing machine whose behavior is independent of set theory. Complex Systems, (25):4, 2016. https://arxiv.org/abs/1605.04343&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|1919&lt;br /&gt;
|15 May 2016&lt;br /&gt;
|Stefan O&#039;Rear&lt;br /&gt;
|[https://github.com/sorear/metamath-turing-machines/blob/master/machines/2016-zf-sorear-1919/zf.nql Github NQL file], [https://groups.google.com/g/metamath/c/OumBq83Ksqs/m/FogyOlLIBwAJ Metamath Group Announcement]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|748&lt;br /&gt;
|May 2016&lt;br /&gt;
|Stefan O’Rear&lt;br /&gt;
|[https://github.com/sorear/metamath-turing-machines/blob/master/machines/2017-zf-sorear-748/zf2.nql Github NQL], Busy Beaver Frontier&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|745&lt;br /&gt;
|July 2023&lt;br /&gt;
|Johannes Riebel&lt;br /&gt;
|Riebel 2023 Bachelor Thesis&amp;lt;ref&amp;gt;Riebel, Johannes (March 2023). &#039;&#039;[https://www.ingo-blechschmidt.eu/assets/bachelor-thesis-undecidability-bb748.pdf The Undecidability of BB(748): Understanding Gödel&#039;s Incompleteness Theorems]&#039;&#039; (PDF) (Bachelor&#039;s thesis). University of Augsburg.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|643&lt;br /&gt;
|July 2024&lt;br /&gt;
|Rohan Ridenour&lt;br /&gt;
|[https://github.com/CatsAreFluffy/metamath-turing-machines Github NQL], [https://scottaaronson.blog/?p=8131 Aaronson Announcement]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|636&lt;br /&gt;
|31 August 2024&lt;br /&gt;
|Rohan Ridenour&lt;br /&gt;
|[https://github.com/CatsAreFluffy/metamath-turing-machines Github NQL] ([https://github.com/CatsAreFluffy/metamath-turing-machines/commit/6fc33bef6ba8885d26aed94c83e88bdabbedb0f1 commit])&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|588&lt;br /&gt;
|12 July 2025&lt;br /&gt;
|Andrew J. Wade&lt;br /&gt;
|[https://github.com/andrew-j-wade/metamath-turing-machines Github NQL] ([https://github.com/andrew-j-wade/metamath-turing-machines/commit/30d2e3194866615f68dd2f5101cb300fb039adca commit])&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|549&lt;br /&gt;
|16 July 2025&lt;br /&gt;
|Andrew J. Wade&lt;br /&gt;
|[https://github.com/andrew-j-wade/metamath-turing-machines Github NQL] ([https://github.com/andrew-j-wade/metamath-turing-machines/commit/5d676aec074a94f598959cb3b7733a8f7781762f commit])&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|432&lt;br /&gt;
|19 Aug 2025&lt;br /&gt;
|Andrew J. Wade&lt;br /&gt;
|[https://codeberg.org/ajwade/turing_machine_explorer/commit/33b30300054242201a95679aacf7e74312bd8803b0df9a85d2314095efd6804e git commit]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|335&lt;br /&gt;
|11 Oct 2026&lt;br /&gt;
|Jeff Ketchersid&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1559077555158392844 discord message]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|254&lt;br /&gt;
|13 Oct 2026&lt;br /&gt;
|[https://x.com/_mira___mira_ Mira] with use of ChatGPT, formalized by [https://github.com/jeff87654 Jeff Ketchersid] with Claude&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/zf-254/ZF/m254 Github]&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/zf-254/ZF/m254 Rocq file]&lt;br /&gt;
|-&lt;br /&gt;
|230&lt;br /&gt;
|19 Oct 2026&lt;br /&gt;
|[https://x.com/ElliotGlazer Elliot Glazer] with use of ChatGPT, formalized with GPT and Claude&lt;br /&gt;
|[https://github.com/elliotglazer/k230-rocq Github]&lt;br /&gt;
|[https://github.com/elliotglazer/k230-rocq Rocq file]&lt;br /&gt;
|-&lt;br /&gt;
|215&lt;br /&gt;
|21 Oct 2026&lt;br /&gt;
|[[wikipedia:Cleo_(mathematician)|Vladimir Reshetnikov]] formalized with Claude&lt;br /&gt;
|[https://github.com/VladimirReshetnikov/ProveIt/tree/c9dc79323429112c698100f3226a6e4d56c8b782/Computability/BusyBeaver/Research/ZFC/k225-formal Github]&lt;br /&gt;
|[https://github.com/VladimirReshetnikov/ProveIt/tree/c9dc79323429112c698100f3226a6e4d56c8b782/Computability/BusyBeaver/Research/ZFC/k225-formal/verification/k215 Rocq file]&lt;br /&gt;
|-&lt;br /&gt;
|209&lt;br /&gt;
|12 Nov 2026&lt;br /&gt;
|James Chang formalized with ChatGPT&lt;br /&gt;
|[https://github.com/jamesyc/BusyBeaver/commit/286324f9ad106bbeab32b70404e7a82be2cd660d Github]([https://discord.com/channels/960643023006490684/960643023530762341/1570618968060858439 discord message])&lt;br /&gt;
|[https://github.com/jamesyc/BusyBeaver/tree/main/ZF209/ProofSources Lean]&lt;br /&gt;
|-&lt;br /&gt;
|211&lt;br /&gt;
|17 Nov 2026&lt;br /&gt;
|Shivam Patel&lt;br /&gt;
|[[Media:K211-paper.pdf|Paper]]&lt;br /&gt;
|[[Media:K211-review-by-email.zip|Lean proof and replay]]&lt;br /&gt;
|}&lt;br /&gt;
[[File:ZFC Machine 254.png|thumb|The transition table of the ZF machine with 254 states. The initial state is 1.]]&lt;br /&gt;
Wade&#039;s 432-state champion also omits the [[wikipedia:Axiom_of_regularity|axiom of regularity]], as ZF-regularity is also equiconsistent with ZF.&lt;br /&gt;
&lt;br /&gt;
== New Foundations (NF) ==&lt;br /&gt;
&#039;&#039;New Foundations&#039;&#039; is a formal theory created by W.V.O. Quine in 1937, based around the principle of stratified comprehension of sets. It is known to be stronger than Peano Arithmetic and second-order arithmetic, but weaker than ZF. The Github page contains a proof in Lean that it is equiconsistent with Mac Lane set theory, which is a novel result as of the time of writing (November 2026). Mac Lane set theory is far more mainstream than NF, so the following machine could be seen as an efficient way of determining which Busy Beaver value MAC cannot verify.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of New Foundations (NF) independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|210&lt;br /&gt;
|8 November 2026&lt;br /&gt;
|@wlad-svennik&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/wlad-svennik/notes/tree/main/nf-bb210]&lt;br /&gt;
|-&lt;br /&gt;
|198&lt;br /&gt;
|12 November 2026&lt;br /&gt;
|@wlad-svennik&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/wlad-svennik/notes/commit/0a0c8fa5992dfdee35f18fcb718ec278378b2740]&lt;br /&gt;
|-&lt;br /&gt;
|192&lt;br /&gt;
|16 November 2026&lt;br /&gt;
|@wlad-svennik&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/wlad-svennik/notes/releases/tag/nf192-countdown]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== User-friendly theory ===&lt;br /&gt;
&lt;br /&gt;
The TM searches for an inconsistency in the theory &amp;quot;&#039;&#039;&#039;FunctionNF&#039;&#039;&#039;&amp;quot;. It is defined to equal stratified λ-calculus minus pairing, minus case-expressions, plus full functional extensionality, plus an equality checker.&amp;lt;pre&amp;gt;Terms     t ::= x | t u | λx.t | (s ≐ t) | ⊤ | ⊥&lt;br /&gt;
&lt;br /&gt;
Depth     Each subterm occurrence has a depth relative to the term it sits in:&lt;br /&gt;
            the term itself        0&lt;br /&gt;
            in  t u   at depth n:  t at n+1,  u at n&lt;br /&gt;
            in  λx.t  at depth n:  t at n−1&lt;br /&gt;
            in  s ≐ t at depth n:  s and t at n&lt;br /&gt;
&lt;br /&gt;
Formation λx.t is a term iff every free occurrence of x in t has depth 0 in t.&lt;br /&gt;
          Nothing else is constrained: other variables may occur at any depths.&lt;br /&gt;
&lt;br /&gt;
Axioms    (β)    (λx.t) u = t[u/x]&lt;br /&gt;
          (ext)  (∀x. f x = g x) → f = g&lt;br /&gt;
          (≐)    s = t → (s ≐ t) = ⊤        s ≠ t → (s ≐ t) = ⊥&lt;br /&gt;
          (nt)   ⊤ ≠ ⊥&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The logic is ordinary first-order logic with equality, so unstratified &#039;&#039;formulas&#039;&#039; are allowed. Only λ is restricted.&lt;br /&gt;
&lt;br /&gt;
It&#039;s not obvious, but the above suffices to prove the &#039;&#039;Axiom of Infinity&#039;&#039;, i.e. that the set of natural numbers exists and has all of its expected properties. It&#039;s then possible to define the set of real numbers in any of the usual ways, and do nearly all of extant mathematics.&lt;br /&gt;
&lt;br /&gt;
=== NF vs Mac Lane vs other set theories ===&lt;br /&gt;
The Github link contains proofs in Lean that:&lt;br /&gt;
&lt;br /&gt;
* NF interprets FunctionNF (which is very short),&lt;br /&gt;
* FunctionNF in turn interprets NFU+Infinity (which is similar to Specker&#039;s proof of the &amp;quot;Axiom of Infinity&amp;quot; within NF),&lt;br /&gt;
* NFU+Infinity interprets NF, which is a novel and hard result that is not yet found in the literature,&lt;br /&gt;
* NFU+Infinity interprets Mac Lane set theory,&lt;br /&gt;
* Mac Lane set theory interprets TSTI (Theory of Simple Types plus (Axiom of) Infinity),&lt;br /&gt;
* TSTI is equiconsistent with NFU+Infinity.&lt;br /&gt;
&lt;br /&gt;
So overall, the machine halts iff there exists an inconsistency in &#039;&#039;any&#039;&#039; of the above theories. Regardless, Mac Lane set theory is actually &#039;&#039;weaker&#039;&#039; than NF in terms of &#039;&#039;intepretability strength&#039;&#039;, as opposed to just consistency strength.&lt;br /&gt;
&lt;br /&gt;
If we add the &#039;&#039;Axiom of Counting&#039;&#039; (AxCount) to NF, which is the rather tautological-looking axiom&amp;lt;blockquote&amp;gt;&amp;lt;nowiki&amp;gt;For any finite set S, |S| = |{{x}&amp;lt;/nowiki&amp;gt; : x ∈ S}|      (i.e. the number of elements of S doesn&#039;t change when you replace each element x with the singleton {x})&amp;lt;/blockquote&amp;gt;then it&#039;s sufficient to prove Con(Z). As of the time of this writing (November 2026) we&#039;ve used this to obtain a machine that is smaller (201 states) than any machine of Zermelo-strength or above.&lt;br /&gt;
&lt;br /&gt;
ZFC can prove Con(NF + AxCount).&lt;br /&gt;
&lt;br /&gt;
=== Implementation theory: The combinatory calculus ===&lt;br /&gt;
FunctionalNF is not implemented directly. Instead, a massively leaner form is implemented, in the form of a [https://en.wikipedia.org/wiki/combinatory_logic combinatory logic] which consists of just three nonlogical primitives:&lt;br /&gt;
&lt;br /&gt;
* Binary application &amp;lt;math&amp;gt;xy&amp;lt;/math&amp;gt;, associated to the left.&lt;br /&gt;
* A constant &amp;lt;math&amp;gt;q&amp;lt;/math&amp;gt;. This is a fixed-point tester.&lt;br /&gt;
* A binary function &amp;lt;math&amp;gt;H(x,y)&amp;lt;/math&amp;gt;. This is a merger between the &#039;&#039;K&#039;&#039; combinator and a [https://en.wikipedia.org/wiki/skolem_function Skolem function] for function extensionality.&lt;br /&gt;
&lt;br /&gt;
Define the convenient shorthands&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\begin{aligned}&lt;br /&gt;
K(x)&amp;amp;:=H(x,x),\\&lt;br /&gt;
r&amp;amp;:=(qq)q,\\&lt;br /&gt;
b&amp;amp;:=(q(qq))r.&lt;br /&gt;
\end{aligned}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The six axioms, with all free variables universally quantified, are:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! No.&lt;br /&gt;
! Axiom&lt;br /&gt;
! Role&lt;br /&gt;
|-&lt;br /&gt;
| 1&lt;br /&gt;
| &amp;lt;math&amp;gt;H(x,x)y=x&amp;lt;/math&amp;gt;&lt;br /&gt;
| Constant functions&lt;br /&gt;
|-&lt;br /&gt;
| 2&lt;br /&gt;
| &amp;lt;math&amp;gt;bxyz=(xH(z,z))(yz)&amp;lt;/math&amp;gt;&lt;br /&gt;
| Combinatory composition&lt;br /&gt;
|-&lt;br /&gt;
| 3&lt;br /&gt;
| &amp;lt;math&amp;gt;xy=y\implies(qx)y=b&amp;lt;/math&amp;gt;&lt;br /&gt;
| Positive equality test&lt;br /&gt;
|-&lt;br /&gt;
| 4&lt;br /&gt;
| &amp;lt;math&amp;gt;xy\ne y\implies(qx)y=r&amp;lt;/math&amp;gt;&lt;br /&gt;
| Negative equality test&lt;br /&gt;
|-&lt;br /&gt;
| 5&lt;br /&gt;
| &amp;lt;math&amp;gt;xH(x,y)=yH(x,y)\implies x=y&amp;lt;/math&amp;gt;&lt;br /&gt;
| Extensionality witness&lt;br /&gt;
|-&lt;br /&gt;
| 6&lt;br /&gt;
| &amp;lt;math&amp;gt;q(qq)\ne qq&amp;lt;/math&amp;gt;&lt;br /&gt;
| Nondegeneracy&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
In particular, &amp;lt;math&amp;gt;K(x)y=x&amp;lt;/math&amp;gt; follows immediately from axiom 1. It is not a separate axiom.&lt;br /&gt;
&lt;br /&gt;
=== Fragment of First-Order Logic ===&lt;br /&gt;
Notably, we &#039;&#039;&#039;do not&#039;&#039;&#039; implement the whole of First-Order Logic: The quantifier ∀ can be defined &#039;&#039;internally&#039;&#039; to CombNF / FunctionalNF. Moreover, we don&#039;t even implement variables thanks to our use of combinatory logic. The only fragment of First-Order Logic we do implement consists of &amp;quot;=&amp;quot;, the above function symbols, and propositional logic. This is similar to [https://en.wikipedia.org/wiki/primitive_recursive_arithmetic Primitive Recursive Arithmetic] and [https://en.wikipedia.org/wiki/system_T System T].&lt;br /&gt;
&lt;br /&gt;
Observe that:&amp;lt;blockquote&amp;gt;∀ := λP.(P ≐ λx.⊤)&lt;br /&gt;
&lt;br /&gt;
¬ := λp.(p ≐ ⊥)&lt;br /&gt;
&lt;br /&gt;
∃ := λP. ¬ (∀ λx. ¬ (P x))&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== What the symbols do ===&lt;br /&gt;
&amp;lt;math&amp;gt;q&amp;lt;/math&amp;gt; is an equality tester:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;(qx)y=&lt;br /&gt;
\begin{cases}&lt;br /&gt;
b,&amp;amp;xy=y,\\&lt;br /&gt;
r,&amp;amp;xy\ne y.&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;H&amp;lt;/math&amp;gt; has two jobs. On the diagonal it constructs constant functions:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;H(x,x)y=x.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Off the diagonal it supplies a witness to distinguish two functions whenever they are different:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;x\ne y\implies xH(x,y)\ne yH(x,y).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; supplies the composition law&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;bxyz=x(K(z))(yz).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt; are terms, not primitive constants.&lt;br /&gt;
&lt;br /&gt;
Once again, we do &#039;&#039;&#039;not&#039;&#039;&#039; implement the whole of First-Order Logic.&lt;br /&gt;
&lt;br /&gt;
The formalized proof for this machine&#039;s NF-undecidability is formalized as an &#039;&#039;external&#039;&#039; Lean metatheorem rather than a completed PA-internal derivation. As of this publication, a fresh independent clean build and community review have not been reported.&lt;br /&gt;
&lt;br /&gt;
== Peano Arithmetic (PA) ==&lt;br /&gt;
The ZF bound applies to PA because ZF proves the arithmetical theorems of PA. In turn, a proof of an exact Busy Beaver value in any theory listed below PA would give a PA proof of that same value. For &amp;lt;math&amp;gt;n \ge 196&amp;lt;/math&amp;gt;, a proof of &amp;lt;math&amp;gt;BB(n)=b&amp;lt;/math&amp;gt; would let PA decide whether the 196-state machine halts by padding it to &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; states and checking its first &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of Peano Arithmetic (PA) independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|372&lt;br /&gt;
|11 February 2026&lt;br /&gt;
|@LegionMammal978 (Matthew House)&lt;br /&gt;
|[https://github.com/LegionMammal978/turing_machine_explorer/blob/main/pa.py Github]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|196&lt;br /&gt;
|12 Nov 2026&lt;br /&gt;
|James Chang formalized with ChatGPT&lt;br /&gt;
|[https://github.com/jamesyc/BusyBeaver/commit/64ff1b3047b951b25129d4ab897ccf1728b66dbf Github]&lt;br /&gt;
|[https://github.com/jamesyc/BusyBeaver/tree/main/PA196/ProofSources Lean]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
This machine takes Wade&#039;s ZF champion and replaces the set theory axioms with one axiom schema of &amp;quot;adjunction + separation&amp;quot;, which has been shown to interpret PA.&amp;lt;ref&amp;gt;https://mathoverflow.net/questions/508137/interpreting-pa-with-only-adjunction-separation/508161&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The 192-state entries use the proposed transfer of the NF result to PA under the assumption that Mac Lane set theory is consistent. The published Lean theorem establishes in the metatheory that the machine halts exactly when NF proves a contradiction.&amp;lt;ref&amp;gt;[https://github.com/wlad-svennik/notes/releases/tag/nf192-countdown New Foundations: 192-state countdown machine and Lean verification], release notes.&amp;lt;/ref&amp;gt; To obtain the 192-state bound for PA, one also needs to show that PA cannot prove this particular machine runs forever. For example, it would suffice to derive in PA that its nonhalting implies the consistency of PA, and then apply Gödel&#039;s second incompleteness theorem. The separate 196-state construction directly establishes that PA proves neither halting nor nonhalting for its machine.&amp;lt;ref&amp;gt;James Chang, [https://github.com/jamesyc/BusyBeaver/commit/64ff1b3047b951b25129d4ab897ccf1728b66dbf PA196 proof package].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Weaker arithmetical theories ===&lt;br /&gt;
Even &amp;lt;math&amp;gt;R_0&amp;lt;/math&amp;gt;, a proper subtheory of Tarski–Mostowski–Robinson &amp;lt;math&amp;gt;R&amp;lt;/math&amp;gt;, proves every true individual halting assertion because it proves all true &amp;lt;math&amp;gt;\Sigma_1&amp;lt;/math&amp;gt; sentences in the usual language of arithmetic.&amp;lt;ref&amp;gt;Taishi Kurahashi and Albert Visser, [https://doi.org/10.1017/jsl.2024.84 Certified Σ₁-Sentences], §2, Theorem 2.3.&amp;lt;/ref&amp;gt; Between Robinson arithmetic &amp;lt;math&amp;gt;Q&amp;lt;/math&amp;gt; and bounded induction &amp;lt;math&amp;gt;I\Delta_0&amp;lt;/math&amp;gt; lie &amp;lt;math&amp;gt;\mathrm{PA}^{-}&amp;lt;/math&amp;gt;, the theory of discretely ordered semirings, and &amp;lt;math&amp;gt;\mathrm{IOpen}&amp;lt;/math&amp;gt;, which adds induction for quantifier-free formulas.&amp;lt;ref&amp;gt;Kazuyuki Tanaka, [https://hep.tsinghua.edu.cn/~liwj/AU2024-lec03-08.pdf Logic and Computation I, Part 3a. Formal Arithmetic], Corollary 3.43.&amp;lt;/ref&amp;gt; Further up, &amp;lt;math&amp;gt;\mathrm{EA}^{+}&amp;lt;/math&amp;gt; adds total superexponentiation to EFA. It proves the consistency of &amp;lt;math&amp;gt;I\Delta_0&amp;lt;/math&amp;gt;, which EFA cannot prove.&amp;lt;ref&amp;gt;Samuel R. Buss, [https://mathweb.ucsd.edu/~sbuss/ResearchWeb/handbookII/ChapterII.pdf First-Order Proof Theory of Arithmetic], §4.3.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Theories grouped in one arithmetic row have the same Busy Beaver threshold. For fixed standard &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt;, a counterexample to &amp;lt;math&amp;gt;BB(n)\le b&amp;lt;/math&amp;gt; is a halting computation of an &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;-state machine lasting more than &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; steps. A proposed computation can be checked in polynomial time in the length of its complete history. When &amp;lt;math&amp;gt;BB(n)=b&amp;lt;/math&amp;gt; is true, a particular halting run witnesses the matching lower bound.&lt;br /&gt;
&lt;br /&gt;
With this explicit history coding, &amp;lt;math&amp;gt;\mathrm{PV}_1&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;S^1_2&amp;lt;/math&amp;gt; agree on the universal equations expressing the upper bounds. Full bounded arithmetic &amp;lt;math&amp;gt;S_2&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;I\Delta_0+\Omega_1&amp;lt;/math&amp;gt; agree on sentences in their common arithmetical language.&amp;lt;ref&amp;gt;Jan Krajíček, [https://www.karlin.mff.cuni.cz/~krajicek/kniha.pdf Bounded Arithmetic, Propositional Logic, and Complexity Theory], Lemma 5.2.15 and Theorem 5.3.4.&amp;lt;/ref&amp;gt; Buss&#039;s conservation theorem similarly gives &amp;lt;math&amp;gt;T^1_2&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;S^2_2&amp;lt;/math&amp;gt; the same provable upper bounds.&amp;lt;ref&amp;gt;Samuel R. Buss, [https://mathweb.ucsd.edu/~sbuss/ResearchWeb/BAaxioms/camera.pdf Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic].&amp;lt;/ref&amp;gt; Finally, &amp;lt;math&amp;gt;I\Sigma_1&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\mathrm{RCA}_0&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\mathrm{WKL}_0&amp;lt;/math&amp;gt; agree with PRA on &amp;lt;math&amp;gt;\Pi^0_2&amp;lt;/math&amp;gt; arithmetic sentences, which suffices for all four to share a threshold.&amp;lt;ref&amp;gt;Jeremy Avigad, [https://www.andrew.cmu.edu/user/avigad/Papers/omegasubmodels.pdf Notes on Π¹₁-conservativity, ω-submodels, and the collection schema], §2.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Large cardinals ==&lt;br /&gt;
These tables are for theories stronger than ZFC.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of ZFC + &amp;quot;There exist arbitrarily large subtle cardinals&amp;quot; independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|493&lt;br /&gt;
|25 February 2026&lt;br /&gt;
|@LegionMammal978&lt;br /&gt;
|[https://github.com/Saoi2/turing_machine_explorer/blob/main/subtle.tm Github]&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
This machine takes Wade&#039;s ZF champion and adds the [[wikipedia:Axiom_of_choice|axiom of Choice]] and a statement from Harvey Friedman (Proposition 4.3 of [https://bpb-us-w2.wpmucdn.com/u.osu.edu/dist/1/1952/files/2014/01/PrimitiveIndResults071302-189vmn0.pdf &amp;quot;Primitive Independence Results&amp;quot;])&amp;lt;ref&amp;gt;H. Friedman, &amp;quot;[https://bpb-us-w2.wpmucdn.com/u.osu.edu/dist/1/1952/files/2014/01/PrimitiveIndResults071302-189vmn0.pdf Primitive Independence Results]&amp;quot; (2002). Accessed February 2026.&amp;lt;/ref&amp;gt; which Friedman showed to be equivalent to &amp;quot;There exist arbitrarily large subtle cardinals&amp;quot; over ZFC.&lt;br /&gt;
&lt;br /&gt;
For reference, this theory is between the strength of &amp;quot;strongly unfoldable&amp;quot; and &amp;quot;&amp;lt;math&amp;gt;0^\sharp&amp;lt;/math&amp;gt; exists&amp;quot; on the [[wikipedia:Large_cardinal|large cardinal hierarchy]] on Wikipedia.&lt;br /&gt;
&lt;br /&gt;
Note: The initial machine produced in 2016 by Yedidia and Aaronson is designed to halt iff a certain statement created by Harvey Friedman is true.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt; According to Friedman (without a published proof), this statement is independent of the theory &amp;quot;Stationary Ramsey Property&amp;quot; or &#039;&#039;SRP&#039;&#039;, which is equiconsistent with the theory &amp;lt;math&amp;gt;ZFC + \{\text{``There is a }k\text{-subtle cardinal``}\mid k\in\N\}&amp;lt;/math&amp;gt; which is also between the strength of &amp;quot;strongly unfoldable&amp;quot; and &amp;quot;&amp;lt;math&amp;gt;0^\sharp&amp;lt;/math&amp;gt; exists&amp;quot; on the large cardinal hierarchy.&amp;lt;ref&amp;gt;tlonuqbar, &amp;quot;[https://mathoverflow.net/questions/508364/what-is-the-consistency-strength-of-srp-stationary-ramsey-property What is the consistency strength of SRP (Stationary Ramsey Property)?]&amp;quot; (2026). MathOverflow post, accessed February 2026.&amp;lt;/ref&amp;gt; However, the theory used by the BB(493) machine is also independent of this theory.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of ZF + &amp;quot;There exists a Berkeley cardinal&amp;quot; independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|1399&lt;br /&gt;
|8 November 2026&lt;br /&gt;
|@Meganeuridae&lt;br /&gt;
|[https://github.com/Meganeuridae/large-cardinal-tms/blob/main/berkeley-rocq/machine/machine.tm Github]&lt;br /&gt;
|[https://github.com/Meganeuridae/large-cardinal-tms/tree/main/berkeley-rocq/coq/Berkeley Rocq file]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
Berkeley cardinals are perhaps the strongest family of large cardinals considered, initially proposed by Hugh Woodin at a lecture at UC Berkeley as an axiom that was &amp;quot;obviously inconsistent&amp;quot;.{{Citation needed}} However, no inconsistency has been found and many people now believe it may be consistent. Berkeley cardinals are known to be inconsistent with the axiom of choice.&lt;br /&gt;
&lt;br /&gt;
== Footnotes ==&lt;br /&gt;
&amp;lt;references group=&amp;quot;footnote&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Zoology]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Logical_independence&amp;diff=11130</id>
		<title>Logical independence</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Logical_independence&amp;diff=11130"/>
		<updated>2026-11-19T03:06:19Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Move table of N_T values to its own section now that it has gotten really huge ... perhaps we should delete small theories until they have any actual results?&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;For any recursively enumerable and arithmetically sound axiomatic theory T, there exists an integer &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; such that T cannot prove the values of BB(n) for any &amp;lt;math&amp;gt;n \ge N_T&amp;lt;/math&amp;gt;. Let &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; denote the least such integer. For [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo–Fraenkel set theory]] (ZF), this value is known to be in the range:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;6 \le N_{ZF} \le 209&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This lower bound comes from the fact that [[BB(5)]] has been proven in Rocq.&amp;lt;ref group=&amp;quot;footnote&amp;quot;&amp;gt;The fact that this theorem has been proven in Rocq technically does not imply that the theorem must be provable in ZF, because the consistency strength of Rocq is actually higher than that of ZF. However, the BB(5) proof does not use any techniques that could not be formalized within ZF.&amp;lt;/ref&amp;gt; The upper bound comes from an explicit TM which halts if and only if ZFC has a finite proof of contradiction. Assuming ZF is consistent and sound, then it cannot prove whether or not it is consistent, hence it cannot prove whether or not this specific TM halts.&lt;br /&gt;
&lt;br /&gt;
Harvey Friedman spoke of embedding consistency statements within turing machines in a [https://fomarchive.ugent.be/2004-March/008003.html 2004 posting] on the &amp;quot;Foundations of Mathematics&amp;quot; mailing list. Scott Aaronson conjectured in his [[Busy Beaver Frontier]] survey that &amp;lt;math&amp;gt;N_{ZF} \le 20&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;N_{PA} \le 10&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;PA&amp;lt;/math&amp;gt; refers to the theory of [https://en.wikipedia.org/wiki/Peano%20axioms Peano Arithmetic]. Scott also mentioned (crediting Oscar Cunningham for the observation) that if there is an n-state machine that halts if and only if T is inconsistent, then &amp;lt;math&amp;gt;PA&amp;lt;/math&amp;gt; + “BB(n) = b” can prove the consistency of T, where b is the true value of BB(n).&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;Scott Aaronson. 2020. [https://www.scottaaronson.com/papers/bb.pdf The Busy Beaver Frontier]. SIGACT News 51, 3 (August 2020), 32–54. https://doi.org/10.1145/3427361.3427369&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Results by Theory ==&lt;br /&gt;
Most normal theories form a linear ordering with respect to consistency strength. All theories in the table below follow that linear order from top to bottom. Thus for any row X below Y, &amp;lt;math&amp;gt;N_X \le N_Y&amp;lt;/math&amp;gt;. Rows are empty if no better results is known than the result inherited from a previous row.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! Theory&lt;br /&gt;
! Upper bound on &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; (states)&lt;br /&gt;
|-&lt;br /&gt;
| ZF+Berkeley cardinal&lt;br /&gt;
| 1399&lt;br /&gt;
|-&lt;br /&gt;
| ZF+subtle cardinal&lt;br /&gt;
| 493&lt;br /&gt;
|-&lt;br /&gt;
| Zermelo-Fraenkel set theory (ZF) / ZFC&lt;br /&gt;
| 209&lt;br /&gt;
|-&lt;br /&gt;
| New Foundations + Axiom of Counting&lt;br /&gt;
| 201&lt;br /&gt;
|-&lt;br /&gt;
| Zermelo set theory&lt;br /&gt;
| 209 (via ZF)&amp;lt;ref group=&amp;quot;footnote&amp;quot;&amp;gt;Zermelo set theory is a subtheory of ZF. For the version with Choice, the same upper bound follows from inclusion in ZFC and [[#Axiom of Choice|the equality of the ZF and ZFC thresholds]].&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| New Foundations (NF) / Mac Lane&lt;br /&gt;
| 192&lt;br /&gt;
|-&lt;br /&gt;
| Peano arithmetic (PA)&lt;br /&gt;
| 196 (direct)&amp;lt;br /&amp;gt;192 (conditional, via NF)&amp;lt;ref group=&amp;quot;footnote&amp;quot;&amp;gt;The 196-state PA construction also gives an upper bound for every row below PA. The smaller bound uses the proposed NF-to-PA transfer discussed in [[#Peano Arithmetic (PA)|the PA section]].&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| PRA / &amp;lt;math&amp;gt;I\Sigma_1&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;\mathrm{RCA}_0&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;\mathrm{WKL}_0&amp;lt;/math&amp;gt;&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\mathrm{EA}^{+}&amp;lt;/math&amp;gt;&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
| EFA&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;I\Delta_0+\Omega_1&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;S_2&amp;lt;/math&amp;gt;&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;T^1_2&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;S^2_2&amp;lt;/math&amp;gt;&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\mathrm{PV}_1&amp;lt;/math&amp;gt; / &amp;lt;math&amp;gt;S^1_2&amp;lt;/math&amp;gt;&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;I\Delta_0&amp;lt;/math&amp;gt;&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
| Open induction (&amp;lt;math&amp;gt;\mathrm{IOpen}&amp;lt;/math&amp;gt;)&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\mathrm{PA}^{-}&amp;lt;/math&amp;gt; (discretely ordered semirings)&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
| Robinson arithmetic (&amp;lt;math&amp;gt;Q&amp;lt;/math&amp;gt;)&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
| Tarski–Mostowski–Robinson &amp;lt;math&amp;gt;R&amp;lt;/math&amp;gt;&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;R_0&amp;lt;/math&amp;gt;&lt;br /&gt;
| &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Axiom of Choice ==&lt;br /&gt;
Due to [[wikipedia:Absoluteness_(logic)#Shoenfield&#039;s_absoluteness_theorem|Shoenfield&#039;s absoluteness theorem]], it is known that any TM proven non-halting in ZFC can also be proven non-halting in ZF (and the converse is trivially true), therefore&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;N_{ZFC} = N_{ZF}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Therefore we refer to ZF and &amp;lt;math&amp;gt;N_{ZF}&amp;lt;/math&amp;gt; throughout this article since adding the Axiom of Choice does not have any effect on Turing machine decidability.&lt;br /&gt;
&lt;br /&gt;
== History ==&lt;br /&gt;
In a broad sense, the concept of a mechanical or computable procedure that was equivalent to the consistency of a formal theory was discovered by Kurt Gödel&#039;s incompleteness theorem, which is notable for introducing a meta-mathematical encoding of the statement that &amp;quot;T can prove statement S&amp;quot; (the provability predicate) which is used in all these machines. This was further clarified by Alan Turing and Alonzo Church&#039;s work on a formal definition of computability.&lt;br /&gt;
&lt;br /&gt;
Although not a traditional turing machine, in 2012 Merlin Carl and Boris Z. Moroz constructed a [[Diophantine Equation]] which had solutions if and only if NBG (Von Neumann–Bernays–Gödel set theory) is inconsistent. NBG is a conservative extension of ZFC, so solving this equation is independent of ZFC.&amp;lt;ref&amp;gt;Carl, M., &amp;amp; Moroz, B. Z. (2012). &#039;&#039;On a Diophantine representation of the predicate of provability.&#039;&#039; Zapiski Nauchnykh Seminarov POMI, 407, 77-104. (Republished in 2014 in the Journal of Mathematical Sciences) [https://webdoc.sub.gwdg.de/ebook/serien/e/mpi_mathematik/2006/129.pdf (preprint)]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Zermelo–Fraenkel set theory (ZF) ==&lt;br /&gt;
There is no one authoritative source on the history of TMs independent of ZF, this is our best understanding of the history of TMs found. The results before 2026 are taken from Scott Aaronson&#039;s blog announcements and Busy Beaver Frontier or self-reported by the individuals who discovered them. The Aaronson-Yedida machine used a compiler called &#039;&#039;Laconic&#039;&#039;, which was then updated with NQL or &amp;quot;Not Quite Laconic&amp;quot;, while the 432 machines use a compiler built by Andrew J. Wade. Many machines after 2026 have been generated by AI without a formal compiler.&lt;br /&gt;
&lt;br /&gt;
Note that only the results with a linked formal verification are known to have such a verification, with the 7910 machine in particular relying on a result from Harvey Friedman that has no published proof.&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of ZF independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|7910&lt;br /&gt;
|May 2016&lt;br /&gt;
|Adam Yedidia and Scott Aaronson&lt;br /&gt;
|Yedidia and Aaronson 2016&amp;lt;ref&amp;gt;A. Yedidia and S. Aaronson. A relatively small Turing machine whose behavior is independent of set theory. Complex Systems, (25):4, 2016. https://arxiv.org/abs/1605.04343&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|1919&lt;br /&gt;
|15 May 2016&lt;br /&gt;
|Stefan O&#039;Rear&lt;br /&gt;
|[https://github.com/sorear/metamath-turing-machines/blob/master/machines/2016-zf-sorear-1919/zf.nql Github NQL file], [https://groups.google.com/g/metamath/c/OumBq83Ksqs/m/FogyOlLIBwAJ Metamath Group Announcement]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|748&lt;br /&gt;
|May 2016&lt;br /&gt;
|Stefan O’Rear&lt;br /&gt;
|[https://github.com/sorear/metamath-turing-machines/blob/master/machines/2017-zf-sorear-748/zf2.nql Github NQL], Busy Beaver Frontier&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|745&lt;br /&gt;
|July 2023&lt;br /&gt;
|Johannes Riebel&lt;br /&gt;
|Riebel 2023 Bachelor Thesis&amp;lt;ref&amp;gt;Riebel, Johannes (March 2023). &#039;&#039;[https://www.ingo-blechschmidt.eu/assets/bachelor-thesis-undecidability-bb748.pdf The Undecidability of BB(748): Understanding Gödel&#039;s Incompleteness Theorems]&#039;&#039; (PDF) (Bachelor&#039;s thesis). University of Augsburg.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|643&lt;br /&gt;
|July 2024&lt;br /&gt;
|Rohan Ridenour&lt;br /&gt;
|[https://github.com/CatsAreFluffy/metamath-turing-machines Github NQL], [https://scottaaronson.blog/?p=8131 Aaronson Announcement]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|636&lt;br /&gt;
|31 August 2024&lt;br /&gt;
|Rohan Ridenour&lt;br /&gt;
|[https://github.com/CatsAreFluffy/metamath-turing-machines Github NQL] ([https://github.com/CatsAreFluffy/metamath-turing-machines/commit/6fc33bef6ba8885d26aed94c83e88bdabbedb0f1 commit])&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|588&lt;br /&gt;
|12 July 2025&lt;br /&gt;
|Andrew J. Wade&lt;br /&gt;
|[https://github.com/andrew-j-wade/metamath-turing-machines Github NQL] ([https://github.com/andrew-j-wade/metamath-turing-machines/commit/30d2e3194866615f68dd2f5101cb300fb039adca commit])&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|549&lt;br /&gt;
|16 July 2025&lt;br /&gt;
|Andrew J. Wade&lt;br /&gt;
|[https://github.com/andrew-j-wade/metamath-turing-machines Github NQL] ([https://github.com/andrew-j-wade/metamath-turing-machines/commit/5d676aec074a94f598959cb3b7733a8f7781762f commit])&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|432&lt;br /&gt;
|19 Aug 2025&lt;br /&gt;
|Andrew J. Wade&lt;br /&gt;
|[https://codeberg.org/ajwade/turing_machine_explorer/commit/33b30300054242201a95679aacf7e74312bd8803b0df9a85d2314095efd6804e git commit]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|335&lt;br /&gt;
|11 Oct 2026&lt;br /&gt;
|Jeff Ketchersid&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1559077555158392844 discord message]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|254&lt;br /&gt;
|13 Oct 2026&lt;br /&gt;
|[https://x.com/_mira___mira_ Mira] with use of ChatGPT, formalized by [https://github.com/jeff87654 Jeff Ketchersid] with Claude&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/zf-254/ZF/m254 Github]&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/zf-254/ZF/m254 Rocq file]&lt;br /&gt;
|-&lt;br /&gt;
|230&lt;br /&gt;
|19 Oct 2026&lt;br /&gt;
|[https://x.com/ElliotGlazer Elliot Glazer] with use of ChatGPT, formalized with GPT and Claude&lt;br /&gt;
|[https://github.com/elliotglazer/k230-rocq Github]&lt;br /&gt;
|[https://github.com/elliotglazer/k230-rocq Rocq file]&lt;br /&gt;
|-&lt;br /&gt;
|215&lt;br /&gt;
|21 Oct 2026&lt;br /&gt;
|[[wikipedia:Cleo_(mathematician)|Vladimir Reshetnikov]] formalized with Claude&lt;br /&gt;
|[https://github.com/VladimirReshetnikov/ProveIt/tree/c9dc79323429112c698100f3226a6e4d56c8b782/Computability/BusyBeaver/Research/ZFC/k225-formal Github]&lt;br /&gt;
|[https://github.com/VladimirReshetnikov/ProveIt/tree/c9dc79323429112c698100f3226a6e4d56c8b782/Computability/BusyBeaver/Research/ZFC/k225-formal/verification/k215 Rocq file]&lt;br /&gt;
|-&lt;br /&gt;
|209&lt;br /&gt;
|12 Nov 2026&lt;br /&gt;
|James Chang formalized with ChatGPT&lt;br /&gt;
|[https://github.com/jamesyc/BusyBeaver/commit/286324f9ad106bbeab32b70404e7a82be2cd660d Github]([https://discord.com/channels/960643023006490684/960643023530762341/1570618968060858439 discord message])&lt;br /&gt;
|[https://github.com/jamesyc/BusyBeaver/tree/main/ZF209/ProofSources Lean]&lt;br /&gt;
|-&lt;br /&gt;
|211&lt;br /&gt;
|17 Nov 2026&lt;br /&gt;
|Shivam Patel&lt;br /&gt;
|[[Media:K211-paper.pdf|Paper]]&lt;br /&gt;
|[[Media:K211-review-by-email.zip|Lean proof and replay]]&lt;br /&gt;
|}&lt;br /&gt;
[[File:ZFC Machine 254.png|thumb|The transition table of the ZF machine with 254 states. The initial state is 1.]]&lt;br /&gt;
Wade&#039;s 432-state champion also omits the [[wikipedia:Axiom_of_regularity|axiom of regularity]], as ZF-regularity is also equiconsistent with ZF.&lt;br /&gt;
&lt;br /&gt;
== New Foundations (NF) ==&lt;br /&gt;
&#039;&#039;New Foundations&#039;&#039; is a formal theory created by W.V.O. Quine in 1937, based around the principle of stratified comprehension of sets. It is known to be stronger than Peano Arithmetic and second-order arithmetic, but weaker than ZF. The Github page contains a proof in Lean that it is equiconsistent with Mac Lane set theory, which is a novel result as of the time of writing (November 2026). Mac Lane set theory is far more mainstream than NF, so the following machine could be seen as an efficient way of determining which Busy Beaver value MAC cannot verify.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of New Foundations (NF) independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|210&lt;br /&gt;
|8 November 2026&lt;br /&gt;
|@wlad-svennik&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/wlad-svennik/notes/tree/main/nf-bb210]&lt;br /&gt;
|-&lt;br /&gt;
|198&lt;br /&gt;
|12 November 2026&lt;br /&gt;
|@wlad-svennik&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/wlad-svennik/notes/commit/0a0c8fa5992dfdee35f18fcb718ec278378b2740]&lt;br /&gt;
|-&lt;br /&gt;
|192&lt;br /&gt;
|16 November 2026&lt;br /&gt;
|@wlad-svennik&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/wlad-svennik/notes/releases/tag/nf192-countdown]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== User-friendly theory ===&lt;br /&gt;
&lt;br /&gt;
The TM searches for an inconsistency in the theory &amp;quot;&#039;&#039;&#039;FunctionNF&#039;&#039;&#039;&amp;quot;. It is defined to equal stratified λ-calculus minus pairing, minus case-expressions, plus full functional extensionality, plus an equality checker.&amp;lt;pre&amp;gt;Terms     t ::= x | t u | λx.t | (s ≐ t) | ⊤ | ⊥&lt;br /&gt;
&lt;br /&gt;
Depth     Each subterm occurrence has a depth relative to the term it sits in:&lt;br /&gt;
            the term itself        0&lt;br /&gt;
            in  t u   at depth n:  t at n+1,  u at n&lt;br /&gt;
            in  λx.t  at depth n:  t at n−1&lt;br /&gt;
            in  s ≐ t at depth n:  s and t at n&lt;br /&gt;
&lt;br /&gt;
Formation λx.t is a term iff every free occurrence of x in t has depth 0 in t.&lt;br /&gt;
          Nothing else is constrained: other variables may occur at any depths.&lt;br /&gt;
&lt;br /&gt;
Axioms    (β)    (λx.t) u = t[u/x]&lt;br /&gt;
          (ext)  (∀x. f x = g x) → f = g&lt;br /&gt;
          (≐)    s = t → (s ≐ t) = ⊤        s ≠ t → (s ≐ t) = ⊥&lt;br /&gt;
          (nt)   ⊤ ≠ ⊥&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The logic is ordinary first-order logic with equality, so unstratified &#039;&#039;formulas&#039;&#039; are allowed. Only λ is restricted.&lt;br /&gt;
&lt;br /&gt;
It&#039;s not obvious, but the above suffices to prove the &#039;&#039;Axiom of Infinity&#039;&#039;, i.e. that the set of natural numbers exists and has all of its expected properties. It&#039;s then possible to define the set of real numbers in any of the usual ways, and do nearly all of extant mathematics.&lt;br /&gt;
&lt;br /&gt;
=== NF vs Mac Lane vs other set theories ===&lt;br /&gt;
The Github link contains proofs in Lean that:&lt;br /&gt;
&lt;br /&gt;
* NF interprets FunctionNF (which is very short),&lt;br /&gt;
* FunctionNF in turn interprets NFU+Infinity (which is similar to Specker&#039;s proof of the &amp;quot;Axiom of Infinity&amp;quot; within NF),&lt;br /&gt;
* NFU+Infinity interprets NF, which is a novel and hard result that is not yet found in the literature,&lt;br /&gt;
* NFU+Infinity interprets Mac Lane set theory,&lt;br /&gt;
* Mac Lane set theory interprets TSTI (Theory of Simple Types plus (Axiom of) Infinity),&lt;br /&gt;
* TSTI is equiconsistent with NFU+Infinity.&lt;br /&gt;
&lt;br /&gt;
So overall, the machine halts iff there exists an inconsistency in &#039;&#039;any&#039;&#039; of the above theories. Regardless, Mac Lane set theory is actually &#039;&#039;weaker&#039;&#039; than NF in terms of &#039;&#039;intepretability strength&#039;&#039;, as opposed to just consistency strength.&lt;br /&gt;
&lt;br /&gt;
If we add the &#039;&#039;Axiom of Counting&#039;&#039; (AxCount) to NF, which is the rather tautological-looking axiom&amp;lt;blockquote&amp;gt;&amp;lt;nowiki&amp;gt;For any finite set S, |S| = |{{x}&amp;lt;/nowiki&amp;gt; : x ∈ S}|      (i.e. the number of elements of S doesn&#039;t change when you replace each element x with the singleton {x})&amp;lt;/blockquote&amp;gt;then it&#039;s sufficient to prove Con(Z). As of the time of this writing (November 2026) we&#039;ve used this to obtain a machine that is smaller (201 states) than any machine of Zermelo-strength or above.&lt;br /&gt;
&lt;br /&gt;
ZFC can prove Con(NF + AxCount).&lt;br /&gt;
&lt;br /&gt;
=== Implementation theory: The combinatory calculus ===&lt;br /&gt;
FunctionalNF is not implemented directly. Instead, a massively leaner form is implemented, in the form of a [https://en.wikipedia.org/wiki/combinatory_logic combinatory logic] which consists of just three nonlogical primitives:&lt;br /&gt;
&lt;br /&gt;
* Binary application &amp;lt;math&amp;gt;xy&amp;lt;/math&amp;gt;, associated to the left.&lt;br /&gt;
* A constant &amp;lt;math&amp;gt;q&amp;lt;/math&amp;gt;. This is a fixed-point tester.&lt;br /&gt;
* A binary function &amp;lt;math&amp;gt;H(x,y)&amp;lt;/math&amp;gt;. This is a merger between the &#039;&#039;K&#039;&#039; combinator and a [https://en.wikipedia.org/wiki/skolem_function Skolem function] for function extensionality.&lt;br /&gt;
&lt;br /&gt;
Define the convenient shorthands&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\begin{aligned}&lt;br /&gt;
K(x)&amp;amp;:=H(x,x),\\&lt;br /&gt;
r&amp;amp;:=(qq)q,\\&lt;br /&gt;
b&amp;amp;:=(q(qq))r.&lt;br /&gt;
\end{aligned}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The six axioms, with all free variables universally quantified, are:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! No.&lt;br /&gt;
! Axiom&lt;br /&gt;
! Role&lt;br /&gt;
|-&lt;br /&gt;
| 1&lt;br /&gt;
| &amp;lt;math&amp;gt;H(x,x)y=x&amp;lt;/math&amp;gt;&lt;br /&gt;
| Constant functions&lt;br /&gt;
|-&lt;br /&gt;
| 2&lt;br /&gt;
| &amp;lt;math&amp;gt;bxyz=(xH(z,z))(yz)&amp;lt;/math&amp;gt;&lt;br /&gt;
| Combinatory composition&lt;br /&gt;
|-&lt;br /&gt;
| 3&lt;br /&gt;
| &amp;lt;math&amp;gt;xy=y\implies(qx)y=b&amp;lt;/math&amp;gt;&lt;br /&gt;
| Positive equality test&lt;br /&gt;
|-&lt;br /&gt;
| 4&lt;br /&gt;
| &amp;lt;math&amp;gt;xy\ne y\implies(qx)y=r&amp;lt;/math&amp;gt;&lt;br /&gt;
| Negative equality test&lt;br /&gt;
|-&lt;br /&gt;
| 5&lt;br /&gt;
| &amp;lt;math&amp;gt;xH(x,y)=yH(x,y)\implies x=y&amp;lt;/math&amp;gt;&lt;br /&gt;
| Extensionality witness&lt;br /&gt;
|-&lt;br /&gt;
| 6&lt;br /&gt;
| &amp;lt;math&amp;gt;q(qq)\ne qq&amp;lt;/math&amp;gt;&lt;br /&gt;
| Nondegeneracy&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
In particular, &amp;lt;math&amp;gt;K(x)y=x&amp;lt;/math&amp;gt; follows immediately from axiom 1. It is not a separate axiom.&lt;br /&gt;
&lt;br /&gt;
=== Fragment of First-Order Logic ===&lt;br /&gt;
Notably, we &#039;&#039;&#039;do not&#039;&#039;&#039; implement the whole of First-Order Logic: The quantifier ∀ can be defined &#039;&#039;internally&#039;&#039; to CombNF / FunctionalNF. Moreover, we don&#039;t even implement variables thanks to our use of combinatory logic. The only fragment of First-Order Logic we do implement consists of &amp;quot;=&amp;quot;, the above function symbols, and propositional logic. This is similar to [https://en.wikipedia.org/wiki/primitive_recursive_arithmetic Primitive Recursive Arithmetic] and [https://en.wikipedia.org/wiki/system_T System T].&lt;br /&gt;
&lt;br /&gt;
Observe that:&amp;lt;blockquote&amp;gt;∀ := λP.(P ≐ λx.⊤)&lt;br /&gt;
&lt;br /&gt;
¬ := λp.(p ≐ ⊥)&lt;br /&gt;
&lt;br /&gt;
∃ := λP. ¬ (∀ λx. ¬ (P x))&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== What the symbols do ===&lt;br /&gt;
&amp;lt;math&amp;gt;q&amp;lt;/math&amp;gt; is an equality tester:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;(qx)y=&lt;br /&gt;
\begin{cases}&lt;br /&gt;
b,&amp;amp;xy=y,\\&lt;br /&gt;
r,&amp;amp;xy\ne y.&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;H&amp;lt;/math&amp;gt; has two jobs. On the diagonal it constructs constant functions:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;H(x,x)y=x.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Off the diagonal it supplies a witness to distinguish two functions whenever they are different:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;x\ne y\implies xH(x,y)\ne yH(x,y).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; supplies the composition law&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;bxyz=x(K(z))(yz).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt; are terms, not primitive constants.&lt;br /&gt;
&lt;br /&gt;
Once again, we do &#039;&#039;&#039;not&#039;&#039;&#039; implement the whole of First-Order Logic.&lt;br /&gt;
&lt;br /&gt;
The formalized proof for this machine&#039;s NF-undecidability is formalized as an &#039;&#039;external&#039;&#039; Lean metatheorem rather than a completed PA-internal derivation. As of this publication, a fresh independent clean build and community review have not been reported.&lt;br /&gt;
&lt;br /&gt;
== Peano Arithmetic (PA) ==&lt;br /&gt;
The ZF bound applies to PA because ZF proves the arithmetical theorems of PA. In turn, a proof of an exact Busy Beaver value in any theory listed below PA would give a PA proof of that same value. For &amp;lt;math&amp;gt;n \ge 196&amp;lt;/math&amp;gt;, a proof of &amp;lt;math&amp;gt;BB(n)=b&amp;lt;/math&amp;gt; would let PA decide whether the 196-state machine halts by padding it to &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; states and checking its first &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of Peano Arithmetic (PA) independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|372&lt;br /&gt;
|11 February 2026&lt;br /&gt;
|@LegionMammal978 (Matthew House)&lt;br /&gt;
|[https://github.com/LegionMammal978/turing_machine_explorer/blob/main/pa.py Github]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|196&lt;br /&gt;
|12 Nov 2026&lt;br /&gt;
|James Chang formalized with ChatGPT&lt;br /&gt;
|[https://github.com/jamesyc/BusyBeaver/commit/64ff1b3047b951b25129d4ab897ccf1728b66dbf Github]&lt;br /&gt;
|[https://github.com/jamesyc/BusyBeaver/tree/main/PA196/ProofSources Lean]&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
This machine takes Wade&#039;s ZF champion and replaces the set theory axioms with one axiom schema of &amp;quot;adjunction + separation&amp;quot;, which has been shown to interpret PA.&amp;lt;ref&amp;gt;https://mathoverflow.net/questions/508137/interpreting-pa-with-only-adjunction-separation/508161&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The 192-state entries use the proposed transfer of the NF result to PA under the assumption that Mac Lane set theory is consistent. The published Lean theorem establishes in the metatheory that the machine halts exactly when NF proves a contradiction.&amp;lt;ref&amp;gt;[https://github.com/wlad-svennik/notes/releases/tag/nf192-countdown New Foundations: 192-state countdown machine and Lean verification], release notes.&amp;lt;/ref&amp;gt; To obtain the 192-state bound for PA, one also needs to show that PA cannot prove this particular machine runs forever. For example, it would suffice to derive in PA that its nonhalting implies the consistency of PA, and then apply Gödel&#039;s second incompleteness theorem. The separate 196-state construction directly establishes that PA proves neither halting nor nonhalting for its machine.&amp;lt;ref&amp;gt;James Chang, [https://github.com/jamesyc/BusyBeaver/commit/64ff1b3047b951b25129d4ab897ccf1728b66dbf PA196 proof package].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Weaker arithmetical theories ===&lt;br /&gt;
Even &amp;lt;math&amp;gt;R_0&amp;lt;/math&amp;gt;, a proper subtheory of Tarski–Mostowski–Robinson &amp;lt;math&amp;gt;R&amp;lt;/math&amp;gt;, proves every true individual halting assertion because it proves all true &amp;lt;math&amp;gt;\Sigma_1&amp;lt;/math&amp;gt; sentences in the usual language of arithmetic.&amp;lt;ref&amp;gt;Taishi Kurahashi and Albert Visser, [https://doi.org/10.1017/jsl.2024.84 Certified Σ₁-Sentences], §2, Theorem 2.3.&amp;lt;/ref&amp;gt; Between Robinson arithmetic &amp;lt;math&amp;gt;Q&amp;lt;/math&amp;gt; and bounded induction &amp;lt;math&amp;gt;I\Delta_0&amp;lt;/math&amp;gt; lie &amp;lt;math&amp;gt;\mathrm{PA}^{-}&amp;lt;/math&amp;gt;, the theory of discretely ordered semirings, and &amp;lt;math&amp;gt;\mathrm{IOpen}&amp;lt;/math&amp;gt;, which adds induction for quantifier-free formulas.&amp;lt;ref&amp;gt;Kazuyuki Tanaka, [https://hep.tsinghua.edu.cn/~liwj/AU2024-lec03-08.pdf Logic and Computation I, Part 3a. Formal Arithmetic], Corollary 3.43.&amp;lt;/ref&amp;gt; Further up, &amp;lt;math&amp;gt;\mathrm{EA}^{+}&amp;lt;/math&amp;gt; adds total superexponentiation to EFA. It proves the consistency of &amp;lt;math&amp;gt;I\Delta_0&amp;lt;/math&amp;gt;, which EFA cannot prove.&amp;lt;ref&amp;gt;Samuel R. Buss, [https://mathweb.ucsd.edu/~sbuss/ResearchWeb/handbookII/ChapterII.pdf First-Order Proof Theory of Arithmetic], §4.3.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Theories grouped in one arithmetic row have the same Busy Beaver threshold. For fixed standard &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt;, a counterexample to &amp;lt;math&amp;gt;BB(n)\le b&amp;lt;/math&amp;gt; is a halting computation of an &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;-state machine lasting more than &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; steps. A proposed computation can be checked in polynomial time in the length of its complete history. When &amp;lt;math&amp;gt;BB(n)=b&amp;lt;/math&amp;gt; is true, a particular halting run witnesses the matching lower bound.&lt;br /&gt;
&lt;br /&gt;
With this explicit history coding, &amp;lt;math&amp;gt;\mathrm{PV}_1&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;S^1_2&amp;lt;/math&amp;gt; agree on the universal equations expressing the upper bounds. Full bounded arithmetic &amp;lt;math&amp;gt;S_2&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;I\Delta_0+\Omega_1&amp;lt;/math&amp;gt; agree on sentences in their common arithmetical language.&amp;lt;ref&amp;gt;Jan Krajíček, [https://www.karlin.mff.cuni.cz/~krajicek/kniha.pdf Bounded Arithmetic, Propositional Logic, and Complexity Theory], Lemma 5.2.15 and Theorem 5.3.4.&amp;lt;/ref&amp;gt; Buss&#039;s conservation theorem similarly gives &amp;lt;math&amp;gt;T^1_2&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;S^2_2&amp;lt;/math&amp;gt; the same provable upper bounds.&amp;lt;ref&amp;gt;Samuel R. Buss, [https://mathweb.ucsd.edu/~sbuss/ResearchWeb/BAaxioms/camera.pdf Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic].&amp;lt;/ref&amp;gt; Finally, &amp;lt;math&amp;gt;I\Sigma_1&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\mathrm{RCA}_0&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\mathrm{WKL}_0&amp;lt;/math&amp;gt; agree with PRA on &amp;lt;math&amp;gt;\Pi^0_2&amp;lt;/math&amp;gt; arithmetic sentences, which suffices for all four to share a threshold.&amp;lt;ref&amp;gt;Jeremy Avigad, [https://www.andrew.cmu.edu/user/avigad/Papers/omegasubmodels.pdf Notes on Π¹₁-conservativity, ω-submodels, and the collection schema], §2.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Large cardinals ==&lt;br /&gt;
These tables are for theories stronger than ZFC.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of ZFC + &amp;quot;There exist arbitrarily large subtle cardinals&amp;quot; independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|493&lt;br /&gt;
|25 February 2026&lt;br /&gt;
|@LegionMammal978&lt;br /&gt;
|[https://github.com/Saoi2/turing_machine_explorer/blob/main/subtle.tm Github]&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
This machine takes Wade&#039;s ZF champion and adds the [[wikipedia:Axiom_of_choice|axiom of Choice]] and a statement from Harvey Friedman (Proposition 4.3 of [https://bpb-us-w2.wpmucdn.com/u.osu.edu/dist/1/1952/files/2014/01/PrimitiveIndResults071302-189vmn0.pdf &amp;quot;Primitive Independence Results&amp;quot;])&amp;lt;ref&amp;gt;H. Friedman, &amp;quot;[https://bpb-us-w2.wpmucdn.com/u.osu.edu/dist/1/1952/files/2014/01/PrimitiveIndResults071302-189vmn0.pdf Primitive Independence Results]&amp;quot; (2002). Accessed February 2026.&amp;lt;/ref&amp;gt; which Friedman showed to be equivalent to &amp;quot;There exist arbitrarily large subtle cardinals&amp;quot; over ZFC.&lt;br /&gt;
&lt;br /&gt;
For reference, this theory is between the strength of &amp;quot;strongly unfoldable&amp;quot; and &amp;quot;&amp;lt;math&amp;gt;0^\sharp&amp;lt;/math&amp;gt; exists&amp;quot; on the [[wikipedia:Large_cardinal|large cardinal hierarchy]] on Wikipedia.&lt;br /&gt;
&lt;br /&gt;
Note: The initial machine produced in 2016 by Yedidia and Aaronson is designed to halt iff a certain statement created by Harvey Friedman is true.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt; According to Friedman (without a published proof), this statement is independent of the theory &amp;quot;Stationary Ramsey Property&amp;quot; or &#039;&#039;SRP&#039;&#039;, which is equiconsistent with the theory &amp;lt;math&amp;gt;ZFC + \{\text{``There is a }k\text{-subtle cardinal``}\mid k\in\N\}&amp;lt;/math&amp;gt; which is also between the strength of &amp;quot;strongly unfoldable&amp;quot; and &amp;quot;&amp;lt;math&amp;gt;0^\sharp&amp;lt;/math&amp;gt; exists&amp;quot; on the large cardinal hierarchy.&amp;lt;ref&amp;gt;tlonuqbar, &amp;quot;[https://mathoverflow.net/questions/508364/what-is-the-consistency-strength-of-srp-stationary-ramsey-property What is the consistency strength of SRP (Stationary Ramsey Property)?]&amp;quot; (2026). MathOverflow post, accessed February 2026.&amp;lt;/ref&amp;gt; However, the theory used by the BB(493) machine is also independent of this theory.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of ZF + &amp;quot;There exists a Berkeley cardinal&amp;quot; independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|1399&lt;br /&gt;
|8 November 2026&lt;br /&gt;
|@Meganeuridae&lt;br /&gt;
|[https://github.com/Meganeuridae/large-cardinal-tms/blob/main/berkeley-rocq/machine/machine.tm Github]&lt;br /&gt;
|[https://github.com/Meganeuridae/large-cardinal-tms/tree/main/berkeley-rocq/coq/Berkeley Rocq file]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
Berkeley cardinals are perhaps the strongest family of large cardinals considered, initially proposed by Hugh Woodin at a lecture at UC Berkeley as an axiom that was &amp;quot;obviously inconsistent&amp;quot;.{{Citation needed}} However, no inconsistency has been found and many people now believe it may be consistent. Berkeley cardinals are known to be inconsistent with the axiom of choice.&lt;br /&gt;
&lt;br /&gt;
== Footnotes ==&lt;br /&gt;
&amp;lt;references group=&amp;quot;footnote&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Zoology]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Logical_independence&amp;diff=11077</id>
		<title>Logical independence</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Logical_independence&amp;diff=11077"/>
		<updated>2026-11-18T19:37:42Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* History */ Split Theories out into top level sections&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;float:right; width:42%; font-size:85%; margin:0 0 1em 1em;&amp;quot;&lt;br /&gt;
! Theory&lt;br /&gt;
! BB(n) is independent&lt;br /&gt;
|-&lt;br /&gt;
| ZF+Berkeley cardinal&lt;br /&gt;
| 1399&lt;br /&gt;
|-&lt;br /&gt;
| ZF+subtle cardinal&lt;br /&gt;
| 493&lt;br /&gt;
|-&lt;br /&gt;
| Zermelo-Fraenkel set theory&lt;br /&gt;
| 211&lt;br /&gt;
|-&lt;br /&gt;
| New Foundations / Mac Lane&lt;br /&gt;
| 192&lt;br /&gt;
|-&lt;br /&gt;
| Peano arithmetic&lt;br /&gt;
|213&lt;br /&gt;
|-&lt;br /&gt;
| PRA&lt;br /&gt;
| —&lt;br /&gt;
|-&lt;br /&gt;
| EFA&lt;br /&gt;
| —&lt;br /&gt;
|-&lt;br /&gt;
| IΔ₀&lt;br /&gt;
| —&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
For any recursively enumerable and arithmetically sound axiomatic theory T, there exists an integer &amp;lt;math&amp;gt;N_T&amp;lt;/math&amp;gt; such that T cannot prove the values of BB(n) for any &amp;lt;math&amp;gt;n \ge N_T&amp;lt;/math&amp;gt;. For [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo–Fraenkel set theory]] (ZF), this value is known to be in the range:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;6 \le N_{ZF} \le 211&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This lower bound comes from the fact that [[BB(5)]] has been proven in Rocq.&amp;lt;ref group=&amp;quot;footnote&amp;quot;&amp;gt;The fact that this theorem has been proven in Rocq technically does not imply that the theorem must be provable in ZF, because the consistency strength of Rocq is actually higher than that of ZF. However, the BB(5) proof does not use any techniques that could not be formalized within ZF.&amp;lt;/ref&amp;gt; The upper bound comes from an explicit TM which halts if and only if ZFC has a finite proof of contradiction. Assuming ZF is consistent and sound, then it cannot prove whether or not it is consistent, hence it cannot prove whether or not this specific TM halts.&lt;br /&gt;
&lt;br /&gt;
Harvey Friedman spoke of embedding consistency statements within turing machines in a [https://fomarchive.ugent.be/2004-March/008003.html 2004 posting] on the &amp;quot;Foundations of Mathematics&amp;quot; mailing list. Scott Aaronson conjectured in his [[Busy Beaver Frontier]] survey that &amp;lt;math&amp;gt;N_{ZF} \le 20&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;N_{PA} \le 10&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;PA&amp;lt;/math&amp;gt; refers to the theory of [https://en.wikipedia.org/wiki/Peano%20axioms Peano Arithmetic]. Scott also mentioned (crediting Oscar Cunningham for the observation) that if there is an n-state machine that halts if and only if T is inconsistent, then &amp;lt;math&amp;gt;PA&amp;lt;/math&amp;gt; + “BB(n) = b” can prove the consistency of T, where b is the true value of BB(n).&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;Scott Aaronson. 2020. [https://www.scottaaronson.com/papers/bb.pdf The Busy Beaver Frontier]. SIGACT News 51, 3 (August 2020), 32–54. https://doi.org/10.1145/3427361.3427369&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Axiom of Choice ==&lt;br /&gt;
Due to [[wikipedia:Absoluteness_(logic)#Shoenfield&#039;s_absoluteness_theorem|Shoenfield&#039;s absoluteness theorem]], it is known that any TM proven non-halting in ZFC can also be proven non-halting in ZF (and the converse is trivially true), therefore&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;N_{ZFC} = N_{ZF}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Therefore we refer to ZF and &amp;lt;math&amp;gt;N_{ZF}&amp;lt;/math&amp;gt; throughout this article since adding the Axiom of Choice does not have any effect on Turing machine decidability.&lt;br /&gt;
&lt;br /&gt;
== History ==&lt;br /&gt;
In a broad sense, the concept of a mechanical or computable procedure that was equivalent to the consistency of a formal theory was discovered by Kurt Gödel&#039;s incompleteness theorem, which is notable for introducing a meta-mathematical encoding of the statement that &amp;quot;T can prove statement S&amp;quot; (the provability predicate) which is used in all these machines. This was further clarified by Alan Turing and Alonzo Church&#039;s work on a formal definition of computability.&lt;br /&gt;
&lt;br /&gt;
Although not a traditional turing machine, in 2012 Merlin Carl and Boris Z. Moroz constructed a [[Diophantine Equation]] which had solutions if and only if NBG (Von Neumann–Bernays–Gödel set theory) is inconsistent. NBG is a conservative extension of ZFC, so solving this equation is independent of ZFC.&amp;lt;ref&amp;gt;Carl, M., &amp;amp; Moroz, B. Z. (2012). &#039;&#039;On a Diophantine representation of the predicate of provability.&#039;&#039; Zapiski Nauchnykh Seminarov POMI, 407, 77-104. (Republished in 2014 in the Journal of Mathematical Sciences) [https://webdoc.sub.gwdg.de/ebook/serien/e/mpi_mathematik/2006/129.pdf (preprint)]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Zermelo–Fraenkel set theory (ZF) ==&lt;br /&gt;
There is no one authoritative source on the history of TMs independent of ZF, this is our best understanding of the history of TMs found. The results before 2026 are taken from Scott Aaronson&#039;s blog announcements and Busy Beaver Frontier or self-reported by the individuals who discovered them. The Aaronson-Yedida machine used a compiler called &#039;&#039;Laconic&#039;&#039;, which was then updated with NQL or &amp;quot;Not Quite Laconic&amp;quot;, while the 432 machines use a compiler built by Andrew J. Wade. Many machines after 2026 have been generated by AI without a formal compiler.&lt;br /&gt;
&lt;br /&gt;
Note that only the results with a linked formal verification are known to have such a verification, with the 7910 machine in particular relying on a result from Harvey Friedman that has no published proof.&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of ZF independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|7910&lt;br /&gt;
|May 2016&lt;br /&gt;
|Adam Yedidia and Scott Aaronson&lt;br /&gt;
|Yedidia and Aaronson 2016&amp;lt;ref&amp;gt;A. Yedidia and S. Aaronson. A relatively small Turing machine whose behavior is independent of set theory. Complex Systems, (25):4, 2016. https://arxiv.org/abs/1605.04343&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|1919&lt;br /&gt;
|15 May 2016&lt;br /&gt;
|Stefan O&#039;Rear&lt;br /&gt;
|[https://github.com/sorear/metamath-turing-machines/blob/master/machines/2016-zf-sorear-1919/zf.nql Github NQL file], [https://groups.google.com/g/metamath/c/OumBq83Ksqs/m/FogyOlLIBwAJ Metamath Group Announcement]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|748&lt;br /&gt;
|May 2016&lt;br /&gt;
|Stefan O’Rear&lt;br /&gt;
|[https://github.com/sorear/metamath-turing-machines/blob/master/machines/2017-zf-sorear-748/zf2.nql Github NQL], Busy Beaver Frontier&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|745&lt;br /&gt;
|July 2023&lt;br /&gt;
|Johannes Riebel&lt;br /&gt;
|Riebel 2023 Bachelor Thesis&amp;lt;ref&amp;gt;Riebel, Johannes (March 2023). &#039;&#039;[https://www.ingo-blechschmidt.eu/assets/bachelor-thesis-undecidability-bb748.pdf The Undecidability of BB(748): Understanding Gödel&#039;s Incompleteness Theorems]&#039;&#039; (PDF) (Bachelor&#039;s thesis). University of Augsburg.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|643&lt;br /&gt;
|July 2024&lt;br /&gt;
|Rohan Ridenour&lt;br /&gt;
|[https://github.com/CatsAreFluffy/metamath-turing-machines Github NQL], [https://scottaaronson.blog/?p=8131 Aaronson Announcement]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|636&lt;br /&gt;
|31 August 2024&lt;br /&gt;
|Rohan Ridenour&lt;br /&gt;
|[https://github.com/CatsAreFluffy/metamath-turing-machines Github NQL] ([https://github.com/CatsAreFluffy/metamath-turing-machines/commit/6fc33bef6ba8885d26aed94c83e88bdabbedb0f1 commit])&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|588&lt;br /&gt;
|12 July 2025&lt;br /&gt;
|Andrew J. Wade&lt;br /&gt;
|[https://github.com/andrew-j-wade/metamath-turing-machines Github NQL] ([https://github.com/andrew-j-wade/metamath-turing-machines/commit/30d2e3194866615f68dd2f5101cb300fb039adca commit])&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|549&lt;br /&gt;
|16 July 2025&lt;br /&gt;
|Andrew J. Wade&lt;br /&gt;
|[https://github.com/andrew-j-wade/metamath-turing-machines Github NQL] ([https://github.com/andrew-j-wade/metamath-turing-machines/commit/5d676aec074a94f598959cb3b7733a8f7781762f commit])&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|432&lt;br /&gt;
|19 Aug 2025&lt;br /&gt;
|Andrew J. Wade&lt;br /&gt;
|[https://codeberg.org/ajwade/turing_machine_explorer/commit/33b30300054242201a95679aacf7e74312bd8803b0df9a85d2314095efd6804e git commit]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|335&lt;br /&gt;
|11 Oct 2026&lt;br /&gt;
|Jeff Ketchersid&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1559077555158392844 discord message]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|254&lt;br /&gt;
|13 Oct 2026&lt;br /&gt;
|[https://x.com/_mira___mira_ Mira] with use of ChatGPT, formalized by [https://github.com/jeff87654 Jeff Ketchersid] with Claude&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/zf-254/ZF/m254 Github]&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/zf-254/ZF/m254 Rocq file]&lt;br /&gt;
|-&lt;br /&gt;
|230&lt;br /&gt;
|19 Oct 2026&lt;br /&gt;
|[https://x.com/ElliotGlazer Elliot Glazer] with use of ChatGPT, formalized with GPT and Claude&lt;br /&gt;
|[https://github.com/elliotglazer/k230-rocq Github]&lt;br /&gt;
|[https://github.com/elliotglazer/k230-rocq Rocq file]&lt;br /&gt;
|-&lt;br /&gt;
|215&lt;br /&gt;
|21 Oct 2026&lt;br /&gt;
|[[wikipedia:Cleo_(mathematician)|Vladimir Reshetnikov]] formalized with Claude&lt;br /&gt;
|[https://github.com/VladimirReshetnikov/ProveIt/tree/c9dc79323429112c698100f3226a6e4d56c8b782/Computability/BusyBeaver/Research/ZFC/k225-formal Github]&lt;br /&gt;
|[https://github.com/VladimirReshetnikov/ProveIt/tree/c9dc79323429112c698100f3226a6e4d56c8b782/Computability/BusyBeaver/Research/ZFC/k225-formal/verification/k215 Rocq file]&lt;br /&gt;
|-&lt;br /&gt;
|211&lt;br /&gt;
|17 Nov 2026&lt;br /&gt;
|Shivam Patel&lt;br /&gt;
|[[Media:K211-paper.pdf|Paper]]&lt;br /&gt;
|[[Media:K211-review-by-email.zip|Lean proof and replay]]&lt;br /&gt;
|}&lt;br /&gt;
[[File:ZFC Machine 254.png|thumb|The transition table of the ZF machine with 254 states. The initial state is 1.]]&lt;br /&gt;
Wade&#039;s 432-state champion also omits the [[wikipedia:Axiom_of_regularity|axiom of regularity]], as ZF-regularity is also equiconsistent with ZF.&lt;br /&gt;
&lt;br /&gt;
== New Foundations (NF) ==&lt;br /&gt;
&#039;&#039;New Foundations&#039;&#039; is a formal theory created by W.V.O. Quine in 1937, based around the principle of stratified comprehension of sets. It is known to be stronger than Peano Arithmetic and second-order arithmetic, but weaker than ZF. The Github page contains a proof in Lean that it is equiconsistent with Mac Lane set theory, which is a novel result as of the time of writing (November 2026). Mac Lane set theory is far more mainstream than NF, so the following machine could be seen as an efficient way of determining which Busy Beaver value MAC cannot verify.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of New Foundations (NF) independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|210&lt;br /&gt;
|8 November 2026&lt;br /&gt;
|@wlad-svennik&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/wlad-svennik/notes/tree/main/nf-bb210]&lt;br /&gt;
|-&lt;br /&gt;
|198&lt;br /&gt;
|12 November 2026&lt;br /&gt;
|@wlad-svennik&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/wlad-svennik/notes/commit/0a0c8fa5992dfdee35f18fcb718ec278378b2740]&lt;br /&gt;
|-&lt;br /&gt;
|192&lt;br /&gt;
|18 November 2026&lt;br /&gt;
|@wlad-svennik&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/wlad-svennik/notes/releases/tag/nf192-countdown]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== User-friendly theory ===&lt;br /&gt;
&lt;br /&gt;
The TM searches for an inconsistency in the theory &amp;quot;&#039;&#039;&#039;FunctionNF&#039;&#039;&#039;&amp;quot;. It is defined to equal stratified λ-calculus minus pairing, minus case-expressions, plus full functional extensionality, plus an equality checker.&amp;lt;pre&amp;gt;Terms     t ::= x | t u | λx.t | (s ≐ t) | ⊤ | ⊥&lt;br /&gt;
&lt;br /&gt;
Depth     Each subterm occurrence has a depth relative to the term it sits in:&lt;br /&gt;
            the term itself        0&lt;br /&gt;
            in  t u   at depth n:  t at n+1,  u at n&lt;br /&gt;
            in  λx.t  at depth n:  t at n−1&lt;br /&gt;
            in  s ≐ t at depth n:  s and t at n&lt;br /&gt;
&lt;br /&gt;
Formation λx.t is a term iff every free occurrence of x in t has depth 0 in t.&lt;br /&gt;
          Nothing else is constrained: other variables may occur at any depths.&lt;br /&gt;
&lt;br /&gt;
Axioms    (β)    (λx.t) u = t[u/x]&lt;br /&gt;
          (ext)  (∀x. f x = g x) → f = g&lt;br /&gt;
          (≐)    s = t → (s ≐ t) = ⊤        s ≠ t → (s ≐ t) = ⊥&lt;br /&gt;
          (nt)   ⊤ ≠ ⊥&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The logic is ordinary first-order logic with equality, so unstratified &#039;&#039;formulas&#039;&#039; are allowed. Only λ is restricted.&lt;br /&gt;
&lt;br /&gt;
The Github link contains proofs in Lean that:&lt;br /&gt;
&lt;br /&gt;
* NF interprets FunctionNF (which is very short),&lt;br /&gt;
* FunctionNF in turn interprets NFU+Infinity (which is similar to Specker&#039;s proof of the &amp;quot;Axiom of Infinity&amp;quot; within NF),&lt;br /&gt;
* NFU+Infinity interprets NF, which is a novel and hard result that is not yet found in the literature,&lt;br /&gt;
* NFU+Infinity interprets Mac Lane set theory,&lt;br /&gt;
* Mac Lane set theory interprets TSTI (Theory of Simple Types plus (Axiom of) Infinity),&lt;br /&gt;
* TSTI is equiconsistent with NFU+Infinity.&lt;br /&gt;
&lt;br /&gt;
So overall, the machine halts iff there exists an inconsistency in &#039;&#039;any&#039;&#039; of the above theories. Regardless, Mac Lane set theory is actually &#039;&#039;weaker&#039;&#039; than NF in terms of &#039;&#039;intepretability strength&#039;&#039;, as opposed to just consistency strength.&lt;br /&gt;
&lt;br /&gt;
=== Implementation theory: The combinatory calculus ===&lt;br /&gt;
FunctionalNF is not implemented directly. Instead, a massively leaner form is implemented, in the form of a [https://en.wikipedia.org/wiki/combinatory_logic combinatory logic] which consists of just three nonlogical primitives:&lt;br /&gt;
&lt;br /&gt;
* Binary application &amp;lt;math&amp;gt;xy&amp;lt;/math&amp;gt;, associated to the left.&lt;br /&gt;
* A constant &amp;lt;math&amp;gt;q&amp;lt;/math&amp;gt;. This is a fixed-point tester.&lt;br /&gt;
* A binary function &amp;lt;math&amp;gt;H(x,y)&amp;lt;/math&amp;gt;. This is a merger between the &#039;&#039;K&#039;&#039; combinator and a [https://en.wikipedia.org/wiki/skolem_function Skolem function] for function extensionality.&lt;br /&gt;
&lt;br /&gt;
Define the convenient shorthands&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\begin{aligned}&lt;br /&gt;
K(x)&amp;amp;:=H(x,x),\\&lt;br /&gt;
r&amp;amp;:=(qq)q,\\&lt;br /&gt;
b&amp;amp;:=(q(qq))r.&lt;br /&gt;
\end{aligned}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The six axioms, with all free variables universally quantified, are:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! No.&lt;br /&gt;
! Axiom&lt;br /&gt;
! Role&lt;br /&gt;
|-&lt;br /&gt;
| 1&lt;br /&gt;
| &amp;lt;math&amp;gt;H(x,x)y=x&amp;lt;/math&amp;gt;&lt;br /&gt;
| Constant functions&lt;br /&gt;
|-&lt;br /&gt;
| 2&lt;br /&gt;
| &amp;lt;math&amp;gt;bxyz=(xH(z,z))(yz)&amp;lt;/math&amp;gt;&lt;br /&gt;
| Combinatory composition&lt;br /&gt;
|-&lt;br /&gt;
| 3&lt;br /&gt;
| &amp;lt;math&amp;gt;xy=y\implies(qx)y=b&amp;lt;/math&amp;gt;&lt;br /&gt;
| Positive equality test&lt;br /&gt;
|-&lt;br /&gt;
| 4&lt;br /&gt;
| &amp;lt;math&amp;gt;xy\ne y\implies(qx)y=r&amp;lt;/math&amp;gt;&lt;br /&gt;
| Negative equality test&lt;br /&gt;
|-&lt;br /&gt;
| 5&lt;br /&gt;
| &amp;lt;math&amp;gt;xH(x,y)=yH(x,y)\implies x=y&amp;lt;/math&amp;gt;&lt;br /&gt;
| Extensionality witness&lt;br /&gt;
|-&lt;br /&gt;
| 6&lt;br /&gt;
| &amp;lt;math&amp;gt;q(qq)\ne qq&amp;lt;/math&amp;gt;&lt;br /&gt;
| Nondegeneracy&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
In particular, &amp;lt;math&amp;gt;K(x)y=x&amp;lt;/math&amp;gt; follows immediately from axiom 1. It is not a separate axiom.&lt;br /&gt;
&lt;br /&gt;
=== Fragment of First-Order Logic ===&lt;br /&gt;
Notably, we &#039;&#039;&#039;do not&#039;&#039;&#039; implement the whole of First-Order Logic: The quantifier ∀ can be defined &#039;&#039;internally&#039;&#039; to CombNF / FunctionalNF. Moreover, we don&#039;t even implement variables thanks to our use of combinatory logic. The only fragment of First-Order Logic we implement consists of &amp;quot;=&amp;quot;, the above function symbols, and propositional logic. This is similar to [https://en.wikipedia.org/wiki/primitive_recursive_arithmetic Primitive Recursive Arithmetic] and [https://en.wikipedia.org/wiki/system_T System T].&lt;br /&gt;
&lt;br /&gt;
=== What the symbols do ===&lt;br /&gt;
&amp;lt;math&amp;gt;q&amp;lt;/math&amp;gt; is an equality tester:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;(qx)y=&lt;br /&gt;
\begin{cases}&lt;br /&gt;
b,&amp;amp;xy=y,\\&lt;br /&gt;
r,&amp;amp;xy\ne y.&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;H&amp;lt;/math&amp;gt; has two jobs. On the diagonal it constructs constant functions:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;H(x,x)y=x.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Off the diagonal it supplies a witness to distinguish two functions whenever they are different:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;x\ne y\implies xH(x,y)\ne yH(x,y).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; supplies the composition law&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;bxyz=x(K(z))(yz).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt; are terms, not primitive constants.&lt;br /&gt;
&lt;br /&gt;
Once again, we do &#039;&#039;&#039;not&#039;&#039;&#039; implement the whole of First-Order Logic.&lt;br /&gt;
&lt;br /&gt;
The formalized proof for this machine&#039;s NF-undecidability is formalized as an &#039;&#039;external&#039;&#039; Lean metatheorem rather than a completed PA-internal derivation. As of this publication, a fresh independent clean build and community review have not been reported.&lt;br /&gt;
&lt;br /&gt;
== Peano Arithmetic (PA) ==&lt;br /&gt;
For Peano Arithmetic, the ZF and NF independent machines are upper bounds. In general, a machine that is independent of a theory will also be independent of any theory with strictly lower [[wikipedia:Equiconsistency#Consistency_strength|consistency strength]]. For the theories in this article, Con(ZFC+Subtle)-&amp;gt;Con(ZFC)-&amp;gt;Con(NF)-&amp;gt;Con(PA).&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of Peano Arithmetic (PA) independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|372&lt;br /&gt;
|11 February 2026&lt;br /&gt;
|@LegionMammal978 (Matthew House)&lt;br /&gt;
|[https://github.com/LegionMammal978/turing_machine_explorer/blob/main/pa.py Github]&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
This machine takes Wade&#039;s ZF champion and replaces the set theory axioms with one axiom schema of &amp;quot;adjunction + separation&amp;quot;, which has been shown to interpret PA.&amp;lt;ref&amp;gt;https://mathoverflow.net/questions/508137/interpreting-pa-with-only-adjunction-separation/508161&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Large cardinals ==&lt;br /&gt;
These tables are for theories stronger than ZFC.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of ZFC + &amp;quot;There exist arbitrarily large subtle cardinals&amp;quot; independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|493&lt;br /&gt;
|25 February 2026&lt;br /&gt;
|@LegionMammal978&lt;br /&gt;
|[https://github.com/Saoi2/turing_machine_explorer/blob/main/subtle.tm Github]&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
This machine takes Wade&#039;s ZF champion and adds the [[wikipedia:Axiom_of_choice|axiom of Choice]] and a statement from Harvey Friedman (Proposition 4.3 of [https://bpb-us-w2.wpmucdn.com/u.osu.edu/dist/1/1952/files/2014/01/PrimitiveIndResults071302-189vmn0.pdf &amp;quot;Primitive Independence Results&amp;quot;])&amp;lt;ref&amp;gt;H. Friedman, &amp;quot;[https://bpb-us-w2.wpmucdn.com/u.osu.edu/dist/1/1952/files/2014/01/PrimitiveIndResults071302-189vmn0.pdf Primitive Independence Results]&amp;quot; (2002). Accessed February 2026.&amp;lt;/ref&amp;gt; which Friedman showed to be equivalent to &amp;quot;There exist arbitrarily large subtle cardinals&amp;quot; over ZFC.&lt;br /&gt;
&lt;br /&gt;
For reference, this theory is between the strength of &amp;quot;strongly unfoldable&amp;quot; and &amp;quot;&amp;lt;math&amp;gt;0^\sharp&amp;lt;/math&amp;gt; exists&amp;quot; on the [[wikipedia:Large_cardinal|large cardinal hierarchy]] on Wikipedia.&lt;br /&gt;
&lt;br /&gt;
Note: The initial machine produced in 2016 by Yedidia and Aaronson is designed to halt iff a certain statement created by Harvey Friedman is true.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt; According to Friedman (without a published proof), this statement is independent of the theory &amp;quot;Stationary Ramsey Property&amp;quot; or &#039;&#039;SRP&#039;&#039;, which is equiconsistent with the theory &amp;lt;math&amp;gt;ZFC + \{\text{``There is a }k\text{-subtle cardinal``}\mid k\in\N\}&amp;lt;/math&amp;gt; which is also between the strength of &amp;quot;strongly unfoldable&amp;quot; and &amp;quot;&amp;lt;math&amp;gt;0^\sharp&amp;lt;/math&amp;gt; exists&amp;quot; on the large cardinal hierarchy.&amp;lt;ref&amp;gt;tlonuqbar, &amp;quot;[https://mathoverflow.net/questions/508364/what-is-the-consistency-strength-of-srp-stationary-ramsey-property What is the consistency strength of SRP (Stationary Ramsey Property)?]&amp;quot; (2026). MathOverflow post, accessed February 2026.&amp;lt;/ref&amp;gt; However, the theory used by the BB(493) machine is also independent of this theory.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+History of ZF + &amp;quot;There exists a Berkeley cardinal&amp;quot; independent TMs&lt;br /&gt;
!States&lt;br /&gt;
!Date&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Source&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|1399&lt;br /&gt;
|8 November 2026&lt;br /&gt;
|@Meganeuridae&lt;br /&gt;
|[https://github.com/Meganeuridae/large-cardinal-tms/blob/main/berkeley-rocq/machine/machine.tm Github]&lt;br /&gt;
|[https://github.com/Meganeuridae/large-cardinal-tms/tree/main/berkeley-rocq/coq/Berkeley Rocq file]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
Berkeley cardinals are perhaps the strongest family of large cardinals considered, initially proposed by Hugh Woodin at a lecture at UC Berkeley as an axiom that was &amp;quot;obviously inconsistent&amp;quot;.{{Citation needed}} However, no inconsistency has been found and many people now believe it may be consistent. Berkeley cardinals are known to be inconsistent with the axiom of choice.&lt;br /&gt;
&lt;br /&gt;
== Footnotes ==&lt;br /&gt;
&amp;lt;references group=&amp;quot;footnote&amp;quot;/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Zoology]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Fractran&amp;diff=10833</id>
		<title>Fractran</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Fractran&amp;diff=10833"/>
		<updated>2026-11-15T16:37:09Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Definition */ change variable for Omega(s) to avoid confusion&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Fractran&#039;&#039;&#039; (originally styled FRACTRAN) is an esoteric [[Turing complete]] model of computation invented by John Conway in 1987.&amp;lt;ref&amp;gt;Conway, John H. (1987). &amp;quot;FRACTRAN: A Simple Universal Programming Language for Arithmetic&amp;quot;. &#039;&#039;Open Problems in Communication and Computation&#039;&#039;. Springer-Verlag New York, Inc. pp. 4–26. &amp;lt;nowiki&amp;gt;http://doi.org/10.1007/978-1-4612-4808-8_2&amp;lt;/nowiki&amp;gt;&amp;lt;/ref&amp;gt; In this model a program is simply a finite list of fractions (rational numbers), the program state is an integer. For more details see https://en.wikipedia.org/wiki/FRACTRAN.&lt;br /&gt;
&lt;br /&gt;
Discord user Coda came up with a way to transform any Fractran program into a Turing Machine, see [https://discord.com/channels/960643023006490684/1438019511155691521/1441844795613122560 source].&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;BB_fractran&#039;&#039;&#039;(n) or &#039;&#039;&#039;BBf&#039;&#039;&#039;(n) is the Busy Beaver function for Fractran programs. Holdouts lists by Jason Yuen (@-d): [https://github.com/int-y1/BBFractran/blob/main/holdout/README.md Holdouts lists]&lt;br /&gt;
&lt;br /&gt;
== Definition ==&lt;br /&gt;
A Fractran program is a list of rational numbers &amp;lt;math&amp;gt;[q_0, q_1, \dots, q_{k-1}]&amp;lt;/math&amp;gt; called rules and a Fractran state is an integer &amp;lt;math&amp;gt;s \in \mathbb{Z}&amp;lt;/math&amp;gt;. The numerator and denominator of any rational number fraction do not share any prime factors (they are in reduced form). We say that a rule &amp;lt;math&amp;gt;q_i&amp;lt;/math&amp;gt; applies to state &amp;lt;math&amp;gt;s&amp;lt;/math&amp;gt; if &amp;lt;math&amp;gt;s \cdot q_i \in \mathbb{Z}&amp;lt;/math&amp;gt;. If no rule applies, we say that the computation has halted otherwise we apply the first applicable rule at each step. In that case we say &amp;lt;math&amp;gt;s \to t&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;t = s \cdot q_i&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;i = \min \{ i : s \cdot q_i \in \mathbb{Z} \}&amp;lt;/math&amp;gt;. As with [[Turing machines]], we will write &amp;lt;math&amp;gt;s \xrightarrow{N} t&amp;lt;/math&amp;gt; if &amp;lt;math&amp;gt;s \to s_1 \to \cdots \to s_{N-1} \to t&amp;lt;/math&amp;gt; (s goes to t after N steps) and &amp;lt;math&amp;gt;s \to^* t&amp;lt;/math&amp;gt; or &amp;lt;math&amp;gt;s \to^+ t&amp;lt;/math&amp;gt; if &amp;lt;math&amp;gt;s \xrightarrow{N} t&amp;lt;/math&amp;gt; for some N≥0 or N≥1 (respectively). We say that a program has runtime N (or halts in N steps) starting in state s if &amp;lt;math&amp;gt;s \xrightarrow{N} t&amp;lt;/math&amp;gt; and computation halts on t.&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;\Omega(n)&amp;lt;/math&amp;gt; be the total number of prime factors of a positive integer n. In other words, &amp;lt;math&amp;gt;\Omega(2^{a_0} 3^{a_1} \cdots p_n^{a_n}) = \sum_{k=0}^n a_k&amp;lt;/math&amp;gt;. Then given a rule &amp;lt;math&amp;gt;\frac{a}{b}&amp;lt;/math&amp;gt; we say that &amp;lt;math&amp;gt;\text{size} \left( \frac{a}{b} \right) = \Omega(a) + \Omega(b)&amp;lt;/math&amp;gt;. And the size of a Fractran program &amp;lt;math&amp;gt;[q_0, q_1, \dots, q_{k-1}]&amp;lt;/math&amp;gt; is &amp;lt;math&amp;gt;k + \sum_{i=0}^{k-1} \text{size}(q_i)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
BB_fractran(n) or BBf(n) is the maximum runtime starting in state 2 for all halting Fractran programs of size n. It is a non-computable function akin to the [[Busy Beaver Functions]] since Fractran is Turing Complete.&lt;br /&gt;
&lt;br /&gt;
Σf(n) is the maximum size of the result state (&amp;lt;math&amp;gt;\Omega(s)&amp;lt;/math&amp;gt;) across all halting Fractran programs of size n.&lt;br /&gt;
&lt;br /&gt;
== Vector Representation ==&lt;br /&gt;
Fractran programs are not easy to interpret, in fact it may be completely unclear at first that they can perform any computation at all. One of the key insights is to represent all numbers (states and rules) in their prime factorization form. For example, we can use a vector &amp;lt;math&amp;gt;[ a_0, a_1, \dots, a_{n-1} ] \in \mathbb{Z}^n&amp;lt;/math&amp;gt; to represent the number &amp;lt;math&amp;gt;2^{a_0} 3^{a_1} \cdots p_{n-1}^{a_{n-1}}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Let the vector representation (for a sufficiently large n) for a state &amp;lt;math&amp;gt;a = 2^{a_0} 3^{a_1} \cdots p_{n-1}^{a_{n-1}}&amp;lt;/math&amp;gt; be &amp;lt;math&amp;gt;v(a) = [ a_0, a_1, \dots, a_{n-1} ] \in \mathbb{N}^n&amp;lt;/math&amp;gt; and the vector representation for a rule &amp;lt;math&amp;gt;\frac{a}{b}&amp;lt;/math&amp;gt; be &amp;lt;math&amp;gt;v \left( \frac{a}{b} \right) = v(a) - v(b) \in \mathbb{Z}^n&amp;lt;/math&amp;gt; (Note that this is just an extension of the original definition extended to allow negative &amp;lt;math&amp;gt;a_i&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
Now, rule q applies to state s iff &amp;lt;math&amp;gt;v(s) + v(q) \in \mathbb{N}^n&amp;lt;/math&amp;gt; (all components of the vector are ≥0) and if &amp;lt;math&amp;gt;s \to t&amp;lt;/math&amp;gt; then &amp;lt;math&amp;gt;v(t) = v(s) + v(q)&amp;lt;/math&amp;gt;. So the Fractran multiplication model is completely equivalent to the vector adding model. For presentation, we will represent a Fractran program with a matrix where each row is the vector representation for a rule.&lt;br /&gt;
&lt;br /&gt;
For example, the BBf(15) champion (&amp;lt;code&amp;gt;[1/45, 4/5, 3/2, 25/3]&amp;lt;/code&amp;gt;) in vector representation would be:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   0 &amp;amp; -2 &amp;amp; -1 \\&lt;br /&gt;
   2 &amp;amp;  0 &amp;amp; -1 \\&lt;br /&gt;
  -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  2&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In this representation, it becomes much easier to reason about Fractran programs and describe general rules. It is also very easy to calculate the size of a rule or program in vector representation. It is the sum of absolute values of all elements in the matrix + number of rules (number of rows).&lt;br /&gt;
&lt;br /&gt;
=== Relationship to VAS / Petri Nets ===&lt;br /&gt;
Using vector representation, Fractran programs are a deterministic version of [[wikipedia:Vector_addition_system|Vector Addition Systems (VAS)]] (and, equivalently, [[wikipedia:Petri_net|Petri Nets]]). VAS are identical to Fractran programs in vector representation except that the rules are unordered and non-deterministic, they are used to model distributed systems where precise order of rule execution cannot be predicted. Interestingly, many problems about VAS are actually decidable, but their runtimes are extremely slow. Notably, the reachability problem (given states A and B are there a sequence of rules so that &amp;lt;math&amp;gt;A \to^* B&amp;lt;/math&amp;gt;) is &amp;quot;Ackermann-complete&amp;quot; meaning that the optimal algorithm has worst-case runtime akin to the famously fast-growing Ackermann function.&amp;lt;ref&amp;gt;Czerwiński, Wojciech; Orlikowski, Łukasz (2021). &#039;&#039;Reachability in Vector Addition Systems is Ackermann-complete&#039;&#039;. 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). https://arxiv.org/abs/2104.13866.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Visualizing Fractran Programs&#039; Space-Time Diagrams ==&lt;br /&gt;
Katelyn Doucette&#039;s Fractran space-time diagram visualizer produces the following space-time diagrams for some notable Fractran Programs, under the following principle: Each color represents a prime factor. Left -&amp;gt; right colors indicating the index of that register, and how wide the color is representing how big the value is at that step. Source code: https://github.com/Laturas/FractranVisualizer&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
|[[File:Fractran_22_Cryptid.webp|alt=The space-time diagram of Fenrir|460x460px]]&lt;br /&gt;
The space-time diagram of Fenrir&lt;br /&gt;
|[[File:Hydra.webp|alt=The space-time diagram of Hydra.|460x460px]]&lt;br /&gt;
The space-time diagram of Hydra.&lt;br /&gt;
|[[File:Bbf21 champ full.png|alt=The space-time diagram of the BBf(21) champion.|400x400px]]&lt;br /&gt;
&lt;br /&gt;
The space-time diagram of the BBf(21) champion. The width &amp;amp; height of the diagram can be set in the visualizer.&lt;br /&gt;
|[[File:Space_Needle.webp|alt=The space-time diagram of Space Needle.|460x460px]]&lt;br /&gt;
The space-time diagram of Space Needle.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Deciders ==&lt;br /&gt;
[[File:Fractran deciders.png|alt=Fractran deciders|thumb|All Fractran deciders summarized and their relations, shared by Daniel Yuan on [https://discord.com/channels/960643023006490684/1438019511155691521/1439001835904958655 14 Nov 2025]]]Many specialized deciders have been invented to prove Fractran programs non-halting. See image at right. There are three extra deciders: [https://discord.com/channels/960643023006490684/1438019511155691521/1449775657554022531 Spanning Vectors Masked,] which should be very effective, but implementing it is in-progress, a version of Spanning Vectors Masked - [https://discord.com/channels/960643023006490684/1438019511155691521/1453217977385091092 Masked Linear Invariant] - which is very powerful, and some holdouts were removed by [[User:Sligocki|Shawn Ligocki]] with [https://lsv.ens-paris-saclay.fr/Software/fast/ FAST] (Fast Acceleration of Symbolic Transition systems), a pre-existing general tool.&lt;br /&gt;
&lt;br /&gt;
-d released a new decider on 25 Jan 2026: [https://discord.com/channels/960643023006490684/1438019511155691521/1464873923647639703 Beeping Permutation].&lt;br /&gt;
&lt;br /&gt;
TODO: create pages about the deciders.&lt;br /&gt;
&lt;br /&gt;
== Champions ==&lt;br /&gt;
The table of champions is split into two pieces: the first for small champions (up to BBf(14)) which all share the same relatively simple behavior (sequential programs) is collapsed by default; the second for champions BBf(15) and beyond which have more complex and varied behavior.&lt;br /&gt;
All small champions as well as the first few larger ones were discovered and proven maximal by Jason Yuen (@-d) in their initial enumeration on [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]. &lt;br /&gt;
&lt;br /&gt;
BBf(21) and below are solved. BBf(22) is the smallest domain to contain a Cryptid, and all other machines for BBf(22) are solved.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Small Champions&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!BBf(n)&lt;br /&gt;
!Example Champion&lt;br /&gt;
!Vector Representation&lt;br /&gt;
|-&lt;br /&gt;
| 2 || 1 || &amp;lt;code&amp;gt;[1/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 3 || 1 || &amp;lt;code&amp;gt;[3/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp; 1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 4 || 1 || &amp;lt;code&amp;gt;[9/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp; 2&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 5 || 2 || &amp;lt;code&amp;gt;[3/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  1 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 6 || 3 || &amp;lt;code&amp;gt;[9/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  2 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 7 || 4 || &amp;lt;code&amp;gt;[27/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  3 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 8 || 5 || &amp;lt;code&amp;gt;[81/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  4 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 9 || 6 || &amp;lt;code&amp;gt;[243/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  5 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 10 || 7 || &amp;lt;code&amp;gt;[729/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  6 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 11 || 10 || &amp;lt;code&amp;gt;[27/2, 25/3, 1/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  3 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  2 \\&lt;br /&gt;
   0 &amp;amp;  0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 12 || 13 || &amp;lt;code&amp;gt;[81/2, 25/3, 1/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  4 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  2 \\&lt;br /&gt;
   0 &amp;amp;  0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 13 || 17 || &amp;lt;code&amp;gt;[81/2, 125/3, 1/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  4 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  3 \\&lt;br /&gt;
   0 &amp;amp;  0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 14 || 21 || &amp;lt;code&amp;gt;[243/2, 125/3, 1/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  5 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  3 \\&lt;br /&gt;
   0 &amp;amp;  0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!BBf(n)&lt;br /&gt;
!Example Champion&lt;br /&gt;
!Vector Representation&lt;br /&gt;
!Champion Found&lt;br /&gt;
!Holdouts Proven&lt;br /&gt;
|-&lt;br /&gt;
| 15 || 28 || &amp;lt;code&amp;gt;[1/45, 4/5, 3/2, 25/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   0 &amp;amp; -2 &amp;amp; -1 \\&lt;br /&gt;
   2 &amp;amp;  0 &amp;amp; -1 \\&lt;br /&gt;
  -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  2&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]&lt;br /&gt;
|-&lt;br /&gt;
| 16 || 53 || &amp;lt;code&amp;gt;[1/45, 4/5, 3/2, 125/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   0 &amp;amp; -2 &amp;amp; -1 \\&lt;br /&gt;
   2 &amp;amp;  0 &amp;amp; -1 \\&lt;br /&gt;
  -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  3&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]&lt;br /&gt;
|-&lt;br /&gt;
| 17 || 107 || &amp;lt;code&amp;gt;[5/6, 49/2, 3/5, 40/7]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   -1 &amp;amp;  0 &amp;amp;  0 &amp;amp;  2 \\&lt;br /&gt;
    0 &amp;amp;  1 &amp;amp; -1 &amp;amp;  0 \\&lt;br /&gt;
    3 &amp;amp;  0 &amp;amp;  1 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434313398799175710 1 Nov 2025]&lt;br /&gt;
|Daniel Yuan (@dyuan01) [https://discord.com/channels/960643023006490684/1362008236118511758/1434771877376557086 3 Nov 2025]&lt;br /&gt;
|-&lt;br /&gt;
| 18 || 211 || &amp;lt;code&amp;gt;[5/6, 49/2, 3/5, 80/7]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   -1 &amp;amp;  0 &amp;amp;  0 &amp;amp;  2 \\&lt;br /&gt;
    0 &amp;amp;  1 &amp;amp; -1 &amp;amp;  0 \\&lt;br /&gt;
    4 &amp;amp;  0 &amp;amp;  1 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1435313806493614131 4 Nov 2025]&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1436661215911870584 8 Nov 2025]&lt;br /&gt;
|-&lt;br /&gt;
| 19 || 370 || &amp;lt;code&amp;gt;[5/6, 49/2, 3/5, 160/7]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   -1 &amp;amp;  0 &amp;amp;  0 &amp;amp;  2 \\&lt;br /&gt;
    0 &amp;amp;  1 &amp;amp; -1 &amp;amp;  0 \\&lt;br /&gt;
    5 &amp;amp;  0 &amp;amp;  1 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|@creeperman7002 [https://discord.com/channels/960643023006490684/1362008236118511758/1435763150489387090 5 Nov 2025]&lt;br /&gt;
|Decider: Daniel Yuan (@dyuan01) [https://discord.com/channels/960643023006490684/1438019511155691521/1438558242388312165 13 Nov 2025]&lt;br /&gt;
3 Holdouts: Racheline &amp;amp; Shawn Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|20&lt;br /&gt;
|746&lt;br /&gt;
|&amp;lt;code&amp;gt;[7/15, 22/3, 6/77, 5/2, 9/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
    1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    -1 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1438019511155691521/1438480761169776733 13 Nov 2025]&lt;br /&gt;
|Decider: Jason Yuen (@-d) &lt;br /&gt;
([https://github.com/int-y1/BBFractran/tree/main/holdout Enum+initial]) &lt;br /&gt;
Daniel Yuan (@dyuan01) [https://discord.com/channels/960643023006490684/1438019511155691521/1438559507579011194 13] and [https://discord.com/channels/960643023006490684/1438019511155691521/1438996636389998773 14 Nov 2025]&lt;br /&gt;
&lt;br /&gt;
Shawn Ligocki (@sligocki) [https://discord.com/channels/960643023006490684/1438019511155691521/1447069110541484146 7] and [https://discord.com/channels/960643023006490684/1438019511155691521/1453213088630444168 24 Dec 2025]&lt;br /&gt;
6 Holdouts: Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1438019511155691521/1452913055053778945 23 Dec 2025]&lt;br /&gt;
|-&lt;br /&gt;
|21&lt;br /&gt;
|31,957,632&lt;br /&gt;
|&amp;lt;code&amp;gt;[7/15, 4/3, 27/14, 5/2, 9/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 \\&lt;br /&gt;
    2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     3 &amp;amp;     0 &amp;amp;    -1 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1438019511155691521/1439759182587891894 16 Nov 2025]&lt;br /&gt;
|No holdouts remain. Claude Opus 4.6&#039;s proof of nonhalting of all the 140 holdouts: [https://discord.com/channels/960643023006490684/1438019511155691521/1485168251997786173 28 March 2026]&lt;br /&gt;
|-&lt;br /&gt;
|22&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 1.146 \times 10^{62}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/12, 9/10, 14/3, 11/2, 5/7, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Shawn Ligocki (@sligocki) [https://discord.com/channels/960643023006490684/1438019511155691521/1448912286713384961 11 Dec 2025] and Jason Yuen (@-d)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1448953682237460480 &amp;lt;nowiki&amp;gt;[1]&amp;lt;/nowiki&amp;gt;]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|3 holdouts remain. Claude Opus 4.6 gave a proof of all machines but the 3 Fenrir Cryptids, see [https://discord.com/channels/960643023006490684/1438019511155691521/1493027835559022824 Discord].&lt;br /&gt;
&lt;br /&gt;
The holdouts list whose elements are exactly the 3 Fenrir Cryptids on GitHub: [https://github.com/int-y1/BBFractran/blob/main/holdout/sz22_3.txt sz22_3.txt]&lt;br /&gt;
Known [[Cryptid|Cryptids]]: &lt;br /&gt;
&lt;br /&gt;
# Fenrir&lt;br /&gt;
|-&lt;br /&gt;
|23&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 4.393 \times 10^{124}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;[10/3, 9/14, 5/4, 121/2, 7/5, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
   -2 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     2 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Shawn Ligocki (@sligocki) [https://discord.com/channels/960643023006490684/1438019511155691521/1510781736374763702 1 Jun 2026]&lt;br /&gt;
|21,295 holdouts remain. [https://discord.com/channels/960643023006490684/1438019511155691521/1511579969825013811 2 Jun 2026]&lt;br /&gt;
By August 5th, 2026, the unofficial holdouts count had been reduced to 13. [https://github.com/int-y1/BBFractran/blob/main/holdout/sz23_13_unofficial.txt sz23_13_unofficial.txt]&lt;br /&gt;
Known [[Cryptid|Cryptids]]: &lt;br /&gt;
&lt;br /&gt;
# 11 Hydra-like Cryptids (including Frankenstein&#039;s Monster and Antihydra-like Cryptid)&lt;br /&gt;
|-&lt;br /&gt;
|24&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 9.000 \times 10^{14448}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;[14/15, 1/6, 11/3, 441/2, 5/7, 15/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;     0 &amp;amp;     2 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1438019511155691521/1547182811713380383 9 Sep 2026]&lt;br /&gt;
|231,432 holdouts remain. [https://github.com/int-y1/BBFractran/blob/main/holdout/sz24_231432.txt 12 Sep 2026]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Behavior of Champions ===&lt;br /&gt;
&lt;br /&gt;
==== Sequential programs ====&lt;br /&gt;
All champions up to BBf(14) have very simple behavior. They are all of the form: &amp;lt;math&amp;gt;\left[ \frac{3^{a_1}}{2}, \frac{5^{a_2}}{3}, \dots, \frac{p_n^{a_k}}{p_{k-1}}, \frac{1}{p_k} \right]&amp;lt;/math&amp;gt; or in vector representation (limited to k=4):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; a_1 &amp;amp;   0 &amp;amp;   0 &amp;amp;   0 \\&lt;br /&gt;
    0 &amp;amp;  -1 &amp;amp; a_2 &amp;amp;   0 &amp;amp;   0 \\&lt;br /&gt;
    0 &amp;amp;   0 &amp;amp;  -1 &amp;amp; a_3 &amp;amp;   0 \\&lt;br /&gt;
    0 &amp;amp;   0 &amp;amp;   0 &amp;amp;  -1 &amp;amp; a_4 \\&lt;br /&gt;
    0 &amp;amp;   0 &amp;amp;   0 &amp;amp;   0 &amp;amp;  -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
These champions repeatedly apply the rules in sequence, never going back to a previous rule. They apply the first rule until they&#039;ve exhausted all 2s, then the second rule until they&#039;ve exhausted all 3s, etc. They have a runtime of &amp;lt;math&amp;gt;1 + a_1 + a_1 a_2 + a_1 a_2 a_3 + \cdots = \sum_{i=0}^k \prod_{j=1}^i a_j&amp;lt;/math&amp;gt; and size &amp;lt;math&amp;gt;2k+2 + \sum_{i=1}^k a_i&amp;lt;/math&amp;gt;. This grows linearly for k=1 (BBf(5) to BBf(10)) and quadratically for k=2 (BBf(11) to BBf(14)). Letting k grow with the size, the maximum runtime grows exponentially in the program size.&lt;br /&gt;
&lt;br /&gt;
==== BBf(15) Family ====&lt;br /&gt;
The BBf(15) and BBf(16) champions are members of a family of programs (parameterized by &amp;lt;math&amp;gt;n \ge 1&amp;lt;/math&amp;gt;):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   0 &amp;amp; -2 &amp;amp; -1 \\&lt;br /&gt;
   2 &amp;amp;  0 &amp;amp; -1 \\&lt;br /&gt;
  -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  n&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Let a = 2, b = 3, and c = 5.&lt;br /&gt;
&lt;br /&gt;
The BBf(15) champion (n = 2) implements this iteration:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  b^0     &amp;amp; \xrightarrow{0} &amp;amp; \text{halt} \\&lt;br /&gt;
  b^1     &amp;amp; \xrightarrow{7} &amp;amp; b^4 \\&lt;br /&gt;
  b^2     &amp;amp; \xrightarrow{7} &amp;amp; b^5 \\&lt;br /&gt;
  b^3     &amp;amp; \xrightarrow{5} &amp;amp; b^2 \\&lt;br /&gt;
  b^4     &amp;amp; \xrightarrow{5} &amp;amp; b^3 \\&lt;br /&gt;
  b^{k+5} &amp;amp; \xrightarrow{3} &amp;amp; b^k \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which follows a permutation-like trajectory: &amp;lt;math&amp;gt;a \xrightarrow{1} b^1 \to b^4 \to b^3 \to b^2 \to b^5 \to b^0 \to \text{halt}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The BBf(16) champion (n = 3) implements this iteration:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  b^0     &amp;amp; \xrightarrow{0}  &amp;amp; \text{halt} \\&lt;br /&gt;
  b^1     &amp;amp; \xrightarrow{10} &amp;amp; b^6 \\&lt;br /&gt;
  b^2     &amp;amp; \xrightarrow{10} &amp;amp; b^7 \\&lt;br /&gt;
  b^3     &amp;amp; \xrightarrow{8}  &amp;amp; b^4 \\&lt;br /&gt;
  b^4     &amp;amp; \xrightarrow{8}  &amp;amp; b^5 \\&lt;br /&gt;
  b^5     &amp;amp; \xrightarrow{6}  &amp;amp; b^2 \\&lt;br /&gt;
  b^6     &amp;amp; \xrightarrow{6}  &amp;amp; b^3 \\&lt;br /&gt;
  b^{k+7} &amp;amp; \xrightarrow{4}  &amp;amp; b^k \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which follows a permutation-like trajectory: &amp;lt;math&amp;gt;a \xrightarrow{1} b^1 \to b^6 \to b^3 \to b^4 \to b^5 \to b^2 \to b^7 \to b^0 \to \text{halt}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== BBf(17) Family ====&lt;br /&gt;
The BBf(17) to BBf(19) champions are members of a family of programs (parameterized by &amp;lt;math&amp;gt;m,n \ge 0&amp;lt;/math&amp;gt;)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   -1 &amp;amp;  0 &amp;amp;  0 &amp;amp;  n \\&lt;br /&gt;
    0 &amp;amp;  1 &amp;amp; -1 &amp;amp;  0 \\&lt;br /&gt;
    m &amp;amp;  0 &amp;amp;  1 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which have size &amp;lt;math&amp;gt;m+n+12&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This family obeys the following rules:&lt;br /&gt;
&lt;br /&gt;
# &amp;lt;math&amp;gt;[1, 0, 0, 0] \xrightarrow{1} [0, 0, 0, n]&amp;lt;/math&amp;gt;&lt;br /&gt;
# if d≥1 and b≤m:&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;[0, b, 0, d] \xrightarrow{m+b+2} [0, b+1, 0, d - 1 + n(m-b)]&amp;lt;/math&amp;gt;&lt;br /&gt;
# if d≥1 and b≥m:&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;[0, b, 0, d] \xrightarrow{2m+2} [0, b+1, 0, d - 1]&amp;lt;/math&amp;gt;&lt;br /&gt;
#if d=0: [0,b,0,d] has halted&lt;br /&gt;
&lt;br /&gt;
and furthermore these rules are applied in order since b is always increasing (and d is eventually decreasing). Combining these together we get runtime:&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;1 + n(m+1)(m(m+1)+2) - \frac{m(m+1)}{2}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The optimal choices for n,m for various program sizes are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Size&lt;br /&gt;
!n&lt;br /&gt;
!m&lt;br /&gt;
!Runtime&lt;br /&gt;
|-&lt;br /&gt;
|16&lt;br /&gt;
|1&lt;br /&gt;
|3&lt;br /&gt;
|51&lt;br /&gt;
|-&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;17&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;2&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;3&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;107&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|-&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;18&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;2&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;4&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;211&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|-&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;19&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;2&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;5&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;370&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|-&lt;br /&gt;
|20&lt;br /&gt;
|2&lt;br /&gt;
|6&lt;br /&gt;
|596&lt;br /&gt;
|-&lt;br /&gt;
|21&lt;br /&gt;
|3&lt;br /&gt;
|6&lt;br /&gt;
|904&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
==== BBf(20) ====&lt;br /&gt;
[[File:Screenshot 2026-04-01 104704.png|alt=Full space-time diagram of the BBf(20) champion.|left|507x507px]]&lt;br /&gt;
The BBf(20) champion (running 746 steps):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
    1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    -1 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This program implements a [[Collatz-like]] iteration. Let &amp;lt;math&amp;gt;C(n) = [0, 0, n, 2, 0]&amp;lt;/math&amp;gt;, then:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0] &amp;amp; \xrightarrow{49}     &amp;amp; C(2) \\&lt;br /&gt;
  C(3k)       &amp;amp; \xrightarrow{3k}     &amp;amp; \text{halt} \\&lt;br /&gt;
  C(3k+1)     &amp;amp; \xrightarrow{11k+22} &amp;amp; C(4k+3) \\&lt;br /&gt;
  C(3k+2)     &amp;amp; \xrightarrow{11k+22} &amp;amp; C(4k+4) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which follows the reasonably &amp;quot;lucky&amp;quot; trajectory:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;C(2) \to C(4) \to C(7) \to C(11) \to C(16) \to C(23) \to C(32) \to C(44) \to C(60) \to \text{halt}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==== BBf(21) ====&lt;br /&gt;
[[File:Bbf21 champ full.png|alt=The full space-time diagram of the BBf(21) champion until halting.|thumb|The full space-time diagram of the BBf(21) champion until halting.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The BBf(21) champion (running &amp;gt;31M steps):&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 \\&lt;br /&gt;
    2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     3 &amp;amp;     0 &amp;amp;    -1 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This program implements a Collatz-like iteration. Let &amp;lt;math&amp;gt;D(n) = [0, 0, n, 0]&amp;lt;/math&amp;gt;, then:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1439779341365022852]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0] &amp;amp; \xrightarrow{1}      &amp;amp; D(1) \\&lt;br /&gt;
  D(3k)       &amp;amp; \xrightarrow{k}      &amp;amp; \text{halt} \\&lt;br /&gt;
  D(3k+1)     &amp;amp; \xrightarrow{21k+7}  &amp;amp; C(10k+4) \\&lt;br /&gt;
  D(3k+2)     &amp;amp; \xrightarrow{21k+14} &amp;amp; C(10k+7) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which follows the reasonably &amp;quot;lucky&amp;quot; trajectory:&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{ll}&lt;br /&gt;
  D(1) &amp;amp; \to D(4) \to D(14) \to D(47) \to D(157) \to D(524) \to D(1747) \to D(5824) \to D(19414) \\&lt;br /&gt;
       &amp;amp; \to D(64714) \to D(215714) \to D(719047) \to D(2396824) \to D(7989414) \to \text{halt} \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== BBf(22) ====&lt;br /&gt;
The BBf(22) champion (running &amp;lt;math&amp;gt;&amp;gt; 10^{62}&amp;lt;/math&amp;gt; steps):&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This program implements a [[Collatz-like]] unbiased pseudo-random walk. Let &amp;lt;math&amp;gt;S(x,y) = [0, 0, x, 0, y]&amp;lt;/math&amp;gt;, then:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1449118888142049421]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0]  &amp;amp; \xrightarrow{1}      &amp;amp; S(0,1) \\&lt;br /&gt;
  S(x, 0)      &amp;amp;  =                   &amp;amp; \text{halt} \\&lt;br /&gt;
  S(3k,   y+1) &amp;amp; \xrightarrow{14k+4}  &amp;amp; S(5k+1, y+1) \\&lt;br /&gt;
  S(3k+1, y+1) &amp;amp; \xrightarrow{14k+10} &amp;amp; S(5k+3, y+2) \\&lt;br /&gt;
  S(3k+2, y+1) &amp;amp; \xrightarrow{14k+12} &amp;amp; S(5k+4, y) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This pseudo-random walk iterates 275 times until it halts reaching a maximum y value of 14 at iteration 111:&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{ll}&lt;br /&gt;
 S(0,1) &amp;amp; \to S(1,1) \to S(3,2) \to S(6,2) \to S(11, 2) \to S(19, 1) \to S(33, 2) \to S(56, 2) \to S(94, 1) \\&lt;br /&gt;
        &amp;amp; \to S(158, 2) \to S(264, 1) \to S(441, 1) \to S(736, 1) \to S(1228, 2) \to S(2048, 3) \\&lt;br /&gt;
        &amp;amp; \vdots \\&lt;br /&gt;
        &amp;amp; \to S(4065328691604230522442358, 13) \\&lt;br /&gt;
        &amp;amp; \to S(6775547819340384204070598, 14) \\&lt;br /&gt;
        &amp;amp; \to S(11292579698900640340117664, 13) \\&lt;br /&gt;
        &amp;amp; \vdots \\&lt;br /&gt;
        &amp;amp; \to S(27930059557111373800280446055462487109112535227834136644, 2) \\&lt;br /&gt;
        &amp;amp; \to S(46550099261852289667134076759104145181854225379723561074, 1) \\&lt;br /&gt;
        &amp;amp; \to S(77583498769753816111890127931840241969757042299539268458, 2) \\&lt;br /&gt;
        &amp;amp; \to S(129305831282923026853150213219733736616261737165898780764, 1) \\&lt;br /&gt;
        &amp;amp; \to S(215509718804871711421917022032889561027102895276497967941, 1) \\&lt;br /&gt;
        &amp;amp; \to S(359182864674786185703195036721482601711838158794163279903, 2) \\&lt;br /&gt;
        &amp;amp; \vdots \\&lt;br /&gt;
        &amp;amp; \to S(5894430516013404355095519889620117404469367857588232386361874, 2) \\&lt;br /&gt;
        &amp;amp; \to S(9824050860022340591825866482700195674115613095980387310603124, 1) \\&lt;br /&gt;
        &amp;amp; \to S(16373418100037234319709777471166992790192688493300645517671874, 0)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
If it were a truly random walk, there would be a 5.9% chance that it takes at least 275 steps to reach 0. So this program is mildly lucky.&lt;br /&gt;
==== BBf(23) ====&lt;br /&gt;
The BBf(23) champion&lt;br /&gt;
&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
   -2 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     2 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt; follows an unbiased [[Collatz-like]] pseudo-random walk:&lt;br /&gt;
let &amp;lt;math&amp;gt;A(x,y)=[0,0,0,x,y]&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;[1,0,0,0,0] \to A(0,2)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(2x,y) \xrightarrow{12x+4} A(5x+1,y+1)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(2x+1,y) \xrightarrow{12x+10} A(5x+4,y-1)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(x,0) \to halt&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(0,2) \to A(1,3) \to A(4,2) \to A(11,3) \to A(29,2) \to A(74,1) \to A(186,2) \to A(466,3) \to A(1166,4) \to A(2916,5) \to A(7291,6) \to \dots&amp;lt;/math&amp;gt;&lt;br /&gt;
==== BBf(24) ====&lt;br /&gt;
The BBf(24) champion&lt;br /&gt;
&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
1 &amp;amp; -1 &amp;amp; -1 &amp;amp; 1 &amp;amp; 0 \\&lt;br /&gt;
-1 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 \\&lt;br /&gt;
0 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 1 \\&lt;br /&gt;
-1 &amp;amp; 2 &amp;amp; 0 &amp;amp; 2 &amp;amp; 0 \\&lt;br /&gt;
0 &amp;amp; 0 &amp;amp; 1 &amp;amp; -1 &amp;amp; 0 \\&lt;br /&gt;
0 &amp;amp; 1 &amp;amp; 1 &amp;amp; 0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt; follows an unbiased [[Collatz-like]] pseudo-random walk: let &amp;lt;math&amp;gt;A(x,y) = [0,0,0,x,y]&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;[1,0,0,0,0] \xrightarrow{3} A(2,2)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(x,0) \xrightarrow{x} halt&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(3x,y) \xrightarrow{9x+5} A(7x+3,y+1)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(3x+1,y) \xrightarrow{9x+6} A(7x+4,y-1)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(3x+2,y) \xrightarrow{9x+10} A(7x+7,y)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(2,2) \to A(7,2) \to A(18,1) \to A(45,2) \to A(108,3) \to A(255,4) \to A(598,5) \to A(1397,4) \to A(3262,4) \to \dots&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
&lt;br /&gt;
=== Size 22: Fenrir ===&lt;br /&gt;
[[File:Fractran 22 Cryptid.webp|alt=The space-time diagram of Fenrir.|thumb|Partial space-time diagram of Fenrir (#29).]]&lt;br /&gt;
&amp;quot;Fenrir&amp;quot; is a family of 3 size 22 [[Cryptids]] discovered by Jason Yuen (@-d) and Claude Opus 4.6 on 22 Mar 2026. Out of 2003 holdouts of size 22, Claude Opus 4.6 used Lean to prove that 1997 holdouts were non-halting and 3 holdouts were halting; the remaining 3 holdouts are the Fenrir family.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1485415054475268179]&amp;lt;/sup&amp;gt; Discord user @ZTS439 shared [https://discord.com/channels/960643023006490684/1438019511155691521/1487251919444508723 some analysis] and a [https://discord.com/channels/960643023006490684/1438019511155691521/1487252789158613002 Python program] for it. Its name comes from [[wikipedia:Norse_mythology|Nordic mythology]]; [[wikipedia:Fenrir|Fenrir]] is the wolf that helps destroy the world during [[wikipedia:Ragnarök|Ragnarök]].&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Holdout number&lt;br /&gt;
!Holdout&lt;br /&gt;
!Vector Representation&lt;br /&gt;
|-&lt;br /&gt;
| 29/2003&lt;br /&gt;
| &amp;lt;code&amp;gt;[1/15, 27/77, 49/3, 10/49, 33/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     3 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    -1 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     2 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -2 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 41/2003&lt;br /&gt;
| &amp;lt;code&amp;gt;[1/15, 49/3, 27/77, 10/49, 33/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     2 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     3 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    -1 \\&lt;br /&gt;
    1 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -2 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 430/2003&lt;br /&gt;
| &amp;lt;code&amp;gt;[27/35, 1/33, 25/3, 22/25, 21/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;     3 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     2 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;     0 &amp;amp;    -2 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
   -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
All 3 holdouts follow a biased random walk that somewhat resembles [[Hydra]]. Let &amp;lt;math&amp;gt;S(x,y) = [x, 0, 0, 2, y]&amp;lt;/math&amp;gt; (for 29/2003 and 41/2003) or &amp;lt;math&amp;gt;S(x,y) = [x, 0, 2, y, 0]&amp;lt;/math&amp;gt; (for 430/2003), then:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0] &amp;amp; \xrightarrow{2} &amp;amp; S(0,1) \\&lt;br /&gt;
  S(0, 2y)    &amp;amp; \xrightarrow{23y + 3}  &amp;amp; \text{halt} \\&lt;br /&gt;
  S(x, 2y)    &amp;amp; \xrightarrow{23y + 5} &amp;amp; S(x-1, 5y+2) \\&lt;br /&gt;
  S(x, 2y+1)  &amp;amp; \xrightarrow{23y + 13} &amp;amp; S(x+2, 5y)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The first few visited states are:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(0, 1) \to S(2, 0) \to S(1, 2) \to S(0, 7) \to S(2, 15) \to S(4, 35) \cdots&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Size 23: 11 Hydra-like Cryptids ===&lt;br /&gt;
&lt;br /&gt;
Define &amp;lt;math&amp;gt;Hydra(r_\mathrm{num}, r_\mathrm{den}, x_\mathrm{offset}, y_\mathrm{offset}, (x_\mathrm{init}, y_\mathrm{init}))&amp;lt;/math&amp;gt; to be the problem as follows:&lt;br /&gt;
&lt;br /&gt;
# The initial state is &amp;lt;math&amp;gt;(x_\mathrm{init}, y_\mathrm{init})&amp;lt;/math&amp;gt;.&lt;br /&gt;
# The iteration &amp;lt;math&amp;gt;(x, y) \mapsto (r_\mathrm{num} \times \lfloor x/r_\mathrm{den} \rfloor + x_\mathrm{offset}[x \bmod r_\mathrm{den}], y + y_\mathrm{offset}[x \bmod r_{den}])&amp;lt;/math&amp;gt; is repeated. Here, &amp;lt;math&amp;gt;x_\mathrm{offset}, y_\mathrm{offset}&amp;lt;/math&amp;gt; are 0-indexed.&lt;br /&gt;
# Are all the values of y non-negative?&lt;br /&gt;
&lt;br /&gt;
Furthermore, the Hydra-like problem is considered a [[Cryptids|Cryptid]] if it also satisfies:&lt;br /&gt;
&lt;br /&gt;
# &amp;lt;math&amp;gt;y_\mathrm{offset}&amp;lt;/math&amp;gt; contains a negative number, and the average is positive.&lt;br /&gt;
# &amp;lt;math&amp;gt;x \bmod r_\mathrm{den}&amp;lt;/math&amp;gt; is a pseudorandom sequence.&lt;br /&gt;
#There are no negative values of &amp;lt;math&amp;gt;y&amp;lt;/math&amp;gt; early on.&lt;br /&gt;
&lt;br /&gt;
For example, Fenrir is non-halting if and only if Hydra(5, 2, [2, 0], [-1, 2], (1, 0)). In this Hydra problem, the first few visited states are &amp;lt;math&amp;gt;(1, 0) \to (0, 2) \to (2, 1) \to (7, 0) \to (15, 2) \to (35, 4)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
There are 11 Hydra-like Cryptids of size exactly 23, listed in the table below. All 11 Cryptids are not correlated with each other. Fenrir is included in the table as a reference.&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Domain: Holdout Number&lt;br /&gt;
!Holdout&lt;br /&gt;
!Hydra problem&lt;br /&gt;
!Notes&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #11/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/135, 25/21, 33/5, 2/3, 7/11, 5/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(7, 4, [1, 3, 5, 6], [0, 1, 2, -1], (1, 0))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(22): #29/2003&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/15, 27/77, 49/3, 10/49, 33/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 2, [2, 0], [-1, 2], (1, 0))&lt;br /&gt;
|Fenrir&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #26/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/15, 49/3, 81/77, 10/49, 33/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(7, 2, [-1, 8], [3, -1], (1, 2))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #47/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/18, 4/15, 21/2, 121/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 3, [1, 3, 4], [1, 3, -1], (1, 1))&lt;br /&gt;
|If #47 doesn&#039;t halt then Frankenstein&#039;s Monster doesn&#039;t halt&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #77/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/54, 4/15, 21/2, 11/3, 5/7, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(7, 4, [0, 2, 4, 5], [0, 1, 2, -1], (1, 0))&lt;br /&gt;
|Same ratio 7/4 as #11&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #151/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[14/15, 1/12, 11/3, 63/2, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(8, 5, [1, 2, 4, 6, 7], [2, -1, 1, 3, 0], (0, 1))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #159/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[14/15, 1/6, 121/3, 63/2, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 3, [1, 2, 4], [3, -1, 1], (1, 3))&lt;br /&gt;
|Same ratio 5/3 as #47&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #207/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[2/15, 1/12, 441/2, 11/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(6, 5, [1, 3, 3, 5, 5], [1, 3, 0, 2, -1], (1, 1))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #218/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[2/15, 1/6, 441/2, 121/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(4, 3, [1, 2, 3], [3, 1, -1], (1, 3))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #317/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[4/15, 1/18, 63/2, 11/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 4, [1, 2, 3, 5], [1, 0, -1, 2], (1, 1))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #319/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[4/15, 1/24, 21/2, 11/3, 5/7, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 4, [0, 2, 4, 3], [0, 1, 2, -1], (1, 0))&lt;br /&gt;
|Same ratio 5/4 as #317&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #323/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[4/15, 1/6, 21/2, 1331/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(3, 2, [1, 2], [2, -1], (1, 2))&lt;br /&gt;
|If #323 doesn&#039;t halt then Antihydra-like Cryptid doesn&#039;t halt&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
As of August 2026, the 13 unofficial holdouts are as follows: Fenrir, 11 Hydra-like Cryptids of size 23, and #601 &amp;lt;code&amp;gt;[9/10, 1/42, 22/3, 49/2, 5/11, 3/7]&amp;lt;/code&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
==== Frankenstein&#039;s Monster ====&lt;br /&gt;
[[File:Frankenstein&#039;s Monster.webp|alt=Partial space-time diagram of Frankenstein&#039;s Monster.|thumb|Partial space-time diagram of Frankenstein&#039;s Monster.]]&lt;br /&gt;
&amp;quot;Frankenstein&#039;s Monster&amp;quot; is a size 23 [[Cryptid]]. It was created by tweaking a single instruction in the size 22 champion. This tweak switches it from a unbiased random walk to a biased one and thus makes halting probviously impossible. It is called Frankenstein&#039;s Monster since it was found by a combination of exhaustive search and hand design.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1449138938215141478]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;[1/12, 9/10, 14/3, 121/2, 5/7, 3/11]&amp;lt;/code&amp;gt; &amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     2 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Its behavior is extremely similar to the size 22 champion. Let &amp;lt;math&amp;gt;S(x,y) = [0, 0, x, 0, y]&amp;lt;/math&amp;gt;, then:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0]  &amp;amp; \xrightarrow{1}      &amp;amp; S(0,2) \\&lt;br /&gt;
  S(x, 0)      &amp;amp;  =                   &amp;amp; \text{halt} \\&lt;br /&gt;
  S(3k,   y+1) &amp;amp; \xrightarrow{14k+4}  &amp;amp; S(5k+1, y+2) \\&lt;br /&gt;
  S(3k+1, y+1) &amp;amp; \xrightarrow{14k+10} &amp;amp; S(5k+3, y+4) \\&lt;br /&gt;
  S(3k+2, y+1) &amp;amp; \xrightarrow{14k+12} &amp;amp; S(5k+4, y)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with the only difference that the &amp;lt;math&amp;gt;y&amp;lt;/math&amp;gt; values now change by &amp;lt;math&amp;gt;\{+1,+3,-1\}&amp;lt;/math&amp;gt; depending on the value of &amp;lt;math&amp;gt;x\bmod 3&amp;lt;/math&amp;gt; (instead of &amp;lt;math&amp;gt;\{0,+1,-1\}&amp;lt;/math&amp;gt; in the original size 22 program). The &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; values follow the exact same path as in the original size 22 champion, but the y values quickly grow linearly with the number of iterations (as expected by the random model):&lt;br /&gt;
          0: S(0, 1)  @ 1  (0.00s)&lt;br /&gt;
    100_000: S(10^22_185, 100171)  @ 10^22_186  (0.87s)&lt;br /&gt;
    200_000: S(10^44_370, 200187)  @ 10^44_371  (3.42s)&lt;br /&gt;
    300_000: S(10^66_555, 300759)  @ 10^66_556  (7.68s)&lt;br /&gt;
    400_000: S(10^88_740, 400451)  @ 10^88_741  (13.64s)&lt;br /&gt;
    500_000: S(10^110_925, 500421)  @ 10^110_925  (21.28s)&lt;br /&gt;
    600_000: S(10^133_109, 600351)  @ 10^133_110  (30.62s)&lt;br /&gt;
    700_000: S(10^155_294, 700319)  @ 10^155_295  (41.64s)&lt;br /&gt;
    800_000: S(10^177_479, 799911)  @ 10^177_480  (54.30s)&lt;br /&gt;
    900_000: S(10^199_664, 900259)  @ 10^199_665  (68.59s)&lt;br /&gt;
  1_000_000: S(10^221_849, 1000853)  @ 10^221_850  (84.51s)&lt;br /&gt;
 ...&lt;br /&gt;
  4_000_000: S(10^887_395, 4000201)  @ 10^887_396  (1474.02s)&lt;br /&gt;
 ...&lt;br /&gt;
 27_500_000: S(10^6_100_841, 27512703)  @ 10^6_100_842  (87616.45s)&lt;br /&gt;
&lt;br /&gt;
==== Antihydra-like Cryptid ====&lt;br /&gt;
This Cryptid is a size 23 [[Cryptid]]. This Cryptid was [https://discord.com/channels/960643023006490684/1438019511155691521/1449293536737361973 constructed by Maksandchael] by tweaking Frankenstein&#039;s Monster to make it as similar to [[Antihydra]] as possible. &amp;lt;code&amp;gt;[9/10, 1/6, 1331/2, 14/3, 5/7, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     3 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&amp;lt;pre&amp;gt;&lt;br /&gt;
H(a, b) = [0, 0, a-2, 0, b]&lt;br /&gt;
Start -&amp;gt; H(2, 3)&lt;br /&gt;
H(2a, b) -&amp;gt; H(3a, b+2)&lt;br /&gt;
H(2a+1, b+1) -&amp;gt; H(3a+1, b)&lt;br /&gt;
H(a,0) -&amp;gt; halt&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Size 25: Hydra ===&lt;br /&gt;
[[File:Hydra.webp|alt=Partial space-time diagram of Hydra.|thumb|300x300px|Partial space-time diagram of Hydra.]]&lt;br /&gt;
A size 25 program was produced and golfed by hand to simulate [[Hydra]] rules ([https://discord.com/channels/960643023006490684/1438019511155691521/1449829146040467681 Discord]):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;[363/14, 125/2, 22/21, 1/3, 7/11, 14/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;&lt;br /&gt;
\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     2 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     3 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     1 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 \\&lt;br /&gt;
    1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The intended interpretation is that if we let &amp;lt;math&amp;gt;S(h,w) = [1, 0, w, h-3, 0]&lt;br /&gt;
&amp;lt;/math&amp;gt; then it follows the following rules:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,\dots]  &amp;amp; =     &amp;amp; S(3, 0) \\&lt;br /&gt;
  S(2k,   0)   &amp;amp; \to^* &amp;amp; \text{halt} \\&lt;br /&gt;
  S(2k,   w+1) &amp;amp; \to^* &amp;amp; S(3k,   w) \\&lt;br /&gt;
  S(2k+1, w)   &amp;amp; \to^* &amp;amp; S(3k+1, w+2)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Size 48: BMO 6 (&amp;quot;Space Needle&amp;quot;) ===&lt;br /&gt;
[[File:Space Needle.webp|alt=Partial space-time diagram of Space Needle.|thumb|Partial space-time diagram of Space Needle.]]&lt;br /&gt;
A size 48 program was produced by hand to simulate [https://wiki.bbchallenge.org/wiki/1RB1LA_1LC0RE_1LF1LD_0RB0LA_1RC1RE_---0LD BMO 6] rules ([https://discord.com/channels/960643023006490684/1438019511155691521/1441137371046482071 Discord])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;[77/2, 2/99, 17/33, 13/11, 285/119, 17/19, 1375/51, 1/17, 3/5, 243/7, 10/13]&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    -1 &amp;amp;    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    1 &amp;amp;    -2 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;    1 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     1 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    1 &amp;amp;     1 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    1 \\&lt;br /&gt;
    0 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;    1 &amp;amp;    -1 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     3 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    1 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    5 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    1 &amp;amp;    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;    0 &amp;amp;    0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&amp;lt;pre&amp;gt;A(a, b) = B^a C^b E or B^(a-2) C^b D E&lt;br /&gt;
&lt;br /&gt;
Start: A(7, 1)&lt;br /&gt;
&lt;br /&gt;
A(1, b) --&amp;gt; halt&lt;br /&gt;
&lt;br /&gt;
A(2a, b) --&amp;gt; A(5a+b+2, 1)&lt;br /&gt;
&lt;br /&gt;
A(2a+1, b) --&amp;gt; A(b-1, b+c+3)&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other notable machines ==&lt;br /&gt;
&lt;br /&gt;
=== Size 24: Energy Vampire ===&lt;br /&gt;
The size 24 machine &amp;lt;code&amp;gt;[2/15, 1/6, 441/2, 11/3, 25/7, 6/11]&amp;lt;/code&amp;gt;, or &amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
1 &amp;amp; -1 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 \\&lt;br /&gt;
-1 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 \\&lt;br /&gt;
-1 &amp;amp; 2 &amp;amp; 0 &amp;amp; 2 &amp;amp; 0 \\&lt;br /&gt;
0 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 1 \\&lt;br /&gt;
0 &amp;amp; 0 &amp;amp; 2 &amp;amp; -1 &amp;amp; 0 \\&lt;br /&gt;
1 &amp;amp; 1 &amp;amp; 0 &amp;amp; 0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;, discovered by Jason Yuen (@-d) and Claude Opus 5.5, follows a particularly lucky unbiased pseudo-random walk.&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;A(x,y) = [0, 0, 0, 2x, y]&amp;lt;/math&amp;gt;, then:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1563398072040427611]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0]  &amp;amp; \xrightarrow{3}      &amp;amp; A(1, 2) \\&lt;br /&gt;
  A(x, 0)      &amp;amp;  \xrightarrow{2x} &amp;amp; [0, 0, 4x, 0, 0] \ (\text{halt}) \\&lt;br /&gt;
  A(3k,   y + 1) &amp;amp; \xrightarrow{30k + 2}  &amp;amp; S(8k, y) \\&lt;br /&gt;
  A(3k + 1, y + 1) &amp;amp; \xrightarrow{30k + 13} &amp;amp; S(8k + 3, y + 1) \\&lt;br /&gt;
  A(3k + 2, y + 1) &amp;amp; \xrightarrow{30k + 24} &amp;amp; S(8k + 6, y + 2) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This corresponds to the Hydra problem Hydra(8, 3, [0, 3, 6], [-1, 0, 1], (1, 1)).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1563346300139864074]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This machine iterates this pseudo-random walk over 2&amp;lt;sup&amp;gt;38&amp;lt;/sup&amp;gt; times;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1564736905344454677]&amp;lt;/sup&amp;gt; it should be probabilistically guaranteed to halt (assuming Collatz-like behavior is random). @-d is currently verifying a simulation that claims the machine halts after over 1.714 × 10&amp;lt;sup&amp;gt;210,914,744,116&amp;lt;/sup&amp;gt; steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1565647448452636672]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(1,2) \to A(3,2) \to A(8,1) \to A(22,2) \to A(59,2) \to A(158,3) \to A(422,4) \to A(1126,5) \to A(3003,5) \to A(8008,4) \to \dots&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This machine is the [[Beaver Math Olympiad]]&#039;s 12th problem.&lt;br /&gt;
&lt;br /&gt;
=== Size 24: Time Vampire ===&lt;br /&gt;
The size 24 machine &amp;lt;code&amp;gt;[14/15, 1/66, 9/2, 121/3, 5/7, 10/11]&amp;lt;/code&amp;gt; discovered by Jason Yuen (@-d)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1568748374545666248]&amp;lt;/sup&amp;gt; and analyzed by Shawn Ligocki,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1569110043910082695][https://discord.com/channels/960643023006490684/1438019511155691521/1569176059490865306]&amp;lt;/sup&amp;gt; follows these rules which seems like they should probviously halt, but may take years (or centuries) of serial simulation:&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;S(d,e) = [0, 0, 0, d, e]&amp;lt;/math&amp;gt;, then:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcll}&lt;br /&gt;
  [1,0,0,0,0]  &amp;amp; \to &amp;amp; S(0, 4) \\&lt;br /&gt;
  S(d, 0)    &amp;amp; \to &amp;amp; \text{Halt} \\&lt;br /&gt;
  S(d, e)    &amp;amp; \to &amp;amp; S(d+1, 2d-6e+12) &amp;amp; \text{if } 1 \le e \le \frac{d}{3} + 1 \\&lt;br /&gt;
  S(3k,   e) &amp;amp; \to &amp;amp; S(3k+1, e-k-2)   &amp;amp; \text{if } e \ge k+2 \\&lt;br /&gt;
  S(3k+1, e) &amp;amp; \to &amp;amp; S(3k+1, e-k)     &amp;amp; \text{if } e \ge k+2 \\&lt;br /&gt;
  S(3k+2, e) &amp;amp; \to &amp;amp; S(3k+1, e-k+2)   &amp;amp; \text{if } e \ge k+2 \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Note that always &amp;lt;math&amp;gt;d \to d+1&amp;lt;/math&amp;gt;, but &#039;&#039;e&#039;&#039; follows a more complex trajectory.&lt;br /&gt;
&lt;br /&gt;
Shawn Ligocki has simulated this out to config S(240 000 000 000 000, 23 790 622 663 866) (108 hours of serial computation).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1571006879025336343]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Size 36: BMO1 ===&lt;br /&gt;
[[File:Ftran bmo1.png|alt=Partial space-time diagram of BMO 1.|thumb|Partial space-time diagram of BMO 1.]]&lt;br /&gt;
A size 36 program was produced by hand to simulate [[BMO1]] rules ([https://discord.com/channels/960643023006490684/1438019511155691521/1440018895212642424 Discord]):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;[153/55, 2/11, 26/35, 3/7, 11/17, 7/13, 25/6, 55/2, 14/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;&lt;br /&gt;
\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    2 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;    1 \\&lt;br /&gt;
    1 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;    0 \\&lt;br /&gt;
    1 &amp;amp;    0 &amp;amp;     -1 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     -1 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;    1 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 \\&lt;br /&gt;
    -1 &amp;amp;     -1 &amp;amp;     2 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    -1 &amp;amp;     0 &amp;amp;    1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;A(a,b) = [a, b, 0, 0, 0, 0, 0]&amp;lt;/math&amp;gt;, then it follows the rules:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,\dots] &amp;amp; \xrightarrow{4}&amp;amp; A(1, 2) \\&lt;br /&gt;
  A(a, b) &amp;amp; \xrightarrow{5b+4}&amp;amp; A(a-b, 4b+2) &amp;amp; \text{if } a &amp;gt; b \\&lt;br /&gt;
  A(a, b) &amp;amp; \xrightarrow{5a+2} &amp;amp; A(2a+1, b-a) &amp;amp; \text{if } a &amp;lt; b \\&lt;br /&gt;
  A(a, b) &amp;amp; \xrightarrow{a} &amp;amp; \text{Halt} &amp;amp; \text{if } a = b&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Functions]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Fractran&amp;diff=10695</id>
		<title>Fractran</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Fractran&amp;diff=10695"/>
		<updated>2026-11-14T04:04:14Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Other notable machines */ Add Time Vampire &amp;quot;[14/15, 1/66, 9/2, 121/3, 5/7, 10/11]&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Fractran&#039;&#039;&#039; (originally styled FRACTRAN) is an esoteric [[Turing complete]] model of computation invented by John Conway in 1987.&amp;lt;ref&amp;gt;Conway, John H. (1987). &amp;quot;FRACTRAN: A Simple Universal Programming Language for Arithmetic&amp;quot;. &#039;&#039;Open Problems in Communication and Computation&#039;&#039;. Springer-Verlag New York, Inc. pp. 4–26. &amp;lt;nowiki&amp;gt;http://doi.org/10.1007/978-1-4612-4808-8_2&amp;lt;/nowiki&amp;gt;&amp;lt;/ref&amp;gt; In this model a program is simply a finite list of fractions (rational numbers), the program state is an integer. For more details see https://en.wikipedia.org/wiki/FRACTRAN.&lt;br /&gt;
&lt;br /&gt;
Discord user Coda came up with a way to transform any Fractran program into a Turing Machine, see [https://discord.com/channels/960643023006490684/1438019511155691521/1441844795613122560 source].&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;BB_fractran&#039;&#039;&#039;(n) or &#039;&#039;&#039;BBf&#039;&#039;&#039;(n) is the Busy Beaver function for Fractran programs. Holdouts lists by Jason Yuen (@-d): [https://github.com/int-y1/BBFractran/blob/main/holdout/README.md Holdouts lists]&lt;br /&gt;
&lt;br /&gt;
== Definition ==&lt;br /&gt;
A Fractran program is a list of rational numbers &amp;lt;math&amp;gt;[q_0, q_1, \dots, q_{k-1}]&amp;lt;/math&amp;gt; called rules and a Fractran state is an integer &amp;lt;math&amp;gt;s \in \mathbb{Z}&amp;lt;/math&amp;gt;. The numerator and denominator of any rational number fraction do not share any prime factors (they are in reduced form). We say that a rule &amp;lt;math&amp;gt;q_i&amp;lt;/math&amp;gt; applies to state &amp;lt;math&amp;gt;s&amp;lt;/math&amp;gt; if &amp;lt;math&amp;gt;s \cdot q_i \in \mathbb{Z}&amp;lt;/math&amp;gt;. If no rule applies, we say that the computation has halted otherwise we apply the first applicable rule at each step. In that case we say &amp;lt;math&amp;gt;s \to t&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;t = s \cdot q_i&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;i = \min \{ i : s \cdot q_i \in \mathbb{Z} \}&amp;lt;/math&amp;gt;. As with [[Turing machines]], we will write &amp;lt;math&amp;gt;s \xrightarrow{N} t&amp;lt;/math&amp;gt; if &amp;lt;math&amp;gt;s \to s_1 \to \cdots \to s_{N-1} \to t&amp;lt;/math&amp;gt; (s goes to t after N steps) and &amp;lt;math&amp;gt;s \to^* t&amp;lt;/math&amp;gt; or &amp;lt;math&amp;gt;s \to^+ t&amp;lt;/math&amp;gt; if &amp;lt;math&amp;gt;s \xrightarrow{N} t&amp;lt;/math&amp;gt; for some N≥0 or N≥1 (respectively). We say that a program has runtime N (or halts in N steps) starting in state s if &amp;lt;math&amp;gt;s \xrightarrow{N} t&amp;lt;/math&amp;gt; and computation halts on t.&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;\Omega(n)&amp;lt;/math&amp;gt; be the total number of prime factors of a positive integer n. In other words, &amp;lt;math&amp;gt;\Omega(2^{a_0} 3^{a_1} \cdots p_n^{a_n}) = \sum_{k=0}^n a_k&amp;lt;/math&amp;gt;. Then given a rule &amp;lt;math&amp;gt;\frac{a}{b}&amp;lt;/math&amp;gt; we say that &amp;lt;math&amp;gt;\text{size} \left( \frac{a}{b} \right) = \Omega(a) + \Omega(b)&amp;lt;/math&amp;gt;. And the size of a Fractran program &amp;lt;math&amp;gt;[q_0, q_1, \dots, q_{k-1}]&amp;lt;/math&amp;gt; is &amp;lt;math&amp;gt;k + \sum_{i=0}^{k-1} \text{size}(q_i)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
BB_fractran(n) or BBf(n) is the maximum runtime starting in state 2 for all halting Fractran programs of size n. It is a non-computable function akin to the [[Busy Beaver Functions]] since Fractran is Turing Complete.&lt;br /&gt;
&lt;br /&gt;
== Vector Representation ==&lt;br /&gt;
Fractran programs are not easy to interpret, in fact it may be completely unclear at first that they can perform any computation at all. One of the key insights is to represent all numbers (states and rules) in their prime factorization form. For example, we can use a vector &amp;lt;math&amp;gt;[ a_0, a_1, \dots, a_{n-1} ] \in \mathbb{Z}^n&amp;lt;/math&amp;gt; to represent the number &amp;lt;math&amp;gt;2^{a_0} 3^{a_1} \cdots p_{n-1}^{a_{n-1}}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Let the vector representation (for a sufficiently large n) for a state &amp;lt;math&amp;gt;a = 2^{a_0} 3^{a_1} \cdots p_{n-1}^{a_{n-1}}&amp;lt;/math&amp;gt; be &amp;lt;math&amp;gt;v(a) = [ a_0, a_1, \dots, a_{n-1} ] \in \mathbb{N}^n&amp;lt;/math&amp;gt; and the vector representation for a rule &amp;lt;math&amp;gt;\frac{a}{b}&amp;lt;/math&amp;gt; be &amp;lt;math&amp;gt;v \left( \frac{a}{b} \right) = v(a) - v(b) \in \mathbb{Z}^n&amp;lt;/math&amp;gt; (Note that this is just an extension of the original definition extended to allow negative &amp;lt;math&amp;gt;a_i&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
Now, rule q applies to state s iff &amp;lt;math&amp;gt;v(s) + v(q) \in \mathbb{N}^n&amp;lt;/math&amp;gt; (all components of the vector are ≥0) and if &amp;lt;math&amp;gt;s \to t&amp;lt;/math&amp;gt; then &amp;lt;math&amp;gt;v(t) = v(s) + v(q)&amp;lt;/math&amp;gt;. So the Fractran multiplication model is completely equivalent to the vector adding model. For presentation, we will represent a Fractran program with a matrix where each row is the vector representation for a rule.&lt;br /&gt;
&lt;br /&gt;
For example, the BBf(15) champion (&amp;lt;code&amp;gt;[1/45, 4/5, 3/2, 25/3]&amp;lt;/code&amp;gt;) in vector representation would be:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   0 &amp;amp; -2 &amp;amp; -1 \\&lt;br /&gt;
   2 &amp;amp;  0 &amp;amp; -1 \\&lt;br /&gt;
  -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  2&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In this representation, it becomes much easier to reason about Fractran programs and describe general rules. It is also very easy to calculate the size of a rule or program in vector representation. It is the sum of absolute values of all elements in the matrix + number of rules (number of rows).&lt;br /&gt;
&lt;br /&gt;
=== Relationship to VAS / Petri Nets ===&lt;br /&gt;
Using vector representation, Fractran programs are a deterministic version of [[wikipedia:Vector_addition_system|Vector Addition Systems (VAS)]] (and, equivalently, [[wikipedia:Petri_net|Petri Nets]]). VAS are identical to Fractran programs in vector representation except that the rules are unordered and non-deterministic, they are used to model distributed systems where precise order of rule execution cannot be predicted. Interestingly, many problems about VAS are actually decidable, but their runtimes are extremely slow. Notably, the reachability problem (given states A and B are there a sequence of rules so that &amp;lt;math&amp;gt;A \to^* B&amp;lt;/math&amp;gt;) is &amp;quot;Ackermann-complete&amp;quot; meaning that the optimal algorithm has worst-case runtime akin to the famously fast-growing Ackermann function.&amp;lt;ref&amp;gt;Czerwiński, Wojciech; Orlikowski, Łukasz (2021). &#039;&#039;Reachability in Vector Addition Systems is Ackermann-complete&#039;&#039;. 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). https://arxiv.org/abs/2104.13866.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Visualizing Fractran Programs&#039; Space-Time Diagrams ==&lt;br /&gt;
Katelyn Doucette&#039;s Fractran space-time diagram visualizer produces the following space-time diagrams for some notable Fractran Programs, under the following principle: Each color represents a prime factor. Left -&amp;gt; right colors indicating the index of that register, and how wide the color is representing how big the value is at that step. Source code: https://github.com/Laturas/FractranVisualizer&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
|[[File:Fractran_22_Cryptid.webp|alt=The space-time diagram of Fenrir|460x460px]]&lt;br /&gt;
The space-time diagram of Fenrir&lt;br /&gt;
|[[File:Hydra.webp|alt=The space-time diagram of Hydra.|460x460px]]&lt;br /&gt;
The space-time diagram of Hydra.&lt;br /&gt;
|[[File:Bbf21 champ full.png|alt=The space-time diagram of the BBf(21) champion.|400x400px]]&lt;br /&gt;
&lt;br /&gt;
The space-time diagram of the BBf(21) champion. The width &amp;amp; height of the diagram can be set in the visualizer.&lt;br /&gt;
|[[File:Space_Needle.webp|alt=The space-time diagram of Space Needle.|460x460px]]&lt;br /&gt;
The space-time diagram of Space Needle.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Deciders ==&lt;br /&gt;
[[File:Fractran deciders.png|alt=Fractran deciders|thumb|All Fractran deciders summarized and their relations, shared by Daniel Yuan on [https://discord.com/channels/960643023006490684/1438019511155691521/1439001835904958655 14 Nov 2025]]]Many specialized deciders have been invented to prove Fractran programs non-halting. See image at right. There are three extra deciders: [https://discord.com/channels/960643023006490684/1438019511155691521/1449775657554022531 Spanning Vectors Masked,] which should be very effective, but implementing it is in-progress, a version of Spanning Vectors Masked - [https://discord.com/channels/960643023006490684/1438019511155691521/1453217977385091092 Masked Linear Invariant] - which is very powerful, and some holdouts were removed by [[User:Sligocki|Shawn Ligocki]] with [https://lsv.ens-paris-saclay.fr/Software/fast/ FAST] (Fast Acceleration of Symbolic Transition systems), a pre-existing general tool.&lt;br /&gt;
&lt;br /&gt;
-d released a new decider on 25 Jan 2026: [https://discord.com/channels/960643023006490684/1438019511155691521/1464873923647639703 Beeping Permutation].&lt;br /&gt;
&lt;br /&gt;
TODO: create pages about the deciders.&lt;br /&gt;
&lt;br /&gt;
== Champions ==&lt;br /&gt;
The table of champions is split into two pieces: the first for small champions (up to BBf(14)) which all share the same relatively simple behavior (sequential programs) is collapsed by default; the second for champions BBf(15) and beyond which have more complex and varied behavior.&lt;br /&gt;
All small champions as well as the first few larger ones were discovered and proven maximal by Jason Yuen (@-d) in their initial enumeration on [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]. &lt;br /&gt;
&lt;br /&gt;
BBf(21) and below are solved. BBf(22) is the smallest domain to contain a Cryptid, and all other machines for BBf(22) are solved.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Small Champions&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!BBf(n)&lt;br /&gt;
!Example Champion&lt;br /&gt;
!Vector Representation&lt;br /&gt;
|-&lt;br /&gt;
| 2 || 1 || &amp;lt;code&amp;gt;[1/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 3 || 1 || &amp;lt;code&amp;gt;[3/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp; 1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 4 || 1 || &amp;lt;code&amp;gt;[9/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp; 2&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 5 || 2 || &amp;lt;code&amp;gt;[3/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  1 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 6 || 3 || &amp;lt;code&amp;gt;[9/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  2 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 7 || 4 || &amp;lt;code&amp;gt;[27/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  3 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 8 || 5 || &amp;lt;code&amp;gt;[81/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  4 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 9 || 6 || &amp;lt;code&amp;gt;[243/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  5 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 10 || 7 || &amp;lt;code&amp;gt;[729/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  6 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 11 || 10 || &amp;lt;code&amp;gt;[27/2, 25/3, 1/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  3 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  2 \\&lt;br /&gt;
   0 &amp;amp;  0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 12 || 13 || &amp;lt;code&amp;gt;[81/2, 25/3, 1/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  4 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  2 \\&lt;br /&gt;
   0 &amp;amp;  0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 13 || 17 || &amp;lt;code&amp;gt;[81/2, 125/3, 1/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  4 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  3 \\&lt;br /&gt;
   0 &amp;amp;  0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 14 || 21 || &amp;lt;code&amp;gt;[243/2, 125/3, 1/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  5 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  3 \\&lt;br /&gt;
   0 &amp;amp;  0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!BBf(n)&lt;br /&gt;
!Example Champion&lt;br /&gt;
!Vector Representation&lt;br /&gt;
!Champion Found&lt;br /&gt;
!Holdouts Proven&lt;br /&gt;
|-&lt;br /&gt;
| 15 || 28 || &amp;lt;code&amp;gt;[1/45, 4/5, 3/2, 25/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   0 &amp;amp; -2 &amp;amp; -1 \\&lt;br /&gt;
   2 &amp;amp;  0 &amp;amp; -1 \\&lt;br /&gt;
  -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  2&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]&lt;br /&gt;
|-&lt;br /&gt;
| 16 || 53 || &amp;lt;code&amp;gt;[1/45, 4/5, 3/2, 125/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   0 &amp;amp; -2 &amp;amp; -1 \\&lt;br /&gt;
   2 &amp;amp;  0 &amp;amp; -1 \\&lt;br /&gt;
  -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  3&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]&lt;br /&gt;
|-&lt;br /&gt;
| 17 || 107 || &amp;lt;code&amp;gt;[5/6, 49/2, 3/5, 40/7]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   -1 &amp;amp;  0 &amp;amp;  0 &amp;amp;  2 \\&lt;br /&gt;
    0 &amp;amp;  1 &amp;amp; -1 &amp;amp;  0 \\&lt;br /&gt;
    3 &amp;amp;  0 &amp;amp;  1 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434313398799175710 1 Nov 2025]&lt;br /&gt;
|Daniel Yuan (@dyuan01) [https://discord.com/channels/960643023006490684/1362008236118511758/1434771877376557086 3 Nov 2025]&lt;br /&gt;
|-&lt;br /&gt;
| 18 || 211 || &amp;lt;code&amp;gt;[5/6, 49/2, 3/5, 80/7]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   -1 &amp;amp;  0 &amp;amp;  0 &amp;amp;  2 \\&lt;br /&gt;
    0 &amp;amp;  1 &amp;amp; -1 &amp;amp;  0 \\&lt;br /&gt;
    4 &amp;amp;  0 &amp;amp;  1 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1435313806493614131 4 Nov 2025]&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1436661215911870584 8 Nov 2025]&lt;br /&gt;
|-&lt;br /&gt;
| 19 || 370 || &amp;lt;code&amp;gt;[5/6, 49/2, 3/5, 160/7]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   -1 &amp;amp;  0 &amp;amp;  0 &amp;amp;  2 \\&lt;br /&gt;
    0 &amp;amp;  1 &amp;amp; -1 &amp;amp;  0 \\&lt;br /&gt;
    5 &amp;amp;  0 &amp;amp;  1 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|@creeperman7002 [https://discord.com/channels/960643023006490684/1362008236118511758/1435763150489387090 5 Nov 2025]&lt;br /&gt;
|Decider: Daniel Yuan (@dyuan01) [https://discord.com/channels/960643023006490684/1438019511155691521/1438558242388312165 13 Nov 2025]&lt;br /&gt;
3 Holdouts: Racheline &amp;amp; Shawn Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|20&lt;br /&gt;
|746&lt;br /&gt;
|&amp;lt;code&amp;gt;[7/15, 22/3, 6/77, 5/2, 9/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
    1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    -1 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1438019511155691521/1438480761169776733 13 Nov 2025]&lt;br /&gt;
|Decider: Jason Yuen (@-d) &lt;br /&gt;
([https://github.com/int-y1/BBFractran/tree/main/holdout Enum+initial]) &lt;br /&gt;
Daniel Yuan (@dyuan01) [https://discord.com/channels/960643023006490684/1438019511155691521/1438559507579011194 13] and [https://discord.com/channels/960643023006490684/1438019511155691521/1438996636389998773 14 Nov 2025]&lt;br /&gt;
&lt;br /&gt;
Shawn Ligocki (@sligocki) [https://discord.com/channels/960643023006490684/1438019511155691521/1447069110541484146 7] and [https://discord.com/channels/960643023006490684/1438019511155691521/1453213088630444168 24 Dec 2025]&lt;br /&gt;
6 Holdouts: Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1438019511155691521/1452913055053778945 23 Dec 2025]&lt;br /&gt;
|-&lt;br /&gt;
|21&lt;br /&gt;
|31,957,632&lt;br /&gt;
|&amp;lt;code&amp;gt;[7/15, 4/3, 27/14, 5/2, 9/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 \\&lt;br /&gt;
    2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     3 &amp;amp;     0 &amp;amp;    -1 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1438019511155691521/1439759182587891894 16 Nov 2025]&lt;br /&gt;
|No holdouts remain. Claude Opus 4.6&#039;s proof of nonhalting of all the 140 holdouts: [https://discord.com/channels/960643023006490684/1438019511155691521/1485168251997786173 28 March 2026]&lt;br /&gt;
|-&lt;br /&gt;
|22&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 1.146 \times 10^{62}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/12, 9/10, 14/3, 11/2, 5/7, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Shawn Ligocki (@sligocki) [https://discord.com/channels/960643023006490684/1438019511155691521/1448912286713384961 11 Dec 2025] and Jason Yuen (@-d)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1448953682237460480 &amp;lt;nowiki&amp;gt;[1]&amp;lt;/nowiki&amp;gt;]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|3 holdouts remain. Claude Opus 4.6 gave a proof of all machines but the 3 Fenrir Cryptids, see [https://discord.com/channels/960643023006490684/1438019511155691521/1493027835559022824 Discord].&lt;br /&gt;
&lt;br /&gt;
The holdouts list whose elements are exactly the 3 Fenrir Cryptids on GitHub: [https://github.com/int-y1/BBFractran/blob/main/holdout/sz22_3.txt sz22_3.txt]&lt;br /&gt;
Known [[Cryptid|Cryptids]]: &lt;br /&gt;
&lt;br /&gt;
# Fenrir&lt;br /&gt;
|-&lt;br /&gt;
|23&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 4.393 \times 10^{124}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;[10/3, 9/14, 5/4, 121/2, 7/5, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
   -2 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     2 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Shawn Ligocki (@sligocki) [https://discord.com/channels/960643023006490684/1438019511155691521/1510781736374763702 1 Jun 2026]&lt;br /&gt;
|21,295 holdouts remain. [https://discord.com/channels/960643023006490684/1438019511155691521/1511579969825013811 2 Jun 2026]&lt;br /&gt;
By August 5th, 2026, the unofficial holdouts count had been reduced to 13. [https://github.com/int-y1/BBFractran/blob/main/holdout/sz23_13_unofficial.txt sz23_13_unofficial.txt]&lt;br /&gt;
Known [[Cryptid|Cryptids]]: &lt;br /&gt;
&lt;br /&gt;
# 11 Hydra-like Cryptids (including Frankenstein&#039;s Monster and Antihydra-like Cryptid)&lt;br /&gt;
|-&lt;br /&gt;
|24&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 9.000 \times 10^{14448}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;[14/15, 1/6, 11/3, 441/2, 5/7, 15/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;     0 &amp;amp;     2 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1438019511155691521/1547182811713380383 9 Sep 2026]&lt;br /&gt;
|231,432 holdouts remain. [https://github.com/int-y1/BBFractran/blob/main/holdout/sz24_231432.txt 12 Sep 2026]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Behavior of Champions ===&lt;br /&gt;
&lt;br /&gt;
==== Sequential programs ====&lt;br /&gt;
All champions up to BBf(14) have very simple behavior. They are all of the form: &amp;lt;math&amp;gt;\left[ \frac{3^{a_1}}{2}, \frac{5^{a_2}}{3}, \dots, \frac{p_n^{a_k}}{p_{k-1}}, \frac{1}{p_k} \right]&amp;lt;/math&amp;gt; or in vector representation (limited to k=4):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; a_1 &amp;amp;   0 &amp;amp;   0 &amp;amp;   0 \\&lt;br /&gt;
    0 &amp;amp;  -1 &amp;amp; a_2 &amp;amp;   0 &amp;amp;   0 \\&lt;br /&gt;
    0 &amp;amp;   0 &amp;amp;  -1 &amp;amp; a_3 &amp;amp;   0 \\&lt;br /&gt;
    0 &amp;amp;   0 &amp;amp;   0 &amp;amp;  -1 &amp;amp; a_4 \\&lt;br /&gt;
    0 &amp;amp;   0 &amp;amp;   0 &amp;amp;   0 &amp;amp;  -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
These champions repeatedly apply the rules in sequence, never going back to a previous rule. They apply the first rule until they&#039;ve exhausted all 2s, then the second rule until they&#039;ve exhausted all 3s, etc. They have a runtime of &amp;lt;math&amp;gt;1 + a_1 + a_1 a_2 + a_1 a_2 a_3 + \cdots = \sum_{i=0}^k \prod_{j=1}^i a_j&amp;lt;/math&amp;gt; and size &amp;lt;math&amp;gt;2k+2 + \sum_{i=1}^k a_i&amp;lt;/math&amp;gt;. This grows linearly for k=1 (BBf(5) to BBf(10)) and quadratically for k=2 (BBf(11) to BBf(14)). Letting k grow with the size, the maximum runtime grows exponentially in the program size.&lt;br /&gt;
&lt;br /&gt;
==== BBf(15) Family ====&lt;br /&gt;
The BBf(15) and BBf(16) champions are members of a family of programs (parameterized by &amp;lt;math&amp;gt;n \ge 1&amp;lt;/math&amp;gt;):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   0 &amp;amp; -2 &amp;amp; -1 \\&lt;br /&gt;
   2 &amp;amp;  0 &amp;amp; -1 \\&lt;br /&gt;
  -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  n&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Let a = 2, b = 3, and c = 5.&lt;br /&gt;
&lt;br /&gt;
The BBf(15) champion (n = 2) implements this iteration:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  b^0     &amp;amp; \xrightarrow{0} &amp;amp; \text{halt} \\&lt;br /&gt;
  b^1     &amp;amp; \xrightarrow{7} &amp;amp; b^4 \\&lt;br /&gt;
  b^2     &amp;amp; \xrightarrow{7} &amp;amp; b^5 \\&lt;br /&gt;
  b^3     &amp;amp; \xrightarrow{5} &amp;amp; b^2 \\&lt;br /&gt;
  b^4     &amp;amp; \xrightarrow{5} &amp;amp; b^3 \\&lt;br /&gt;
  b^{k+5} &amp;amp; \xrightarrow{3} &amp;amp; b^k \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which follows a permutation-like trajectory: &amp;lt;math&amp;gt;a \xrightarrow{1} b^1 \to b^4 \to b^3 \to b^2 \to b^5 \to b^0 \to \text{halt}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The BBf(16) champion (n = 3) implements this iteration:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  b^0     &amp;amp; \xrightarrow{0}  &amp;amp; \text{halt} \\&lt;br /&gt;
  b^1     &amp;amp; \xrightarrow{10} &amp;amp; b^6 \\&lt;br /&gt;
  b^2     &amp;amp; \xrightarrow{10} &amp;amp; b^7 \\&lt;br /&gt;
  b^3     &amp;amp; \xrightarrow{8}  &amp;amp; b^4 \\&lt;br /&gt;
  b^4     &amp;amp; \xrightarrow{8}  &amp;amp; b^5 \\&lt;br /&gt;
  b^5     &amp;amp; \xrightarrow{6}  &amp;amp; b^2 \\&lt;br /&gt;
  b^6     &amp;amp; \xrightarrow{6}  &amp;amp; b^3 \\&lt;br /&gt;
  b^{k+7} &amp;amp; \xrightarrow{4}  &amp;amp; b^k \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which follows a permutation-like trajectory: &amp;lt;math&amp;gt;a \xrightarrow{1} b^1 \to b^6 \to b^3 \to b^4 \to b^5 \to b^2 \to b^7 \to b^0 \to \text{halt}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== BBf(17) Family ====&lt;br /&gt;
The BBf(17) to BBf(19) champions are members of a family of programs (parameterized by &amp;lt;math&amp;gt;m,n \ge 0&amp;lt;/math&amp;gt;)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   -1 &amp;amp;  0 &amp;amp;  0 &amp;amp;  n \\&lt;br /&gt;
    0 &amp;amp;  1 &amp;amp; -1 &amp;amp;  0 \\&lt;br /&gt;
    m &amp;amp;  0 &amp;amp;  1 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which have size &amp;lt;math&amp;gt;m+n+12&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This family obeys the following rules:&lt;br /&gt;
&lt;br /&gt;
# &amp;lt;math&amp;gt;[1, 0, 0, 0] \xrightarrow{1} [0, 0, 0, n]&amp;lt;/math&amp;gt;&lt;br /&gt;
# if d≥1 and b≤m:&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;[0, b, 0, d] \xrightarrow{m+b+2} [0, b+1, 0, d - 1 + n(m-b)]&amp;lt;/math&amp;gt;&lt;br /&gt;
# if d≥1 and b≥m:&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;[0, b, 0, d] \xrightarrow{2m+2} [0, b+1, 0, d - 1]&amp;lt;/math&amp;gt;&lt;br /&gt;
#if d=0: [0,b,0,d] has halted&lt;br /&gt;
&lt;br /&gt;
and furthermore these rules are applied in order since b is always increasing (and d is eventually decreasing). Combining these together we get runtime:&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;1 + n(m+1)(m(m+1)+2) - \frac{m(m+1)}{2}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The optimal choices for n,m for various program sizes are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Size&lt;br /&gt;
!n&lt;br /&gt;
!m&lt;br /&gt;
!Runtime&lt;br /&gt;
|-&lt;br /&gt;
|16&lt;br /&gt;
|1&lt;br /&gt;
|3&lt;br /&gt;
|51&lt;br /&gt;
|-&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;17&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;2&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;3&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;107&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|-&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;18&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;2&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;4&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;211&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|-&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;19&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;2&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;5&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;370&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|-&lt;br /&gt;
|20&lt;br /&gt;
|2&lt;br /&gt;
|6&lt;br /&gt;
|596&lt;br /&gt;
|-&lt;br /&gt;
|21&lt;br /&gt;
|3&lt;br /&gt;
|6&lt;br /&gt;
|904&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
==== BBf(20) ====&lt;br /&gt;
[[File:Screenshot 2026-04-01 104704.png|alt=Full space-time diagram of the BBf(20) champion.|left|507x507px]]&lt;br /&gt;
The BBf(20) champion (running 746 steps):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
    1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    -1 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This program implements a [[Collatz-like]] iteration. Let &amp;lt;math&amp;gt;C(n) = [0, 0, n, 2, 0]&amp;lt;/math&amp;gt;, then:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0] &amp;amp; \xrightarrow{49}     &amp;amp; C(2) \\&lt;br /&gt;
  C(3k)       &amp;amp; \xrightarrow{3k}     &amp;amp; \text{halt} \\&lt;br /&gt;
  C(3k+1)     &amp;amp; \xrightarrow{11k+22} &amp;amp; C(4k+3) \\&lt;br /&gt;
  C(3k+2)     &amp;amp; \xrightarrow{11k+22} &amp;amp; C(4k+4) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which follows the reasonably &amp;quot;lucky&amp;quot; trajectory:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;C(2) \to C(4) \to C(7) \to C(11) \to C(16) \to C(23) \to C(32) \to C(44) \to C(60) \to \text{halt}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==== BBf(21) ====&lt;br /&gt;
[[File:Bbf21 champ full.png|alt=The full space-time diagram of the BBf(21) champion until halting.|thumb|The full space-time diagram of the BBf(21) champion until halting.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The BBf(21) champion (running &amp;gt;31M steps):&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 \\&lt;br /&gt;
    2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     3 &amp;amp;     0 &amp;amp;    -1 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This program implements a Collatz-like iteration. Let &amp;lt;math&amp;gt;D(n) = [0, 0, n, 0]&amp;lt;/math&amp;gt;, then:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1439779341365022852]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0] &amp;amp; \xrightarrow{1}      &amp;amp; D(1) \\&lt;br /&gt;
  D(3k)       &amp;amp; \xrightarrow{k}      &amp;amp; \text{halt} \\&lt;br /&gt;
  D(3k+1)     &amp;amp; \xrightarrow{21k+7}  &amp;amp; C(10k+4) \\&lt;br /&gt;
  D(3k+2)     &amp;amp; \xrightarrow{21k+14} &amp;amp; C(10k+7) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which follows the reasonably &amp;quot;lucky&amp;quot; trajectory:&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{ll}&lt;br /&gt;
  D(1) &amp;amp; \to D(4) \to D(14) \to D(47) \to D(157) \to D(524) \to D(1747) \to D(5824) \to D(19414) \\&lt;br /&gt;
       &amp;amp; \to D(64714) \to D(215714) \to D(719047) \to D(2396824) \to D(7989414) \to \text{halt} \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== BBf(22) ====&lt;br /&gt;
The BBf(22) champion (running &amp;lt;math&amp;gt;&amp;gt; 10^{62}&amp;lt;/math&amp;gt; steps):&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This program implements a [[Collatz-like]] unbiased pseudo-random walk. Let &amp;lt;math&amp;gt;S(x,y) = [0, 0, x, 0, y]&amp;lt;/math&amp;gt;, then:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1449118888142049421]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0]  &amp;amp; \xrightarrow{1}      &amp;amp; S(0,1) \\&lt;br /&gt;
  S(x, 0)      &amp;amp;  =                   &amp;amp; \text{halt} \\&lt;br /&gt;
  S(3k,   y+1) &amp;amp; \xrightarrow{14k+4}  &amp;amp; S(5k+1, y+1) \\&lt;br /&gt;
  S(3k+1, y+1) &amp;amp; \xrightarrow{14k+10} &amp;amp; S(5k+3, y+2) \\&lt;br /&gt;
  S(3k+2, y+1) &amp;amp; \xrightarrow{14k+12} &amp;amp; S(5k+4, y) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This pseudo-random walk iterates 275 times until it halts reaching a maximum y value of 14 at iteration 111:&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{ll}&lt;br /&gt;
 S(0,1) &amp;amp; \to S(1,1) \to S(3,2) \to S(6,2) \to S(11, 2) \to S(19, 1) \to S(33, 2) \to S(56, 2) \to S(94, 1) \\&lt;br /&gt;
        &amp;amp; \to S(158, 2) \to S(264, 1) \to S(441, 1) \to S(736, 1) \to S(1228, 2) \to S(2048, 3) \\&lt;br /&gt;
        &amp;amp; \vdots \\&lt;br /&gt;
        &amp;amp; \to S(4065328691604230522442358, 13) \\&lt;br /&gt;
        &amp;amp; \to S(6775547819340384204070598, 14) \\&lt;br /&gt;
        &amp;amp; \to S(11292579698900640340117664, 13) \\&lt;br /&gt;
        &amp;amp; \vdots \\&lt;br /&gt;
        &amp;amp; \to S(27930059557111373800280446055462487109112535227834136644, 2) \\&lt;br /&gt;
        &amp;amp; \to S(46550099261852289667134076759104145181854225379723561074, 1) \\&lt;br /&gt;
        &amp;amp; \to S(77583498769753816111890127931840241969757042299539268458, 2) \\&lt;br /&gt;
        &amp;amp; \to S(129305831282923026853150213219733736616261737165898780764, 1) \\&lt;br /&gt;
        &amp;amp; \to S(215509718804871711421917022032889561027102895276497967941, 1) \\&lt;br /&gt;
        &amp;amp; \to S(359182864674786185703195036721482601711838158794163279903, 2) \\&lt;br /&gt;
        &amp;amp; \vdots \\&lt;br /&gt;
        &amp;amp; \to S(5894430516013404355095519889620117404469367857588232386361874, 2) \\&lt;br /&gt;
        &amp;amp; \to S(9824050860022340591825866482700195674115613095980387310603124, 1) \\&lt;br /&gt;
        &amp;amp; \to S(16373418100037234319709777471166992790192688493300645517671874, 0)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
If it were a truly random walk, there would be a 5.9% chance that it takes at least 275 steps to reach 0. So this program is mildly lucky.&lt;br /&gt;
==== BBf(23) ====&lt;br /&gt;
The BBf(23) champion&lt;br /&gt;
&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
   -2 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     2 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt; follows an unbiased [[Collatz-like]] pseudo-random walk:&lt;br /&gt;
let &amp;lt;math&amp;gt;A(x,y)=[0,0,0,x,y]&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;[1,0,0,0,0] \to A(0,2)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(2x,y) \xrightarrow{12x+4} A(5x+1,y+1)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(2x+1,y) \xrightarrow{12x+10} A(5x+4,y-1)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(x,0) \to halt&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(0,2) \to A(1,3) \to A(4,2) \to A(11,3) \to A(29,2) \to A(74,1) \to A(186,2) \to A(466,3) \to A(1166,4) \to A(2916,5) \to A(7291,6) \to \dots&amp;lt;/math&amp;gt;&lt;br /&gt;
==== BBf(24) ====&lt;br /&gt;
The BBf(24) champion&lt;br /&gt;
&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
1 &amp;amp; -1 &amp;amp; -1 &amp;amp; 1 &amp;amp; 0 \\&lt;br /&gt;
-1 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 \\&lt;br /&gt;
0 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 1 \\&lt;br /&gt;
-1 &amp;amp; 2 &amp;amp; 0 &amp;amp; 2 &amp;amp; 0 \\&lt;br /&gt;
0 &amp;amp; 0 &amp;amp; 1 &amp;amp; -1 &amp;amp; 0 \\&lt;br /&gt;
0 &amp;amp; 1 &amp;amp; 1 &amp;amp; 0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt; follows an unbiased [[Collatz-like]] pseudo-random walk: let &amp;lt;math&amp;gt;A(x,y) = [0,0,0,x,y]&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;[1,0,0,0,0] \xrightarrow{3} A(2,2)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(x,0) \xrightarrow{x} halt&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(3x,y) \xrightarrow{9x+5} A(7x+3,y+1)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(3x+1,y) \xrightarrow{9x+6} A(7x+4,y-1)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(3x+2,y) \xrightarrow{9x+10} A(7x+7,y)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(2,2) \to A(7,2) \to A(18,1) \to A(45,2) \to A(108,3) \to A(255,4) \to A(598,5) \to A(1397,4) \to A(3262,4) \to \dots&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
&lt;br /&gt;
=== Size 22: Fenrir ===&lt;br /&gt;
[[File:Fractran 22 Cryptid.webp|alt=The space-time diagram of Fenrir.|thumb|Partial space-time diagram of Fenrir (#29).]]&lt;br /&gt;
&amp;quot;Fenrir&amp;quot; is a family of 3 size 22 [[Cryptids]] discovered by Jason Yuen (@-d) and Claude Opus 4.6 on 22 Mar 2026. Out of 2003 holdouts of size 22, Claude Opus 4.6 used Lean to prove that 1997 holdouts were non-halting and 3 holdouts were halting; the remaining 3 holdouts are the Fenrir family.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1485415054475268179]&amp;lt;/sup&amp;gt; Discord user @ZTS439 shared [https://discord.com/channels/960643023006490684/1438019511155691521/1487251919444508723 some analysis] and a [https://discord.com/channels/960643023006490684/1438019511155691521/1487252789158613002 Python program] for it. Its name comes from [[wikipedia:Norse_mythology|Nordic mythology]]; [[wikipedia:Fenrir|Fenrir]] is the wolf that helps destroy the world during [[wikipedia:Ragnarök|Ragnarök]].&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Holdout number&lt;br /&gt;
!Holdout&lt;br /&gt;
!Vector Representation&lt;br /&gt;
|-&lt;br /&gt;
| 29/2003&lt;br /&gt;
| &amp;lt;code&amp;gt;[1/15, 27/77, 49/3, 10/49, 33/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     3 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    -1 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     2 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -2 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 41/2003&lt;br /&gt;
| &amp;lt;code&amp;gt;[1/15, 49/3, 27/77, 10/49, 33/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     2 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     3 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    -1 \\&lt;br /&gt;
    1 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -2 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 430/2003&lt;br /&gt;
| &amp;lt;code&amp;gt;[27/35, 1/33, 25/3, 22/25, 21/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;     3 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     2 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;     0 &amp;amp;    -2 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
   -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
All 3 holdouts follow a biased random walk that somewhat resembles [[Hydra]]. Let &amp;lt;math&amp;gt;S(x,y) = [x, 0, 0, 2, y]&amp;lt;/math&amp;gt; (for 29/2003 and 41/2003) or &amp;lt;math&amp;gt;S(x,y) = [x, 0, 2, y, 0]&amp;lt;/math&amp;gt; (for 430/2003), then:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0] &amp;amp; \xrightarrow{2} &amp;amp; S(0,1) \\&lt;br /&gt;
  S(0, 2y)    &amp;amp; \xrightarrow{23y + 3}  &amp;amp; \text{halt} \\&lt;br /&gt;
  S(x, 2y)    &amp;amp; \xrightarrow{23y + 5} &amp;amp; S(x-1, 5y+2) \\&lt;br /&gt;
  S(x, 2y+1)  &amp;amp; \xrightarrow{23y + 13} &amp;amp; S(x+2, 5y)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The first few visited states are:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(0, 1) \to S(2, 0) \to S(1, 2) \to S(0, 7) \to S(2, 15) \to S(4, 35) \cdots&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Size 23: 11 Hydra-like Cryptids ===&lt;br /&gt;
&lt;br /&gt;
Define &amp;lt;math&amp;gt;Hydra(r_\mathrm{num}, r_\mathrm{den}, x_\mathrm{offset}, y_\mathrm{offset}, (x_\mathrm{init}, y_\mathrm{init}))&amp;lt;/math&amp;gt; to be the problem as follows:&lt;br /&gt;
&lt;br /&gt;
# The initial state is &amp;lt;math&amp;gt;(x_\mathrm{init}, y_\mathrm{init})&amp;lt;/math&amp;gt;.&lt;br /&gt;
# The iteration &amp;lt;math&amp;gt;(x, y) \mapsto (r_\mathrm{num} \times \lfloor x/r_\mathrm{den} \rfloor + x_\mathrm{offset}[x \bmod r_\mathrm{den}], y + y_\mathrm{offset}[x \bmod r_{den}])&amp;lt;/math&amp;gt; is repeated. Here, &amp;lt;math&amp;gt;x_\mathrm{offset}, y_\mathrm{offset}&amp;lt;/math&amp;gt; are 0-indexed.&lt;br /&gt;
# Are all the values of y non-negative?&lt;br /&gt;
&lt;br /&gt;
Furthermore, the Hydra-like problem is considered a [[Cryptids|Cryptid]] if it also satisfies:&lt;br /&gt;
&lt;br /&gt;
# &amp;lt;math&amp;gt;y_\mathrm{offset}&amp;lt;/math&amp;gt; contains a negative number, and the average is positive.&lt;br /&gt;
# &amp;lt;math&amp;gt;x \bmod r_\mathrm{den}&amp;lt;/math&amp;gt; is a pseudorandom sequence.&lt;br /&gt;
#There are no negative values of &amp;lt;math&amp;gt;y&amp;lt;/math&amp;gt; early on.&lt;br /&gt;
&lt;br /&gt;
For example, Fenrir is non-halting if and only if Hydra(5, 2, [2, 0], [-1, 2], (1, 0)). In this Hydra problem, the first few visited states are &amp;lt;math&amp;gt;(1, 0) \to (0, 2) \to (2, 1) \to (7, 0) \to (15, 2) \to (35, 4)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
There are 11 Hydra-like Cryptids of size exactly 23, listed in the table below. All 11 Cryptids are not correlated with each other. Fenrir is included in the table as a reference.&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Domain: Holdout Number&lt;br /&gt;
!Holdout&lt;br /&gt;
!Hydra problem&lt;br /&gt;
!Notes&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #11/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/135, 25/21, 33/5, 2/3, 7/11, 5/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(7, 4, [1, 3, 5, 6], [0, 1, 2, -1], (1, 0))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(22): #29/2003&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/15, 27/77, 49/3, 10/49, 33/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 2, [2, 0], [-1, 2], (1, 0))&lt;br /&gt;
|Fenrir&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #26/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/15, 49/3, 81/77, 10/49, 33/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(7, 2, [-1, 8], [3, -1], (1, 2))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #47/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/18, 4/15, 21/2, 121/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 3, [1, 3, 4], [1, 3, -1], (1, 1))&lt;br /&gt;
|If #47 doesn&#039;t halt then Frankenstein&#039;s Monster doesn&#039;t halt&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #77/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/54, 4/15, 21/2, 11/3, 5/7, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(7, 4, [0, 2, 4, 5], [0, 1, 2, -1], (1, 0))&lt;br /&gt;
|Same ratio 7/4 as #11&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #151/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[14/15, 1/12, 11/3, 63/2, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(8, 5, [1, 2, 4, 6, 7], [2, -1, 1, 3, 0], (0, 1))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #159/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[14/15, 1/6, 121/3, 63/2, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 3, [1, 2, 4], [3, -1, 1], (1, 3))&lt;br /&gt;
|Same ratio 5/3 as #47&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #207/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[2/15, 1/12, 441/2, 11/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(6, 5, [1, 3, 3, 5, 5], [1, 3, 0, 2, -1], (1, 1))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #218/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[2/15, 1/6, 441/2, 121/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(4, 3, [1, 2, 3], [3, 1, -1], (1, 3))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #317/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[4/15, 1/18, 63/2, 11/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 4, [1, 2, 3, 5], [1, 0, -1, 2], (1, 1))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #319/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[4/15, 1/24, 21/2, 11/3, 5/7, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 4, [0, 2, 4, 3], [0, 1, 2, -1], (1, 0))&lt;br /&gt;
|Same ratio 5/4 as #317&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #323/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[4/15, 1/6, 21/2, 1331/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(3, 2, [1, 2], [2, -1], (1, 2))&lt;br /&gt;
|If #323 doesn&#039;t halt then Antihydra-like Cryptid doesn&#039;t halt&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
As of August 2026, the 13 unofficial holdouts are as follows: Fenrir, 11 Hydra-like Cryptids of size 23, and #601 &amp;lt;code&amp;gt;[9/10, 1/42, 22/3, 49/2, 5/11, 3/7]&amp;lt;/code&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
==== Frankenstein&#039;s Monster ====&lt;br /&gt;
[[File:Frankenstein&#039;s Monster.webp|alt=Partial space-time diagram of Frankenstein&#039;s Monster.|thumb|Partial space-time diagram of Frankenstein&#039;s Monster.]]&lt;br /&gt;
&amp;quot;Frankenstein&#039;s Monster&amp;quot; is a size 23 [[Cryptid]]. It was created by tweaking a single instruction in the size 22 champion. This tweak switches it from a unbiased random walk to a biased one and thus makes halting probviously impossible. It is called Frankenstein&#039;s Monster since it was found by a combination of exhaustive search and hand design.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1449138938215141478]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;[1/12, 9/10, 14/3, 121/2, 5/7, 3/11]&amp;lt;/code&amp;gt; &amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     2 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Its behavior is extremely similar to the size 22 champion. Let &amp;lt;math&amp;gt;S(x,y) = [0, 0, x, 0, y]&amp;lt;/math&amp;gt;, then:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0]  &amp;amp; \xrightarrow{1}      &amp;amp; S(0,2) \\&lt;br /&gt;
  S(x, 0)      &amp;amp;  =                   &amp;amp; \text{halt} \\&lt;br /&gt;
  S(3k,   y+1) &amp;amp; \xrightarrow{14k+4}  &amp;amp; S(5k+1, y+2) \\&lt;br /&gt;
  S(3k+1, y+1) &amp;amp; \xrightarrow{14k+10} &amp;amp; S(5k+3, y+4) \\&lt;br /&gt;
  S(3k+2, y+1) &amp;amp; \xrightarrow{14k+12} &amp;amp; S(5k+4, y)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with the only difference that the &amp;lt;math&amp;gt;y&amp;lt;/math&amp;gt; values now change by &amp;lt;math&amp;gt;\{+1,+3,-1\}&amp;lt;/math&amp;gt; depending on the value of &amp;lt;math&amp;gt;x\bmod 3&amp;lt;/math&amp;gt; (instead of &amp;lt;math&amp;gt;\{0,+1,-1\}&amp;lt;/math&amp;gt; in the original size 22 program). The &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; values follow the exact same path as in the original size 22 champion, but the y values quickly grow linearly with the number of iterations (as expected by the random model):&lt;br /&gt;
          0: S(0, 1)  @ 1  (0.00s)&lt;br /&gt;
    100_000: S(10^22_185, 100171)  @ 10^22_186  (0.87s)&lt;br /&gt;
    200_000: S(10^44_370, 200187)  @ 10^44_371  (3.42s)&lt;br /&gt;
    300_000: S(10^66_555, 300759)  @ 10^66_556  (7.68s)&lt;br /&gt;
    400_000: S(10^88_740, 400451)  @ 10^88_741  (13.64s)&lt;br /&gt;
    500_000: S(10^110_925, 500421)  @ 10^110_925  (21.28s)&lt;br /&gt;
    600_000: S(10^133_109, 600351)  @ 10^133_110  (30.62s)&lt;br /&gt;
    700_000: S(10^155_294, 700319)  @ 10^155_295  (41.64s)&lt;br /&gt;
    800_000: S(10^177_479, 799911)  @ 10^177_480  (54.30s)&lt;br /&gt;
    900_000: S(10^199_664, 900259)  @ 10^199_665  (68.59s)&lt;br /&gt;
  1_000_000: S(10^221_849, 1000853)  @ 10^221_850  (84.51s)&lt;br /&gt;
 ...&lt;br /&gt;
  4_000_000: S(10^887_395, 4000201)  @ 10^887_396  (1474.02s)&lt;br /&gt;
 ...&lt;br /&gt;
 27_500_000: S(10^6_100_841, 27512703)  @ 10^6_100_842  (87616.45s)&lt;br /&gt;
&lt;br /&gt;
==== Antihydra-like Cryptid ====&lt;br /&gt;
This Cryptid is a size 23 [[Cryptid]]. This Cryptid was [https://discord.com/channels/960643023006490684/1438019511155691521/1449293536737361973 constructed by Maksandchael] by tweaking Frankenstein&#039;s Monster to make it as similar to [[Antihydra]] as possible. &amp;lt;code&amp;gt;[9/10, 1/6, 1331/2, 14/3, 5/7, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     3 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&amp;lt;pre&amp;gt;&lt;br /&gt;
H(a, b) = [0, 0, a-2, 0, b]&lt;br /&gt;
Start -&amp;gt; H(2, 3)&lt;br /&gt;
H(2a, b) -&amp;gt; H(3a, b+2)&lt;br /&gt;
H(2a+1, b+1) -&amp;gt; H(3a+1, b)&lt;br /&gt;
H(a,0) -&amp;gt; halt&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Size 25: Hydra ===&lt;br /&gt;
[[File:Hydra.webp|alt=Partial space-time diagram of Hydra.|thumb|300x300px|Partial space-time diagram of Hydra.]]&lt;br /&gt;
A size 25 program was produced and golfed by hand to simulate [[Hydra]] rules ([https://discord.com/channels/960643023006490684/1438019511155691521/1449829146040467681 Discord]):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;[363/14, 125/2, 22/21, 1/3, 7/11, 14/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;&lt;br /&gt;
\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     2 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     3 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     1 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 \\&lt;br /&gt;
    1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The intended interpretation is that if we let &amp;lt;math&amp;gt;S(h,w) = [1, 0, w, h-3, 0]&lt;br /&gt;
&amp;lt;/math&amp;gt; then it follows the following rules:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,\dots]  &amp;amp; =     &amp;amp; S(3, 0) \\&lt;br /&gt;
  S(2k,   0)   &amp;amp; \to^* &amp;amp; \text{halt} \\&lt;br /&gt;
  S(2k,   w+1) &amp;amp; \to^* &amp;amp; S(3k,   w) \\&lt;br /&gt;
  S(2k+1, w)   &amp;amp; \to^* &amp;amp; S(3k+1, w+2)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Size 48: BMO 6 (&amp;quot;Space Needle&amp;quot;) ===&lt;br /&gt;
[[File:Space Needle.webp|alt=Partial space-time diagram of Space Needle.|thumb|Partial space-time diagram of Space Needle.]]&lt;br /&gt;
A size 48 program was produced by hand to simulate [https://wiki.bbchallenge.org/wiki/1RB1LA_1LC0RE_1LF1LD_0RB0LA_1RC1RE_---0LD BMO 6] rules ([https://discord.com/channels/960643023006490684/1438019511155691521/1441137371046482071 Discord])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;[77/2, 2/99, 17/33, 13/11, 285/119, 17/19, 1375/51, 1/17, 3/5, 243/7, 10/13]&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    -1 &amp;amp;    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    1 &amp;amp;    -2 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;    1 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     1 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    1 &amp;amp;     1 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    1 \\&lt;br /&gt;
    0 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;    1 &amp;amp;    -1 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     3 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    1 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    5 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    1 &amp;amp;    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;    0 &amp;amp;    0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&amp;lt;pre&amp;gt;A(a, b) = B^a C^b E or B^(a-2) C^b D E&lt;br /&gt;
&lt;br /&gt;
Start: A(7, 1)&lt;br /&gt;
&lt;br /&gt;
A(1, b) --&amp;gt; halt&lt;br /&gt;
&lt;br /&gt;
A(2a, b) --&amp;gt; A(5a+b+2, 1)&lt;br /&gt;
&lt;br /&gt;
A(2a+1, b) --&amp;gt; A(b-1, b+c+3)&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other notable machines ==&lt;br /&gt;
&lt;br /&gt;
=== Size 24: Energy Vampire ===&lt;br /&gt;
The size 24 machine &amp;lt;code&amp;gt;[2/15, 1/6, 441/2, 11/3, 25/7, 6/11]&amp;lt;/code&amp;gt;, or &amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
1 &amp;amp; -1 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 \\&lt;br /&gt;
-1 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 \\&lt;br /&gt;
-1 &amp;amp; 2 &amp;amp; 0 &amp;amp; 2 &amp;amp; 0 \\&lt;br /&gt;
0 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 1 \\&lt;br /&gt;
0 &amp;amp; 0 &amp;amp; 2 &amp;amp; -1 &amp;amp; 0 \\&lt;br /&gt;
1 &amp;amp; 1 &amp;amp; 0 &amp;amp; 0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;, discovered by Jason Yuen (@-d) and Claude Opus 5.5, follows a particularly lucky unbiased pseudo-random walk.&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;A(x,y) = [0, 0, 0, 2x, y]&amp;lt;/math&amp;gt;, then:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1563398072040427611]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0]  &amp;amp; \xrightarrow{3}      &amp;amp; A(1, 2) \\&lt;br /&gt;
  A(x, 0)      &amp;amp;  \xrightarrow{2x} &amp;amp; [0, 0, 4x, 0, 0] \ (\text{halt}) \\&lt;br /&gt;
  A(3k,   y + 1) &amp;amp; \xrightarrow{30k + 2}  &amp;amp; S(8k, y) \\&lt;br /&gt;
  A(3k + 1, y + 1) &amp;amp; \xrightarrow{30k + 13} &amp;amp; S(8k + 3, y + 1) \\&lt;br /&gt;
  A(3k + 2, y + 1) &amp;amp; \xrightarrow{30k + 24} &amp;amp; S(8k + 6, y + 2) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This corresponds to the Hydra problem Hydra(8, 3, [0, 3, 6], [-1, 0, 1], (1, 1)).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1563346300139864074]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This machine iterates this pseudo-random walk over 2&amp;lt;sup&amp;gt;38&amp;lt;/sup&amp;gt; times;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1564736905344454677]&amp;lt;/sup&amp;gt; it should be probabilistically guaranteed to halt (assuming Collatz-like behavior is random). @-d is currently verifying a simulation that claims the machine halts after over 1.714 × 10&amp;lt;sup&amp;gt;210,914,744,116&amp;lt;/sup&amp;gt; steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1565647448452636672]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(1,2) \to A(3,2) \to A(8,1) \to A(22,2) \to A(59,2) \to A(158,3) \to A(422,4) \to A(1126,5) \to A(3003,5) \to A(8008,4) \to \dots&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This machine is the [[Beaver Math Olympiad]]&#039;s 12th problem.&lt;br /&gt;
&lt;br /&gt;
=== Size 24: Time Vampire ===&lt;br /&gt;
The size 24 machine &amp;lt;code&amp;gt;[14/15, 1/66, 9/2, 121/3, 5/7, 10/11]&amp;lt;/code&amp;gt; discovered by Jason Yuen (@-d)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1568748374545666248]&amp;lt;/sup&amp;gt; and analyzed by Shawn Ligocki,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1569110043910082695][https://discord.com/channels/960643023006490684/1438019511155691521/1569176059490865306]&amp;lt;/sup&amp;gt; follows these rules which seems like they should probviously halt, but may take years (or centuries) of serial simulation:&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;S(d,e) = [0, 0, 0, d, e]&amp;lt;/math&amp;gt;, then:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcll}&lt;br /&gt;
  [1,0,0,0,0]  &amp;amp; \to &amp;amp; S(0, 4) \\&lt;br /&gt;
  S(d, 0)    &amp;amp; \to &amp;amp; \text{Halt} \\&lt;br /&gt;
  S(d, e)    &amp;amp; \to &amp;amp; S(d+1, 2d-6e+12) &amp;amp; \text{if } 1 \le e \le \frac{d}{3} + 1 \\&lt;br /&gt;
  S(3k,   e) &amp;amp; \to &amp;amp; S(3k+1, e-k-2)   &amp;amp; \text{if } e \ge k+2 \\&lt;br /&gt;
  S(3k+1, e) &amp;amp; \to &amp;amp; S(3k+1, e-k)     &amp;amp; \text{if } e \ge k+2 \\&lt;br /&gt;
  S(3k+2, e) &amp;amp; \to &amp;amp; S(3k+1, e-k+2)   &amp;amp; \text{if } e \ge k+2 \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Note that always &amp;lt;math&amp;gt;d \to d+1&amp;lt;/math&amp;gt;, but &#039;&#039;e&#039;&#039; follows a more complex trajectory.&lt;br /&gt;
&lt;br /&gt;
Shawn Ligocki has simulated this out to config S(240 000 000 000 000, 23 790 622 663 866) (108 hours of serial computation).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1571006879025336343]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Size 36: BMO1 ===&lt;br /&gt;
[[File:Ftran bmo1.png|alt=Partial space-time diagram of BMO 1.|thumb|Partial space-time diagram of BMO 1.]]&lt;br /&gt;
A size 36 program was produced by hand to simulate [[BMO1]] rules ([https://discord.com/channels/960643023006490684/1438019511155691521/1440018895212642424 Discord]):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;[153/55, 2/11, 26/35, 3/7, 11/17, 7/13, 25/6, 55/2, 14/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;&lt;br /&gt;
\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    2 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;    1 \\&lt;br /&gt;
    1 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;    0 \\&lt;br /&gt;
    1 &amp;amp;    0 &amp;amp;     -1 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     -1 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;    1 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 \\&lt;br /&gt;
    -1 &amp;amp;     -1 &amp;amp;     2 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    -1 &amp;amp;     0 &amp;amp;    1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;A(a,b) = [a, b, 0, 0, 0, 0, 0]&amp;lt;/math&amp;gt;, then it follows the rules:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,\dots] &amp;amp; \xrightarrow{4}&amp;amp; A(1, 2) \\&lt;br /&gt;
  A(a, b) &amp;amp; \xrightarrow{5b+4}&amp;amp; A(a-b, 4b+2) &amp;amp; \text{if } a &amp;gt; b \\&lt;br /&gt;
  A(a, b) &amp;amp; \xrightarrow{5a+2} &amp;amp; A(2a+1, b-a) &amp;amp; \text{if } a &amp;lt; b \\&lt;br /&gt;
  A(a, b) &amp;amp; \xrightarrow{a} &amp;amp; \text{Halt} &amp;amp; \text{if } a = b&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Functions]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Pebble_Automaton&amp;diff=10651</id>
		<title>Pebble Automaton</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Pebble_Automaton&amp;diff=10651"/>
		<updated>2026-11-13T15:21:17Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* The Golems */ potential Cryptids&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Stub}}&lt;br /&gt;
A pebble automaton is a type of [[cellular automaton]] introduced by AlephSquirrel, based on a Codeforces problem, also called Pebble Automaton.&amp;lt;ref&amp;gt;https://codeforces.com/gym/106465/problem/B&amp;lt;/ref&amp;gt; Each cell contains a non-negative number of pebbles, and the number of pebbles in the cell determines how many pebbles to push to each neighbor. Though in the original problem, the behavior of a cell also depended on the cell&#039;s location, the cellular automaton removes this dependence. Investigation so far has primarily focused on 1-dimensional pebble automata, but multi-dimensional pebble automata could be considered.&lt;br /&gt;
&lt;br /&gt;
Pebble automata have been informally shown to be [[Turing-complete]] via a reduction to 2-register [[Register machine|Register machines]].&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1535695107448381591/1567607590970458274&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Definition ==&lt;br /&gt;
A 1D pebble automaton is defined by three integer functions L(n), S(n) and R(n), defined over non-negative integers n, under the constraints:&lt;br /&gt;
&lt;br /&gt;
* L(n) ≥ 0&lt;br /&gt;
* S(n) ≥ 0&lt;br /&gt;
* R(n) ≥ 0&lt;br /&gt;
* L(n) + S(n) + R(n) = n for all n&lt;br /&gt;
&lt;br /&gt;
A simulation of a pebble automaton is represented by p(x, t), the number of pebbles at position x and time t. The initial configuration (t=0) has all n pebbles at x=0 and each generation, the pebbles are moved around according to the L, S, R rules:&lt;br /&gt;
&lt;br /&gt;
* p(0, 0) = n&lt;br /&gt;
* p(x, 0) = 0 for x ≠ 0&lt;br /&gt;
* p(x, t+1) = R(p(x-1, t)) + S(p(x,t)) + L(p(x+1, t))&lt;br /&gt;
&lt;br /&gt;
Informally, when a cell has n pebbles, it pushes L(n) to its left neighbor, R(n) to its right neighbor and S(n) stay.&lt;br /&gt;
&lt;br /&gt;
Because the number of pebbles is preserved in each row, the maximum number of pebbles in one location is n. Therefore, a pebble automaton only needs to specify the function values up to n.&lt;br /&gt;
&lt;br /&gt;
== Busy Beaver function ==&lt;br /&gt;
We say a pebble automaton has stabilized if no pebbles are moving; for any k in the configuration, L(k) = R(k) = 0.&lt;br /&gt;
&lt;br /&gt;
Let us define peBBle(n) as the maximum number of steps it takes for any pebble automaton to stabilize, starting from an initial state of n pebbles in a single cell.&lt;br /&gt;
&lt;br /&gt;
Notation (long version): &amp;lt;code&amp;gt;&amp;lt;nowiki&amp;gt;n --&amp;gt; L(n) | S(n) | R(n)&amp;lt;/nowiki&amp;gt;&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;0 --&amp;gt; 0 | 0 | 0&amp;lt;/code&amp;gt; is omitted since it is forced by the definition.&lt;br /&gt;
&lt;br /&gt;
The short version sets the rules in increasing order, separated by underscores, and removes &amp;lt;code&amp;gt;S(n)&amp;lt;/code&amp;gt; since it can be obtained with the equation &amp;lt;code&amp;gt;S(N) = n - L(n) - R(n)&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If there are over 10 pebbles, lowercase letters are used for numbers greater than 9 (a=10, b=11, etc.)&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!peBBle(n)&lt;br /&gt;
!Champion&lt;br /&gt;
|-&lt;br /&gt;
|1&lt;br /&gt;
|= 0&lt;br /&gt;
|&amp;lt;code&amp;gt;00&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|2&lt;br /&gt;
|= 1&lt;br /&gt;
|&amp;lt;code&amp;gt;00_01&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|3&lt;br /&gt;
|= 3&lt;br /&gt;
|&amp;lt;code&amp;gt;00_01_20&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|4&lt;br /&gt;
|= 6&lt;br /&gt;
|&amp;lt;code&amp;gt;00_01_20_03&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|5&lt;br /&gt;
|= 11&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_04&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|6&lt;br /&gt;
|= 17&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_40_15&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|7&lt;br /&gt;
|= 28&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_10_33_61&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|8&lt;br /&gt;
|= 63&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_50_30_24_70&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|9&lt;br /&gt;
|= 63,577&lt;br /&gt;
|&amp;lt;code&amp;gt;00_02_01_40_14_12_00_52_81&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|10&lt;br /&gt;
|= 5,778&lt;br /&gt;
|&amp;lt;code&amp;gt;00_02_01_40_14_12_00_17_63_18&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|11&lt;br /&gt;
|≥ 810,626,821&lt;br /&gt;
|&amp;lt;code&amp;gt;00_00_30_40_12_51_07_20_41_12_19&amp;lt;/code&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Analysis ==&lt;br /&gt;
&lt;br /&gt;
=== peBBle(5) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
.5.....&lt;br /&gt;
.14....&lt;br /&gt;
.311...&lt;br /&gt;
..41...&lt;br /&gt;
.212...&lt;br /&gt;
1.3.1..&lt;br /&gt;
1..31..&lt;br /&gt;
1...4..&lt;br /&gt;
1..211.&lt;br /&gt;
1.1.21.&lt;br /&gt;
1.11.2.&lt;br /&gt;
1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(6) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
...6.....&lt;br /&gt;
..1.5....&lt;br /&gt;
..141....&lt;br /&gt;
..312....&lt;br /&gt;
...5.1...&lt;br /&gt;
..41.1...&lt;br /&gt;
.212.1...&lt;br /&gt;
1.3.11...&lt;br /&gt;
1..311...&lt;br /&gt;
1...41...&lt;br /&gt;
1..212...&lt;br /&gt;
1.1.3.1..&lt;br /&gt;
1.1..31..&lt;br /&gt;
1.1...4..&lt;br /&gt;
1.1..211.&lt;br /&gt;
1.1.1.21.&lt;br /&gt;
1.1.11.2.&lt;br /&gt;
1.1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(7) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
..7.......&lt;br /&gt;
.6.1......&lt;br /&gt;
3.31......&lt;br /&gt;
.3.4......&lt;br /&gt;
..511.....&lt;br /&gt;
.1411.....&lt;br /&gt;
.3121.....&lt;br /&gt;
..5.2.....&lt;br /&gt;
.141.1....&lt;br /&gt;
.312.1....&lt;br /&gt;
..5.11....&lt;br /&gt;
.14.11....&lt;br /&gt;
.31111....&lt;br /&gt;
..4111....&lt;br /&gt;
.21211....&lt;br /&gt;
1.3.21....&lt;br /&gt;
1..4.2....&lt;br /&gt;
1.212.1...&lt;br /&gt;
11.3.11...&lt;br /&gt;
11..311...&lt;br /&gt;
11...41...&lt;br /&gt;
11..212...&lt;br /&gt;
11.1.3.1..&lt;br /&gt;
11.1..31..&lt;br /&gt;
11.1...4..&lt;br /&gt;
11.1..211.&lt;br /&gt;
11.1.1.21.&lt;br /&gt;
11.1.11.2.&lt;br /&gt;
11.1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(8) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
.....8............&lt;br /&gt;
....71............&lt;br /&gt;
...215............&lt;br /&gt;
..1.7.............&lt;br /&gt;
..1214............&lt;br /&gt;
..2.411...........&lt;br /&gt;
.1.3121...........&lt;br /&gt;
.1..5.2...........&lt;br /&gt;
.1.5.1.1..........&lt;br /&gt;
.15..1.1..........&lt;br /&gt;
.6...1.1..........&lt;br /&gt;
33...1.1..........&lt;br /&gt;
.33..1.1..........&lt;br /&gt;
..33.1.1..........&lt;br /&gt;
...331.1..........&lt;br /&gt;
....34.1..........&lt;br /&gt;
....2411..........&lt;br /&gt;
...12221..........&lt;br /&gt;
...21212..........&lt;br /&gt;
..1.3.3.1.........&lt;br /&gt;
..1..3.31.........&lt;br /&gt;
..1...3.4.........&lt;br /&gt;
..1....511........&lt;br /&gt;
..1...5.11........&lt;br /&gt;
..1..5..11........&lt;br /&gt;
..1.5...11........&lt;br /&gt;
..15....11........&lt;br /&gt;
..6.....11........&lt;br /&gt;
.33.....11........&lt;br /&gt;
..33....11........&lt;br /&gt;
...33...11........&lt;br /&gt;
....33..11........&lt;br /&gt;
.....33.11........&lt;br /&gt;
......3311........&lt;br /&gt;
.......341........&lt;br /&gt;
.......242........&lt;br /&gt;
......12311.......&lt;br /&gt;
......2.141.......&lt;br /&gt;
.....1.1312.......&lt;br /&gt;
.....1.1.5.1......&lt;br /&gt;
.....1.15..1......&lt;br /&gt;
.....1.6...1......&lt;br /&gt;
.....133...1......&lt;br /&gt;
.....1.33..1......&lt;br /&gt;
.....1..33.1......&lt;br /&gt;
.....1...331......&lt;br /&gt;
.....1....34......&lt;br /&gt;
.....1....241.....&lt;br /&gt;
.....1...1222.....&lt;br /&gt;
.....1...21211....&lt;br /&gt;
.....1..1.3.21....&lt;br /&gt;
.....1..1..4.2....&lt;br /&gt;
.....1..1.212.1...&lt;br /&gt;
.....1..11.3.11...&lt;br /&gt;
.....1..11..311...&lt;br /&gt;
.....1..11...41...&lt;br /&gt;
.....1..11..212...&lt;br /&gt;
.....1..11.1.3.1..&lt;br /&gt;
.....1..11.1..31..&lt;br /&gt;
.....1..11.1...4..&lt;br /&gt;
.....1..11.1..211.&lt;br /&gt;
.....1..11.1.1.21.&lt;br /&gt;
.....1..11.1.11.2.&lt;br /&gt;
.....1..11.1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(9) ===&lt;br /&gt;
The champion performs a [[Collatz-like]] function.&lt;br /&gt;
&lt;br /&gt;
Analysis:&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;text&amp;quot;&amp;gt;&lt;br /&gt;
A(n) := 6 0^n 3&lt;br /&gt;
B(n) := 6 0^n 21&lt;br /&gt;
&lt;br /&gt;
A(3k+1) -(20k+12)-&amp;gt; B(11k+5)&lt;br /&gt;
A(3k+2) -(8k+7)---&amp;gt; HALT&lt;br /&gt;
A(3k+3) -(20k+26)-&amp;gt; B(11k+12)&lt;br /&gt;
&lt;br /&gt;
B(3k)   -(8k+3)---&amp;gt; HALT&lt;br /&gt;
B(3k+1) -(20k+16)-&amp;gt; A(11k+7)&lt;br /&gt;
B(3k+2) -(20k+22)-&amp;gt; A(11k+11)&lt;br /&gt;
&lt;br /&gt;
9 -(8)-&amp;gt; B(4) -(36)-&amp;gt; A(18) -(126)-&amp;gt; B(67) -(456)-&amp;gt; A(249) -(1666)-&amp;gt; B(914) -(6102)-&amp;gt; A(3355) -(22372)-&amp;gt; B(12303) -(32811)-&amp;gt; HALT&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
&lt;br /&gt;
=== The Golems ===&lt;br /&gt;
There are 22 remaining peBBle(11) holdouts which can be reduced to 10 equivalency classes and 7 distinct paths and are potential [[Cryptids]]:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1566012271719616573]&amp;lt;/sup&amp;gt;&amp;lt;pre&amp;gt;#1: 00_00_03_01_14_60_12_51_--_81_35 | path 1&lt;br /&gt;
#5: 00_00_03_01_14_60_13_51_80_--_16 | path 1&lt;br /&gt;
#9: 00_00_03_01_14_60_13_51_--_81_15 | path 1&lt;br /&gt;
#f: 00_00_03_01_14_60_13_71_17_--_18 | path 2&lt;br /&gt;
#g: 00_00_03_01_14_60_13_71_52_--_28 | path 3&lt;br /&gt;
#h: 00_00_03_01_14_60_13_71_71_--_28 | path 3&lt;br /&gt;
#i: 00_00_03_01_20_60_13_70_--_71_44 | path 4&lt;br /&gt;
#k: 00_00_03_01_20_60_13_71_80_--_54 | path 5&lt;br /&gt;
#l: 00_00_03_01_20_60_13_71_81_--_54 | path 6&lt;br /&gt;
#m: 00_00_03_31_11_60_21_16_54_--_19 | path 7 - oddball&amp;lt;/pre&amp;gt;These are the golems. These have intricate rules, but the common case is somewhat well behaved (sort of like a two phase version of [[BMO1]]).&lt;br /&gt;
&lt;br /&gt;
==== Oddball Golem ====&lt;br /&gt;
&amp;lt;code&amp;gt;00_00_03_31_11_60_21_16_54_--_19&amp;lt;/code&amp;gt;, the &amp;quot;oddball&amp;quot; golem follows the rules:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565822239880908803]&amp;lt;/sup&amp;gt;&amp;lt;pre&amp;gt;&lt;br /&gt;
  #### State A(a, b, c, d) := 7 .ᵃ⁻¹1 .ᵇ⁻¹1 .ᶜ⁻¹1 .ᵈ⁻¹1&lt;br /&gt;
       (Invariants: a ≡ 2 (mod 3),  b ≥ 0,  c ≥ 1,  d ≥ 1)&lt;br /&gt;
    A(a, 0, 1, 1) ⟶ D(a + 1,  1,  3,  2)&lt;br /&gt;
    A(a, 0, 1, 2) ⟶ Inf&lt;br /&gt;
    A(a, 0, 1, d) ⟶ C(a + 1,  3,  2,  d - 3)         if d ≥ 3&lt;br /&gt;
    A(a, 0, 2, d) ⟶ Inf&lt;br /&gt;
    A(a, 0, c, d) ⟶ B(a + 3,  2,  c - 3,  d)         if c ≥ 3&lt;br /&gt;
    A(a, b, c, d) ⟶ A(a + 3,  b - 1,  c,  d)         if b ≥ 1&lt;br /&gt;
&lt;br /&gt;
  #### State B(a, b, c, d) := 1 .ᵃ⁻¹7 .ᵇ⁻¹1 .ᶜ⁻¹1 .ᵈ⁻¹1&lt;br /&gt;
       (Invariants: a ≥ 0,  b ≡ 2 (mod 3),  c ≥ 0,  d ≥ 1,  a + c ≥ 1)&lt;br /&gt;
    B(0, b, c, d) ⟶ B(1,  b,  c,  d)             (here c ≥ 1, or b ≥ 5 if c = 0)&lt;br /&gt;
    B(1, 2, 0, d) ⟶ Inf&lt;br /&gt;
    B(1, b, 0, d) ⟶ C(6b + d - 10,  3,  2,  0)       if b ≥ 5&lt;br /&gt;
    B(1, b, c, d) ⟶ A(2,  b - 2,  c,  d)             if c ≥ 1&lt;br /&gt;
    B(a, b, 0, 1) ⟶ D(a - 2,  b + 1,  3,  2)         if a ≥ 2&lt;br /&gt;
    B(a, b, 0, 2) ⟶ Inf                              if a ≥ 2&lt;br /&gt;
    B(a, b, 0, d) ⟶ C(a - 2,  b + 3,  2,  d - 3)     if a ≥ 2, d ≥ 3&lt;br /&gt;
    B(a, b, c, d) ⟶ B(a - 2,  b + 3,  c - 1,  d)     if a ≥ 2, c ≥ 1&lt;br /&gt;
&lt;br /&gt;
  #### State C(a, b, c, d) := 1 .ᵃ⁻¹1 .ᵇ⁻¹7 .ᶜ⁻¹1 .ᵈ⁻¹1&lt;br /&gt;
       (Invariants: a ≥ 0,  b ≥ 0,  c ≡ 2 (mod 3),  d ≥ 0,  a + b ≥ 1)&lt;br /&gt;
    C(a, 0, c, d) ⟶ C(a - 1,  1,  c,  d)         (here a ≥ 1)&lt;br /&gt;
    C(0, 1, c, d) ⟶ Inf&lt;br /&gt;
    C(a, 1, c, 0) ⟶ Inf                              if a ≥ 1&lt;br /&gt;
    C(a, 1, c, d) ⟶ B(a + 1,  2,  c - 2,  d)         if a ≥ 1, d ≥ 1&lt;br /&gt;
    C(a, 2, c, 0) ⟶ Inf&lt;br /&gt;
    C(0, 2, c, d) ⟶ Inf                              if d ≥ 1&lt;br /&gt;
    C(a, b, c, 0) ⟶ D(a,  b - 2,  c + 3,  2)         if b ≥ 3&lt;br /&gt;
    C(a, b, c, d) ⟶ C(a,  b - 2,  c + 3,  d - 1)     if b ≥ 2, d ≥ 1, (a, b) ≠ (0, 2)&lt;br /&gt;
&lt;br /&gt;
  #### State D(a, b, c, d) := 1 .ᵃ⁻¹1 .ᵇ⁻¹1 .ᶜ⁻¹7 .ᵈ⁻¹1&lt;br /&gt;
       (Invariants: a ≥ 0,  b ≥ 1,  c ≥ 0,  d ≡ 2 (mod 3))&lt;br /&gt;
    D(0, 1, 0, d) ⟶ Halt                                 (the ONLY reachable halting transition!)&lt;br /&gt;
    D(a, b, 0, d) ⟶ D(a,  b - 1,  1,  d)             if (a, b) ≠ (0, 1)&lt;br /&gt;
    D(a, b, 1, d) ⟶ C(a,  b + 1,  2,  d - 2)&lt;br /&gt;
    D(a, b, c, d) ⟶ D(a,  b,  c - 2,  d + 3)         if c ≥ 2&lt;br /&gt;
&lt;br /&gt;
Start: B(2, 2, 33, 5)&lt;br /&gt;
&amp;lt;/pre&amp;gt;Here &amp;lt;code&amp;gt;.&amp;lt;/code&amp;gt; represents 0 and if any variable is 0, that really means the two adjacent piles are combined, so &amp;lt;code&amp;gt;D(0, 1, 2, 3) = 21.7..1&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;B(0, 1, 2, 3) = 81.1..1&amp;lt;/code&amp;gt; etc.&lt;br /&gt;
&lt;br /&gt;
These rules simplify in the &amp;quot;common case&amp;quot;:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1566200809820004413]&amp;lt;/sup&amp;gt;&amp;lt;pre&amp;gt;00_00_03_31_11_60_21_16_54_--_19&lt;br /&gt;
&lt;br /&gt;
Well-behaved zone:&lt;br /&gt;
  B(a, 2, c, d) with d≥3&lt;br /&gt;
  C(a, b, 2, d) with a≥2&lt;br /&gt;
&lt;br /&gt;
if a ≤ 2c - 6:&lt;br /&gt;
  B(2k,   2, c, d)  -&amp;gt;  B(9k+5, 2, c-k-3, d)&lt;br /&gt;
  B(2k+1, 2, c, d)  -&amp;gt;  B(9k+5, 2, c-k-3, d)&lt;br /&gt;
if a ≥ 2c + 4:&lt;br /&gt;
  B(a, 2, c, d)  -&amp;gt;  C(a-2c-2, 3c+5, 2, d-3)  with a-2c-2 ≥ 2&lt;br /&gt;
&lt;br /&gt;
if b ≥ 2d + 3:&lt;br /&gt;
  C(a, b, 2, 2k)    -&amp;gt;  C(a, b-4k-1, 2, 9k+6)&lt;br /&gt;
  C(a, b, 2, 2k+1)  -&amp;gt;  C(a, b-4k-4, 2, 9k+12)&lt;br /&gt;
if b ≤ 2d - 6:&lt;br /&gt;
  C(a, 2k,   2, d)  -&amp;gt;  B(a,   2, 3k, d-k)  with d-k ≥ 3&lt;br /&gt;
  C(a, 2k+1, 2, d)  -&amp;gt;  B(a+1, 2, 3k, d-k)  with d-k ≥ 3&lt;br /&gt;
&lt;br /&gt;
Start: B(2, 2, 33, 5)&amp;lt;/pre&amp;gt;These rule continue to apply and it remains in the well-behaved zone as long as &amp;lt;code&amp;gt;a&amp;lt;/code&amp;gt; is not too close to &amp;lt;code&amp;gt;2c&amp;lt;/code&amp;gt; (in &amp;lt;code&amp;gt;B&amp;lt;/code&amp;gt; configs) or &amp;lt;code&amp;gt;b&amp;lt;/code&amp;gt; too close to &amp;lt;code&amp;gt;2d&amp;lt;/code&amp;gt; (in &amp;lt;code&amp;gt;C&amp;lt;/code&amp;gt; configs). If it leaves the well-behaved zone it has a chance to either halt or become provably infinite or to return to the well-behaved zone later. Empirically, it does not leave the well-behaved zone for 100k steps starting from &amp;lt;code&amp;gt;B(2, 2, 33, 5)&amp;lt;/code&amp;gt;. As it runs further, the variables grow exponentially and so the &amp;quot;chance&amp;quot; of hitting either of these narrow windows becomes more and more unlikely (similar to BMO1). Thus it appears that it [[probviously]] never leave the well-behaved zone again.&lt;br /&gt;
&lt;br /&gt;
=== Hand-made Cryptids ===&lt;br /&gt;
A 12 pebble automaton has been created that is modeled by a [[Piecewise Affine Function]], similar to [[BMO1]]:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
00_00_00_40_10_00_00_08_41_11_00_a1&lt;br /&gt;
&lt;br /&gt;
Let A(u,v) := 1 0^(u-2) a 0^(v-1) 1&lt;br /&gt;
&lt;br /&gt;
A(u,v) -&amp;gt; A(4u-1, v-u) if u&amp;lt;v&lt;br /&gt;
A(u,v) -&amp;gt; A(u-v, 4v+1) if u&amp;gt;v+1&lt;br /&gt;
A(u,v) -&amp;gt; halt         if u=v or u=v+1&lt;br /&gt;
&lt;br /&gt;
start: A(3,1)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
An 86 pebble automaton has been produced by hand to display [[Hydra]]-like behavior:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1 --&amp;gt; 0 | 1 | 0&lt;br /&gt;
2 --&amp;gt; 0 | 0 | 2&lt;br /&gt;
3 --&amp;gt; 0 | 0 | 3&lt;br /&gt;
5 --&amp;gt; 0 | 0 | 5&lt;br /&gt;
6 --&amp;gt; 0 | 6 | 0&lt;br /&gt;
7 --&amp;gt; 0 | 1 | 6&lt;br /&gt;
8 --&amp;gt; 0 | 2 | 6&lt;br /&gt;
9 --&amp;gt; 9 | 0 | 0&lt;br /&gt;
12 --&amp;gt; 12 | 0 | 0&lt;br /&gt;
14 --&amp;gt; 0 | 14 | 0&lt;br /&gt;
15 --&amp;gt; 6 | 9 | 0&lt;br /&gt;
17 --&amp;gt; 17 | 0 | 0&lt;br /&gt;
24 --&amp;gt; 0 | 24 | 0&lt;br /&gt;
25 --&amp;gt; 0 | 2 | 23&lt;br /&gt;
26 --&amp;gt; 0 | 1 | 25&lt;br /&gt;
27 --&amp;gt; 24 | 3 | 0&lt;br /&gt;
28 --&amp;gt; 26 | 2 | 0&lt;br /&gt;
29 --&amp;gt; 27 | 2 | 0&lt;br /&gt;
30 --&amp;gt; 27 | 3 | 0&lt;br /&gt;
32 --&amp;gt; 0 | 32 | 0&lt;br /&gt;
33 --&amp;gt; 0 | 33 | 0&lt;br /&gt;
35 --&amp;gt; 0 | 2 | 33&lt;br /&gt;
38 --&amp;gt; 0 | 3 | 35&lt;br /&gt;
39 --&amp;gt; 0 | 0 | 39&lt;br /&gt;
40 --&amp;gt; 0 | 0 | 40&lt;br /&gt;
41 --&amp;gt; 1 | 40 | 0&lt;br /&gt;
45 --&amp;gt; 0 | 39 | 6&lt;br /&gt;
78 --&amp;gt; 0 | 0 | 78&lt;br /&gt;
79 --&amp;gt; 0 | 79 | 0&lt;br /&gt;
84 --&amp;gt; 24 | 15 | 45&lt;br /&gt;
86 --&amp;gt; 1 | 1 | 84&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
It may be interpreted in the following way:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let C(x, y) = $ 1 0^y 1 0^x 84 $&lt;br /&gt;
C(2k, y) --&amp;gt; C(7k + 3, y + 2)&lt;br /&gt;
C(2k + 1, y + 1) --&amp;gt; C(7k + 10, y)&lt;br /&gt;
C(2k + 1, 0) --&amp;gt; HALT&lt;br /&gt;
&lt;br /&gt;
$$ --&amp;gt; C(0, 0) --&amp;gt; C(3, 2) --&amp;gt; C(17, 1) --&amp;gt; C(66, 0) --&amp;gt; C(234, 2)...&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Sources ==&lt;br /&gt;
&lt;br /&gt;
* Discord thread: https://discord.com/channels/960643023006490684/1535695107448381591&lt;br /&gt;
&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== External resources ==&lt;br /&gt;
&lt;br /&gt;
* [https://gist.github.com/AlephSquirrel/9ada4b14b675d18fe8755b200b20509d Uiua simulator]&lt;br /&gt;
* [https://github.com/AzertyWasTaken/Busy-Beaver/tree/main/Pebble%20Automaton Enumerator GitHub repo]&lt;br /&gt;
* [https://azertywastaken.github.io/Busy-Beaver/Website/pebble-automaton.html Simulator website]&lt;br /&gt;
&lt;br /&gt;
[[Category:Functions]]&lt;br /&gt;
[[Category:Stubs]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Pebble_Automaton&amp;diff=10641</id>
		<title>Pebble Automaton</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Pebble_Automaton&amp;diff=10641"/>
		<updated>2026-11-13T04:53:55Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Cryptids */ Add Golems and Oddball Golem analysis&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Stub}}&lt;br /&gt;
A pebble automaton is a type of [[cellular automaton]] introduced by AlephSquirrel, based on a Codeforces problem, also called Pebble Automaton.&amp;lt;ref&amp;gt;https://codeforces.com/gym/106465/problem/B&amp;lt;/ref&amp;gt; Each cell contains a non-negative number of pebbles, and the number of pebbles in the cell determines how many pebbles to push to each neighbor. Though in the original problem, the behavior of a cell also depended on the cell&#039;s location, the cellular automaton removes this dependence. Investigation so far has primarily focused on 1-dimensional pebble automata, but multi-dimensional pebble automata could be considered.&lt;br /&gt;
&lt;br /&gt;
Pebble automata have been informally shown to be [[Turing-complete]] via a reduction to 2-register [[Register machine|Register machines]].&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1535695107448381591/1567607590970458274&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Definition ==&lt;br /&gt;
A 1D pebble automaton is defined by three integer functions L(n), S(n) and R(n), defined over non-negative integers n, under the constraints:&lt;br /&gt;
&lt;br /&gt;
* L(n) ≥ 0&lt;br /&gt;
* S(n) ≥ 0&lt;br /&gt;
* R(n) ≥ 0&lt;br /&gt;
* L(n) + S(n) + R(n) = n for all n&lt;br /&gt;
&lt;br /&gt;
A simulation of a pebble automaton is represented by p(x, t), the number of pebbles at position x and time t. The initial configuration (t=0) has all n pebbles at x=0 and each generation, the pebbles are moved around according to the L, S, R rules:&lt;br /&gt;
&lt;br /&gt;
* p(0, 0) = n&lt;br /&gt;
* p(x, 0) = 0 for x ≠ 0&lt;br /&gt;
* p(x, t+1) = R(p(x-1, t)) + S(p(x,t)) + L(p(x+1, t))&lt;br /&gt;
&lt;br /&gt;
Informally, when a cell has n pebbles, it pushes L(n) to its left neighbor, R(n) to its right neighbor and S(n) stay.&lt;br /&gt;
&lt;br /&gt;
Because the number of pebbles is preserved in each row, the maximum number of pebbles in one location is n. Therefore, a pebble automaton only needs to specify the function values up to n.&lt;br /&gt;
&lt;br /&gt;
== Busy Beaver function ==&lt;br /&gt;
We say a pebble automaton has stabilized if no pebbles are moving; for any k in the configuration, L(k) = R(k) = 0.&lt;br /&gt;
&lt;br /&gt;
Let us define peBBle(n) as the maximum number of steps it takes for any pebble automaton to stabilize, starting from an initial state of n pebbles in a single cell.&lt;br /&gt;
&lt;br /&gt;
Notation (long version): &amp;lt;code&amp;gt;&amp;lt;nowiki&amp;gt;n --&amp;gt; L(n) | S(n) | R(n)&amp;lt;/nowiki&amp;gt;&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;0 --&amp;gt; 0 | 0 | 0&amp;lt;/code&amp;gt; is omitted since it is forced by the definition.&lt;br /&gt;
&lt;br /&gt;
The short version sets the rules in increasing order, separated by underscores, and removes &amp;lt;code&amp;gt;S(n)&amp;lt;/code&amp;gt; since it can be obtained with the equation &amp;lt;code&amp;gt;S(N) = n - L(n) - R(n)&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If there are over 10 pebbles, lowercase letters are used for numbers greater than 9 (a=10, b=11, etc.)&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!peBBle(n)&lt;br /&gt;
!Champion&lt;br /&gt;
|-&lt;br /&gt;
|1&lt;br /&gt;
|= 0&lt;br /&gt;
|&amp;lt;code&amp;gt;00&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|2&lt;br /&gt;
|= 1&lt;br /&gt;
|&amp;lt;code&amp;gt;00_01&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|3&lt;br /&gt;
|= 3&lt;br /&gt;
|&amp;lt;code&amp;gt;00_01_20&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|4&lt;br /&gt;
|= 6&lt;br /&gt;
|&amp;lt;code&amp;gt;00_01_20_03&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|5&lt;br /&gt;
|= 11&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_04&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|6&lt;br /&gt;
|= 17&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_40_15&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|7&lt;br /&gt;
|= 28&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_10_33_61&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|8&lt;br /&gt;
|= 63&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_50_30_24_70&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|9&lt;br /&gt;
|= 63,577&lt;br /&gt;
|&amp;lt;code&amp;gt;00_02_01_40_14_12_00_52_81&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|10&lt;br /&gt;
|= 5,778&lt;br /&gt;
|&amp;lt;code&amp;gt;00_02_01_40_14_12_00_17_63_18&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|11&lt;br /&gt;
|≥ 810,626,821&lt;br /&gt;
|&amp;lt;code&amp;gt;00_00_30_40_12_51_07_20_41_12_19&amp;lt;/code&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Analysis ==&lt;br /&gt;
&lt;br /&gt;
=== peBBle(5) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
.5.....&lt;br /&gt;
.14....&lt;br /&gt;
.311...&lt;br /&gt;
..41...&lt;br /&gt;
.212...&lt;br /&gt;
1.3.1..&lt;br /&gt;
1..31..&lt;br /&gt;
1...4..&lt;br /&gt;
1..211.&lt;br /&gt;
1.1.21.&lt;br /&gt;
1.11.2.&lt;br /&gt;
1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(6) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
...6.....&lt;br /&gt;
..1.5....&lt;br /&gt;
..141....&lt;br /&gt;
..312....&lt;br /&gt;
...5.1...&lt;br /&gt;
..41.1...&lt;br /&gt;
.212.1...&lt;br /&gt;
1.3.11...&lt;br /&gt;
1..311...&lt;br /&gt;
1...41...&lt;br /&gt;
1..212...&lt;br /&gt;
1.1.3.1..&lt;br /&gt;
1.1..31..&lt;br /&gt;
1.1...4..&lt;br /&gt;
1.1..211.&lt;br /&gt;
1.1.1.21.&lt;br /&gt;
1.1.11.2.&lt;br /&gt;
1.1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(7) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
..7.......&lt;br /&gt;
.6.1......&lt;br /&gt;
3.31......&lt;br /&gt;
.3.4......&lt;br /&gt;
..511.....&lt;br /&gt;
.1411.....&lt;br /&gt;
.3121.....&lt;br /&gt;
..5.2.....&lt;br /&gt;
.141.1....&lt;br /&gt;
.312.1....&lt;br /&gt;
..5.11....&lt;br /&gt;
.14.11....&lt;br /&gt;
.31111....&lt;br /&gt;
..4111....&lt;br /&gt;
.21211....&lt;br /&gt;
1.3.21....&lt;br /&gt;
1..4.2....&lt;br /&gt;
1.212.1...&lt;br /&gt;
11.3.11...&lt;br /&gt;
11..311...&lt;br /&gt;
11...41...&lt;br /&gt;
11..212...&lt;br /&gt;
11.1.3.1..&lt;br /&gt;
11.1..31..&lt;br /&gt;
11.1...4..&lt;br /&gt;
11.1..211.&lt;br /&gt;
11.1.1.21.&lt;br /&gt;
11.1.11.2.&lt;br /&gt;
11.1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(8) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
.....8............&lt;br /&gt;
....71............&lt;br /&gt;
...215............&lt;br /&gt;
..1.7.............&lt;br /&gt;
..1214............&lt;br /&gt;
..2.411...........&lt;br /&gt;
.1.3121...........&lt;br /&gt;
.1..5.2...........&lt;br /&gt;
.1.5.1.1..........&lt;br /&gt;
.15..1.1..........&lt;br /&gt;
.6...1.1..........&lt;br /&gt;
33...1.1..........&lt;br /&gt;
.33..1.1..........&lt;br /&gt;
..33.1.1..........&lt;br /&gt;
...331.1..........&lt;br /&gt;
....34.1..........&lt;br /&gt;
....2411..........&lt;br /&gt;
...12221..........&lt;br /&gt;
...21212..........&lt;br /&gt;
..1.3.3.1.........&lt;br /&gt;
..1..3.31.........&lt;br /&gt;
..1...3.4.........&lt;br /&gt;
..1....511........&lt;br /&gt;
..1...5.11........&lt;br /&gt;
..1..5..11........&lt;br /&gt;
..1.5...11........&lt;br /&gt;
..15....11........&lt;br /&gt;
..6.....11........&lt;br /&gt;
.33.....11........&lt;br /&gt;
..33....11........&lt;br /&gt;
...33...11........&lt;br /&gt;
....33..11........&lt;br /&gt;
.....33.11........&lt;br /&gt;
......3311........&lt;br /&gt;
.......341........&lt;br /&gt;
.......242........&lt;br /&gt;
......12311.......&lt;br /&gt;
......2.141.......&lt;br /&gt;
.....1.1312.......&lt;br /&gt;
.....1.1.5.1......&lt;br /&gt;
.....1.15..1......&lt;br /&gt;
.....1.6...1......&lt;br /&gt;
.....133...1......&lt;br /&gt;
.....1.33..1......&lt;br /&gt;
.....1..33.1......&lt;br /&gt;
.....1...331......&lt;br /&gt;
.....1....34......&lt;br /&gt;
.....1....241.....&lt;br /&gt;
.....1...1222.....&lt;br /&gt;
.....1...21211....&lt;br /&gt;
.....1..1.3.21....&lt;br /&gt;
.....1..1..4.2....&lt;br /&gt;
.....1..1.212.1...&lt;br /&gt;
.....1..11.3.11...&lt;br /&gt;
.....1..11..311...&lt;br /&gt;
.....1..11...41...&lt;br /&gt;
.....1..11..212...&lt;br /&gt;
.....1..11.1.3.1..&lt;br /&gt;
.....1..11.1..31..&lt;br /&gt;
.....1..11.1...4..&lt;br /&gt;
.....1..11.1..211.&lt;br /&gt;
.....1..11.1.1.21.&lt;br /&gt;
.....1..11.1.11.2.&lt;br /&gt;
.....1..11.1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(9) ===&lt;br /&gt;
The champion performs a [[Collatz-like]] function.&lt;br /&gt;
&lt;br /&gt;
Analysis:&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;text&amp;quot;&amp;gt;&lt;br /&gt;
A(n) := 6 0^n 3&lt;br /&gt;
B(n) := 6 0^n 21&lt;br /&gt;
&lt;br /&gt;
A(3k+1) -(20k+12)-&amp;gt; B(11k+5)&lt;br /&gt;
A(3k+2) -(8k+7)---&amp;gt; HALT&lt;br /&gt;
A(3k+3) -(20k+26)-&amp;gt; B(11k+12)&lt;br /&gt;
&lt;br /&gt;
B(3k)   -(8k+3)---&amp;gt; HALT&lt;br /&gt;
B(3k+1) -(20k+16)-&amp;gt; A(11k+7)&lt;br /&gt;
B(3k+2) -(20k+22)-&amp;gt; A(11k+11)&lt;br /&gt;
&lt;br /&gt;
9 -(8)-&amp;gt; B(4) -(36)-&amp;gt; A(18) -(126)-&amp;gt; B(67) -(456)-&amp;gt; A(249) -(1666)-&amp;gt; B(914) -(6102)-&amp;gt; A(3355) -(22372)-&amp;gt; B(12303) -(32811)-&amp;gt; HALT&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
&lt;br /&gt;
=== The Golems ===&lt;br /&gt;
There are 22 remaining peBBle(11) holdouts which can be reduced to 10 equivalency classes and 7 distinct paths:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1566012271719616573]&amp;lt;/sup&amp;gt;&amp;lt;pre&amp;gt;#1: 00_00_03_01_14_60_12_51_--_81_35 | path 1&lt;br /&gt;
#5: 00_00_03_01_14_60_13_51_80_--_16 | path 1&lt;br /&gt;
#9: 00_00_03_01_14_60_13_51_--_81_15 | path 1&lt;br /&gt;
#f: 00_00_03_01_14_60_13_71_17_--_18 | path 2&lt;br /&gt;
#g: 00_00_03_01_14_60_13_71_52_--_28 | path 3&lt;br /&gt;
#h: 00_00_03_01_14_60_13_71_71_--_28 | path 3&lt;br /&gt;
#i: 00_00_03_01_20_60_13_70_--_71_44 | path 4&lt;br /&gt;
#k: 00_00_03_01_20_60_13_71_80_--_54 | path 5&lt;br /&gt;
#l: 00_00_03_01_20_60_13_71_81_--_54 | path 6&lt;br /&gt;
#m: 00_00_03_31_11_60_21_16_54_--_19 | path 7 - oddball&amp;lt;/pre&amp;gt;These are the golems. These have intricate rules, but the common case is somewhat well behaved (sort of like a two phase version of [[BMO1]]).&lt;br /&gt;
&lt;br /&gt;
==== Oddball Golem ====&lt;br /&gt;
&amp;lt;code&amp;gt;00_00_03_31_11_60_21_16_54_--_19&amp;lt;/code&amp;gt;, the &amp;quot;oddball&amp;quot; golem follows the rules:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565822239880908803]&amp;lt;/sup&amp;gt;&amp;lt;pre&amp;gt;&lt;br /&gt;
  #### State A(a, b, c, d) := 7 .ᵃ⁻¹1 .ᵇ⁻¹1 .ᶜ⁻¹1 .ᵈ⁻¹1&lt;br /&gt;
       (Invariants: a ≡ 2 (mod 3),  b ≥ 0,  c ≥ 1,  d ≥ 1)&lt;br /&gt;
    A(a, 0, 1, 1) ⟶ D(a + 1,  1,  3,  2)&lt;br /&gt;
    A(a, 0, 1, 2) ⟶ Inf&lt;br /&gt;
    A(a, 0, 1, d) ⟶ C(a + 1,  3,  2,  d - 3)         if d ≥ 3&lt;br /&gt;
    A(a, 0, 2, d) ⟶ Inf&lt;br /&gt;
    A(a, 0, c, d) ⟶ B(a + 3,  2,  c - 3,  d)         if c ≥ 3&lt;br /&gt;
    A(a, b, c, d) ⟶ A(a + 3,  b - 1,  c,  d)         if b ≥ 1&lt;br /&gt;
&lt;br /&gt;
  #### State B(a, b, c, d) := 1 .ᵃ⁻¹7 .ᵇ⁻¹1 .ᶜ⁻¹1 .ᵈ⁻¹1&lt;br /&gt;
       (Invariants: a ≥ 0,  b ≡ 2 (mod 3),  c ≥ 0,  d ≥ 1,  a + c ≥ 1)&lt;br /&gt;
    B(0, b, c, d) ⟶ B(1,  b,  c,  d)             (here c ≥ 1, or b ≥ 5 if c = 0)&lt;br /&gt;
    B(1, 2, 0, d) ⟶ Inf&lt;br /&gt;
    B(1, b, 0, d) ⟶ C(6b + d - 10,  3,  2,  0)       if b ≥ 5&lt;br /&gt;
    B(1, b, c, d) ⟶ A(2,  b - 2,  c,  d)             if c ≥ 1&lt;br /&gt;
    B(a, b, 0, 1) ⟶ D(a - 2,  b + 1,  3,  2)         if a ≥ 2&lt;br /&gt;
    B(a, b, 0, 2) ⟶ Inf                              if a ≥ 2&lt;br /&gt;
    B(a, b, 0, d) ⟶ C(a - 2,  b + 3,  2,  d - 3)     if a ≥ 2, d ≥ 3&lt;br /&gt;
    B(a, b, c, d) ⟶ B(a - 2,  b + 3,  c - 1,  d)     if a ≥ 2, c ≥ 1&lt;br /&gt;
&lt;br /&gt;
  #### State C(a, b, c, d) := 1 .ᵃ⁻¹1 .ᵇ⁻¹7 .ᶜ⁻¹1 .ᵈ⁻¹1&lt;br /&gt;
       (Invariants: a ≥ 0,  b ≥ 0,  c ≡ 2 (mod 3),  d ≥ 0,  a + b ≥ 1)&lt;br /&gt;
    C(a, 0, c, d) ⟶ C(a - 1,  1,  c,  d)         (here a ≥ 1)&lt;br /&gt;
    C(0, 1, c, d) ⟶ Inf&lt;br /&gt;
    C(a, 1, c, 0) ⟶ Inf                              if a ≥ 1&lt;br /&gt;
    C(a, 1, c, d) ⟶ B(a + 1,  2,  c - 2,  d)         if a ≥ 1, d ≥ 1&lt;br /&gt;
    C(a, 2, c, 0) ⟶ Inf&lt;br /&gt;
    C(0, 2, c, d) ⟶ Inf                              if d ≥ 1&lt;br /&gt;
    C(a, b, c, 0) ⟶ D(a,  b - 2,  c + 3,  2)         if b ≥ 3&lt;br /&gt;
    C(a, b, c, d) ⟶ C(a,  b - 2,  c + 3,  d - 1)     if b ≥ 2, d ≥ 1, (a, b) ≠ (0, 2)&lt;br /&gt;
&lt;br /&gt;
  #### State D(a, b, c, d) := 1 .ᵃ⁻¹1 .ᵇ⁻¹1 .ᶜ⁻¹7 .ᵈ⁻¹1&lt;br /&gt;
       (Invariants: a ≥ 0,  b ≥ 1,  c ≥ 0,  d ≡ 2 (mod 3))&lt;br /&gt;
    D(0, 1, 0, d) ⟶ Halt                                 (the ONLY reachable halting transition!)&lt;br /&gt;
    D(a, b, 0, d) ⟶ D(a,  b - 1,  1,  d)             if (a, b) ≠ (0, 1)&lt;br /&gt;
    D(a, b, 1, d) ⟶ C(a,  b + 1,  2,  d - 2)&lt;br /&gt;
    D(a, b, c, d) ⟶ D(a,  b,  c - 2,  d + 3)         if c ≥ 2&lt;br /&gt;
&lt;br /&gt;
Start: B(2, 2, 33, 5)&lt;br /&gt;
&amp;lt;/pre&amp;gt;Here &amp;lt;code&amp;gt;.&amp;lt;/code&amp;gt; represents 0 and if any variable is 0, that really means the two adjacent piles are combined, so &amp;lt;code&amp;gt;D(0, 1, 2, 3) = 21.7..1&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;B(0, 1, 2, 3) = 81.1..1&amp;lt;/code&amp;gt; etc.&lt;br /&gt;
&lt;br /&gt;
These rules simplify in the &amp;quot;common case&amp;quot;:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1566200809820004413]&amp;lt;/sup&amp;gt;&amp;lt;pre&amp;gt;00_00_03_31_11_60_21_16_54_--_19&lt;br /&gt;
&lt;br /&gt;
Well-behaved zone:&lt;br /&gt;
  B(a, 2, c, d) with d≥3&lt;br /&gt;
  C(a, b, 2, d) with a≥2&lt;br /&gt;
&lt;br /&gt;
if a ≤ 2c - 6:&lt;br /&gt;
  B(2k,   2, c, d)  -&amp;gt;  B(9k+5, 2, c-k-3, d)&lt;br /&gt;
  B(2k+1, 2, c, d)  -&amp;gt;  B(9k+5, 2, c-k-3, d)&lt;br /&gt;
if a ≥ 2c + 4:&lt;br /&gt;
  B(a, 2, c, d)  -&amp;gt;  C(a-2c-2, 3c+5, 2, d-3)  with a-2c-2 ≥ 2&lt;br /&gt;
&lt;br /&gt;
if b ≥ 2d + 3:&lt;br /&gt;
  C(a, b, 2, 2k)    -&amp;gt;  C(a, b-4k-1, 2, 9k+6)&lt;br /&gt;
  C(a, b, 2, 2k+1)  -&amp;gt;  C(a, b-4k-4, 2, 9k+12)&lt;br /&gt;
if b ≤ 2d - 6:&lt;br /&gt;
  C(a, 2k,   2, d)  -&amp;gt;  B(a,   2, 3k, d-k)  with d-k ≥ 3&lt;br /&gt;
  C(a, 2k+1, 2, d)  -&amp;gt;  B(a+1, 2, 3k, d-k)  with d-k ≥ 3&lt;br /&gt;
&lt;br /&gt;
Start: B(2, 2, 33, 5)&amp;lt;/pre&amp;gt;These rule continue to apply and it remains in the well-behaved zone as long as &amp;lt;code&amp;gt;a&amp;lt;/code&amp;gt; is not too close to &amp;lt;code&amp;gt;2c&amp;lt;/code&amp;gt; (in &amp;lt;code&amp;gt;B&amp;lt;/code&amp;gt; configs) or &amp;lt;code&amp;gt;b&amp;lt;/code&amp;gt; too close to &amp;lt;code&amp;gt;2d&amp;lt;/code&amp;gt; (in &amp;lt;code&amp;gt;C&amp;lt;/code&amp;gt; configs). If it leaves the well-behaved zone it has a chance to either halt or become provably infinite or to return to the well-behaved zone later. Empirically, it does not leave the well-behaved zone for 100k steps starting from &amp;lt;code&amp;gt;B(2, 2, 33, 5)&amp;lt;/code&amp;gt;. As it runs further, the variables grow exponentially and so the &amp;quot;chance&amp;quot; of hitting either of these narrow windows becomes more and more unlikely (similar to BMO1). Thus it appears that it [[probviously]] never leave the well-behaved zone again.&lt;br /&gt;
&lt;br /&gt;
=== Hand-made Cryptids ===&lt;br /&gt;
A 12 pebble automaton has been created that is modeled by a [[Piecewise Affine Function]], similar to [[BMO1]]:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
00_00_00_40_10_00_00_08_41_11_00_a1&lt;br /&gt;
&lt;br /&gt;
Let A(u,v) := 1 0^(u-2) a 0^(v-1) 1&lt;br /&gt;
&lt;br /&gt;
A(u,v) -&amp;gt; A(4u-1, v-u) if u&amp;lt;v&lt;br /&gt;
A(u,v) -&amp;gt; A(u-v, 4v+1) if u&amp;gt;v+1&lt;br /&gt;
A(u,v) -&amp;gt; halt         if u=v or u=v+1&lt;br /&gt;
&lt;br /&gt;
start: A(3,1)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
An 86 pebble automaton has been produced by hand to display [[Hydra]]-like behavior:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1 --&amp;gt; 0 | 1 | 0&lt;br /&gt;
2 --&amp;gt; 0 | 0 | 2&lt;br /&gt;
3 --&amp;gt; 0 | 0 | 3&lt;br /&gt;
5 --&amp;gt; 0 | 0 | 5&lt;br /&gt;
6 --&amp;gt; 0 | 6 | 0&lt;br /&gt;
7 --&amp;gt; 0 | 1 | 6&lt;br /&gt;
8 --&amp;gt; 0 | 2 | 6&lt;br /&gt;
9 --&amp;gt; 9 | 0 | 0&lt;br /&gt;
12 --&amp;gt; 12 | 0 | 0&lt;br /&gt;
14 --&amp;gt; 0 | 14 | 0&lt;br /&gt;
15 --&amp;gt; 6 | 9 | 0&lt;br /&gt;
17 --&amp;gt; 17 | 0 | 0&lt;br /&gt;
24 --&amp;gt; 0 | 24 | 0&lt;br /&gt;
25 --&amp;gt; 0 | 2 | 23&lt;br /&gt;
26 --&amp;gt; 0 | 1 | 25&lt;br /&gt;
27 --&amp;gt; 24 | 3 | 0&lt;br /&gt;
28 --&amp;gt; 26 | 2 | 0&lt;br /&gt;
29 --&amp;gt; 27 | 2 | 0&lt;br /&gt;
30 --&amp;gt; 27 | 3 | 0&lt;br /&gt;
32 --&amp;gt; 0 | 32 | 0&lt;br /&gt;
33 --&amp;gt; 0 | 33 | 0&lt;br /&gt;
35 --&amp;gt; 0 | 2 | 33&lt;br /&gt;
38 --&amp;gt; 0 | 3 | 35&lt;br /&gt;
39 --&amp;gt; 0 | 0 | 39&lt;br /&gt;
40 --&amp;gt; 0 | 0 | 40&lt;br /&gt;
41 --&amp;gt; 1 | 40 | 0&lt;br /&gt;
45 --&amp;gt; 0 | 39 | 6&lt;br /&gt;
78 --&amp;gt; 0 | 0 | 78&lt;br /&gt;
79 --&amp;gt; 0 | 79 | 0&lt;br /&gt;
84 --&amp;gt; 24 | 15 | 45&lt;br /&gt;
86 --&amp;gt; 1 | 1 | 84&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
It may be interpreted in the following way:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let C(x, y) = $ 1 0^y 1 0^x 84 $&lt;br /&gt;
C(2k, y) --&amp;gt; C(7k + 3, y + 2)&lt;br /&gt;
C(2k + 1, y + 1) --&amp;gt; C(7k + 10, y)&lt;br /&gt;
C(2k + 1, 0) --&amp;gt; HALT&lt;br /&gt;
&lt;br /&gt;
$$ --&amp;gt; C(0, 0) --&amp;gt; C(3, 2) --&amp;gt; C(17, 1) --&amp;gt; C(66, 0) --&amp;gt; C(234, 2)...&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other notable machines ==&lt;br /&gt;
=== Golems ===&lt;br /&gt;
The &amp;quot;golems&amp;quot; are a group of 22 holdouts in peBBle(11). They appear to be modeled by complex systems of equations, making them potential Cryptids. Discord user Sheep noted that they can be categorized into 7 unique &amp;quot;paths&amp;quot;&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1535695107448381591/1566012271719616573&amp;lt;/ref&amp;gt;, though the details may differ on how they behave if they encounter an improbable position.&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1535695107448381591/1566013254764073081&amp;lt;/ref&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ Golems text&lt;br /&gt;
|-&lt;br /&gt;
! Golem no. !! Machine !! Note&lt;br /&gt;
|-&lt;br /&gt;
| #1 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_71_17_--_18&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #2 || &amp;lt;code&amp;gt;00_00_30_10_41_06_31_15_08_--_19&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #3 || &amp;lt;code&amp;gt;00_00_03_31_11_60_21_16_54_--_19&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #4 || &amp;lt;code&amp;gt;00_00_30_10_02_06_31_17_08_--_45&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #5 || &amp;lt;code&amp;gt;00_00_30_10_02_06_31_17_18_--_45&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #6 || &amp;lt;code&amp;gt;00_00_30_10_41_06_31_15_08_--_14&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #7 || &amp;lt;code&amp;gt;00_00_30_10_02_06_31_07_--_17_1a&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #8 || &amp;lt;code&amp;gt;00_00_30_10_41_06_21_15_--_18_1a&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #9 || &amp;lt;code&amp;gt;00_00_30_10_41_06_31_15_--_18_1a&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #10 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_80_--_19&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #11 || &amp;lt;code&amp;gt;00_00_03_01_20_60_13_70_--_71_44&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #12 || &amp;lt;code&amp;gt;00_00_03_01_14_60_12_51_--_81_44&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #13 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_--_81_44&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #14 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_--_81_15&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #15 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_80_--_16&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #16 || &amp;lt;code&amp;gt;00_00_03_01_14_60_12_51_--_81_35&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #17 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_--_81_35&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #18 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_--_81_22&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #19 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_--_81_24&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #20 || &amp;lt;code&amp;gt;00_00_30_10_41_06_31_15_08_--_11&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #21 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_71_52_--_28&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #22 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_71_71_--_28&amp;lt;/code&amp;gt; || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Sources ==&lt;br /&gt;
&lt;br /&gt;
* Discord thread: https://discord.com/channels/960643023006490684/1535695107448381591&lt;br /&gt;
&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== External resources ==&lt;br /&gt;
&lt;br /&gt;
* [https://gist.github.com/AlephSquirrel/9ada4b14b675d18fe8755b200b20509d Uiua simulator]&lt;br /&gt;
* [https://github.com/AzertyWasTaken/Busy-Beaver/tree/main/Pebble%20Automaton Enumerator GitHub repo]&lt;br /&gt;
* [https://azertywastaken.github.io/Busy-Beaver/Website/pebble-automaton.html Simulator website]&lt;br /&gt;
&lt;br /&gt;
[[Category:Functions]]&lt;br /&gt;
[[Category:Stubs]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=TMBR:_October_2026&amp;diff=10638</id>
		<title>TMBR: October 2026</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=TMBR:_October_2026&amp;diff=10638"/>
		<updated>2026-11-13T04:33:48Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* BB Adjacent */ Note only 7 Golem paths&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{TMBRnav|September 2026|November 2026}}&#039;&#039;This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[[:Category:This Month in Beaver Research|This Month in Beaver Research]] for October 2026. This was the month AI opened the floodgates on the Busy Beaver problem. Last month, existing experienced researchers like mxdys and prurq harnessed AI to solve many BB(6) and BB(2,5) holdouts, respectively. This month, several newcomers to the community used AI to solve multiple BB(6) holdouts, discover new champions in BB(7)-BB(14) and beyond, and create new cryptids connected to major open problems and/or the consistency of various axiomatic systems. &lt;br /&gt;
&lt;br /&gt;
Assisted by AI, BB(6) saw a massive drop to 608 holdouts and a respectable two of the last 39 BB(2,5) holdouts were solved. Conventional approaches to holdout reduction in other domains was also very successful this month, with a near 20% drop in BB(7) holdouts (over 3M machines solved), the completion of the nearly-year-long initial BB(2,7) enumeration, and the passing of 400,000 holdouts in BB(2,6), the first 100k barrier surpassed in six months.&lt;br /&gt;
&lt;br /&gt;
== Papers ==&lt;br /&gt;
&lt;br /&gt;
* Marco Dos Santos and researchers at [https://deepmind.google/ Google DeepMind] published a paper on the usage of AI to derive simple arithmetic rules for small Turing machine holdouts: [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]&lt;br /&gt;
&lt;br /&gt;
== Blog Posts / In the Media ==&lt;br /&gt;
&lt;br /&gt;
* [https://nickdrozd.github.io/2026/10/20/blanking-beavers-results-and-open-problems.html Blanking Beavers: Results and Open Problems]. Nick Drozd. 20 Oct 2026.&lt;br /&gt;
* [https://www.youtube.com/watch?v=kMHCl2PGloQ The Discord Server that Solved an Open Math Problem]. polylog. 25 Oct 2026.&lt;br /&gt;
&lt;br /&gt;
== BB Adjacent ==&lt;br /&gt;
&lt;br /&gt;
* [[Register machine|Register Machine]]&lt;br /&gt;
** On October 1, sheep discovered a 12-state, 2-register [[Cryptid]] which halts iff 7 converges to 1 under the Collatz-like 5n+1 map, thus showing that MBB(12, 2) is hard.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555083694937604097]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, @-d enumerated MBB(8), which left 7,891 holdouts after reduction, or 404 holdouts if an ai-created decider is used.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555102010473193513]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, @mineralli discovered a family of champions for MBB(n,1).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555268332465422508]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 2, @mineralli discovered a new champion for MBB(10,2).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555502006372663337]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, sheep discovered 2 new tetrational champions for MBB(10).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555512334846402573][https://discord.com/channels/960643023006490684/1552294888740098139/1555546324567335048]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki released an MBB(8) holdout list consisting of 145 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555699448066342953]&amp;lt;/sup&amp;gt; using another ai-created decider similar to CTL.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555699290285019147]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 3, Shawn Ligocki released another MBB(8) holdout list consisting of 46 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555754019606106212]&amp;lt;/sup&amp;gt; later reduced to 6&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555772428997886004]&amp;lt;/sup&amp;gt; holdouts.&lt;br /&gt;
** On the same day, Shawn Ligocki discovered a cryptid similar to [[Space Needle]] amongst the 6 remaining holdouts, showing MBB(8) is hard.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555767330531967099]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, sheep showed that all 6 holdouts were equivalent to two Space Needle-like cryptids: [[Register machine#MBB(8): Achilles and Patroclus|Achilles and Patroclus]],&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555897664078618675]&amp;lt;/sup&amp;gt; meaning MBB(8) &amp;quot;probviously&amp;quot; = 3,394.&lt;br /&gt;
** On the same day, Katelyn Doucette devised a method to show that a sizeable portion of powers of two could not be reached by Achilles&#039;s path.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1556086800861233154]&amp;lt;/sup&amp;gt; She later concluded that this backwards reasoning-like method, though powerful, would not be enough to decide Achilles.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1556810508160606243]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 7, sheep rediscovered a 2003 [https://web.archive.org/web/20061216201733/http://www2.cantabgold.net/users/m.y.becker.98/part2projects/rickdissertation.zip dissertation] by Rick Griffiths&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1557447684896464909]&amp;lt;/sup&amp;gt; which investigated the (maximum register value) Busy Beaver function for register machines (Beaver(n)); Griffiths determines the values of Beaver(n) for sizes 1 to 4 (using the modern instruction counting convention), and provides lower bounds for sizes 5 to 8. It also provides a machine (constructed by Ortwin Gasper in 2003) which shows the bound MBB(11) &amp;gt; 10↑↑17.74.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1557623496044183603]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 8, sheep marginally improved the bounds for MBB(10).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1557714856960983131]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 10, AlephSquirrel rediscovered a 2020 [https://www.sciencedirect.com/science/article/pii/S0304397519304633 article] by Yuri Matiyasevich&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1560363138946175047]&amp;lt;/sup&amp;gt; which provides a 130-instruction, 29-register machine which halts if and only if the Riemann hypothesis is false.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1557447684896464909]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 17, mineralli published a script capable of converting any arbitrary register machine into an equivalent 2-register machine.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1560932610723676202]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 22, mineralli released a list of 581 MBB(11,2) holdouts (though they are not confident that these are all of the MBB(11,2) holdouts) that display [[Collatz-like]] behavior.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1562879542643925073]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[SKI Calculus]]&lt;br /&gt;
** On October 8, cppdecksucker shared a holdouts list for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(8) consisting of 17 terms, 2 of which have been decided to not have a normal form.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1557759102187348009]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 12, cppdecksucker claimed to have used Aristotle AI to prove Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(8) = 80.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1559185635947057216]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Δ⁵ proved Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(5) = 47.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=prev&amp;amp;oldid=9048]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 13, Δ⁵ translated a 15 combinator term in the BCKW calculus, demonstrating Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(15) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{2 \uparrow\uparrow 18 - 1}}(2)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=9048]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 20, elgan65536 discovered new champions for Ξ₀(9)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1562237449848225846]&amp;lt;/sup&amp;gt; and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(11),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1562238534092464191]&amp;lt;/sup&amp;gt;, with trivial extensions that are new champions for Ξ₀(10), Ξ₀(11), and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(12).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1562251625597509764]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 21, elgan65536 discovered a new champion for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(10).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1562511629743165501]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Lambda Calculus]]&lt;br /&gt;
** On October 9, Discord user Sam discovered a new 80 bit term,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1557997291401642085]&amp;lt;/sup&amp;gt; shown by 50_ft_lock to demonstrate the bound BBλ(80) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^\omega + 1}(3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1558011994781778044]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 13, Sam optimized the BBλ(80) champion to a reduced and improved 79 bit term, demonstrating the bound BBλ(79) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^\omega + 1}(7)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1559448255803293757]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Gustavo Melo estimated that a specific family of terms, mentioned earlier by Sam,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1559075925449244794]&amp;lt;/sup&amp;gt; reaches &amp;lt;math&amp;gt;f_{\omega^\omega \cdot 2 + 1}&amp;lt;/math&amp;gt; growth.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1559648655135215627]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Sam discovered new &amp;lt;math&amp;gt;f_{\omega^\omega \cdot 2 + 1}&amp;lt;/math&amp;gt;-level champions for BBλ(70), BBλ(74), BBλ(78), and BBλ(80).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1559714680547844188]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 15, Gustavo Melo discovered new &amp;lt;math&amp;gt;f_{\omega^{\omega^\omega}}&amp;lt;/math&amp;gt;-level champions for BBλ(77),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560413331515379733]&amp;lt;/sup&amp;gt; BBλ(80),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560403657529360445]&amp;lt;/sup&amp;gt; and BBλ(85) (the next day),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560447706382602263]&amp;lt;/sup&amp;gt; and conjectured that a specific 76 bit term would have a normal form greater than &amp;lt;math&amp;gt;f_{\omega^{\omega^3}}(2)&amp;lt;/math&amp;gt; bits.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560406048337043459]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 16, Δ⁵ discovered a new 80 bit term, demonstrating the bound BBλ(80) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{\omega^{14}}}(2)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;amp;diff=prev&amp;amp;oldid=9125][https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;amp;diff=next&amp;amp;oldid=9167]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Gustavo Melo proved the conjecture about the 76 bit term&#039;s size, demonstrating the bound BBλ(76) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{\omega^3}}(2)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560695606035357816]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 17, Δ⁵ discovered a new 77 bit term, demonstrating the bound BBλ(77) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{\omega \cdot 2}}(3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;amp;diff=next&amp;amp;oldid=9199]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 18, Δ⁵ discovered a new 82 bit term, demonstrating the bound BBλ(82) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{\omega^\omega}}(2 \uparrow\uparrow\uparrow\uparrow 18)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;amp;diff=next&amp;amp;oldid=9214]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Beeping Busy Beaver]]&lt;br /&gt;
** On October 10, Crorem proved two bounds regarding different defintions of the Beeping Booping Busy Beaver function (BBBB(m,n)), which emulates a Turing machine equipped with a second-order oracle: BBBB&amp;lt;sub&amp;gt;first&amp;lt;/sub&amp;gt;(2,3) = 177, and BBBB&amp;lt;sub&amp;gt;last&amp;lt;/sub&amp;gt;(2,3) ≥ 265. Notably, Crorem reduced the BBBB&amp;lt;sub&amp;gt;last&amp;lt;/sub&amp;gt;(2,3) domain to 5 holdouts, one of which Crorem believes to be a Collatz-like Cryptid.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1558372326251438151]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 26, carrino claimed to have used Claude to determine the instruction-based champions for 1 to 4 states and 2 symbols, and for 2 states and 3 symbols.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1564393769984458862]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Instruction-Limited Busy Beaver|Domain-Restricted Instruction-Limited Busy Beaver]]&lt;br /&gt;
** On October 10, star claimed to have used Claude to discover a new champion for BBi(10, 6, 2) (colloquially known as BB(5.5)).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558608094949416993]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 11, star claimed to have used Claude to reduce BBi(10, 6, 2) to 4 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558654629821157499]&amp;lt;/sup&amp;gt; all of which were present in the most recent holdouts equivalence list at the time (BB6_holdouts_1581_eqv_740.txt).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558671475999772775]&amp;lt;/sup&amp;gt; She believes that two of these holdouts ({{TM|1RB1LA_1RC0RF_1RD---_0LE1RB_---0LA_1LD1RF}} and another equivalent machine) are Cryptids.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558766480424964169]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Fractran]]&lt;br /&gt;
** On October 13, @-d completed the verification of the ai-generated 1dpc decider and its certificates, reducing the official count of BBf(23) holdouts from 21,233 to 8,021, and the official count of BBf(24) holdouts from 231,432 to 85,726.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1559523323493482566]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, @-d discovered 0.1% of certificates created by the ai-generated ndpc decider to be invalid, hypothesized to have been caused by a soundness bug in the decider.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1559708872019681341]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 24, @-d discovered the size 24 energy vampire &amp;lt;code&amp;gt;[2/15, 1/6, 441/2, 11/3, 25/7, 6/11]&amp;lt;/code&amp;gt;, a Collatz-like machine that simulates an unbiased random walk. What separates this holdout from other random walks is its sheer luck; over several extremely far simulations (one to 2&amp;lt;sup&amp;gt;34&amp;lt;/sup&amp;gt; iterations,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1563511627742191627]&amp;lt;/sup&amp;gt; one to 2&amp;lt;sup&amp;gt;35&amp;lt;/sup&amp;gt; iterations,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1563991018401960128]&amp;lt;/sup&amp;gt; and one to 1.5 × 2&amp;lt;sup&amp;gt;38&amp;lt;/sup&amp;gt; iterations&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1565260814368251955]&amp;lt;/sup&amp;gt;), the machine has remained active; if this machine were to halt, it would show BBf(24) &amp;gt; 6.38 × 10&amp;lt;sup&amp;gt;175,634,090,326&amp;lt;/sup&amp;gt;.&lt;br /&gt;
** On October 26, Shawn Ligocki added BMO12 (&amp;lt;code&amp;gt;[2/15, 1/6, 441/2, 11/3, 25/7, 6/11]&amp;lt;/code&amp;gt;) to the [[Beaver Math Olympiad]].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1226543091264126976/1564372797709361262]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 30, @-d claimed the halting of BMO12 in 1.714 × 10&amp;lt;sup&amp;gt;210,914,744,116&amp;lt;/sup&amp;gt; steps (i.e. 495,141,375,730 iterations), awaiting verification.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1565647448452636672]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Pebble Automaton]]&lt;br /&gt;
** On October 13, AlephSquirrel proved peBBle(5) = 11 and peBBle(6) = 17.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1559703384943104163]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 18, AlephSquirrel proved peBBle(7) = 28.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561404687260065896]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 19, Shawn Ligocki claimed to have used Google Gemini to prove peBBle(8) = 63 using a CTL-like method,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561538647470379019]&amp;lt;/sup&amp;gt; and to find 54,394 9-pebble holdouts (including automata with multiple undefined transitions),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561539854834335764]&amp;lt;/sup&amp;gt; later reduced to 376 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561553087938953228]&amp;lt;/sup&amp;gt; then 104 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561571328253890590]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 19, a poll was held to determine whether a pebble automata that moves pebbles every step, but has no effect on any cells (i.e. it has a static tape), should be considered as halted (which is what the old halting definition decides); the general consensus is to class this behavior as non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561785819872886919]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to prove peBBle(9) = 63,577, under the old halting definition.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561852114299523185]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 20, Shawn Ligocki claimed to have used Google Gemini to find a peBBle(10) champion that runs for 5,778 steps, simultaneously finding 1,867 10-pebble holdouts (including automata with multiple undefined transitions),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561905431960485888]&amp;lt;/sup&amp;gt; later reduced to 1,221 holdouts, though these lists were considered only under the old halting definition.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561978057764376669]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, AlephSquirrel discovered that one of the peBBle(10) holdouts used a mechanism that simulates a [[Piecewise Affine Function]],&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562101152986828830]&amp;lt;/sup&amp;gt; though none of the extraneous conditions lead to halting;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562121777054879916]&amp;lt;/sup&amp;gt; she also provided a compressed spacetime diagram of this holdout.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562208455383580773]&amp;lt;/sup&amp;gt; A similar holdout was shared earlier that day by Shawn Ligocki, but not analyzed.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561915644536946739]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to produce peBBle(10) holdout lists with 429 holdouts&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562194616546238526]&amp;lt;/sup&amp;gt; and 319 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562230142577676439]&amp;lt;/sup&amp;gt; both updated to account for the new halting definition.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562160772551802953]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 21, AlephSquirrel analyzed the aforementioned peBBle(10) former holdout (excluding edge cases), confirming that it models a PAF.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562457437666017301]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to produce a peBBle(10) holdout list with 268 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562461150245814384]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Aleph Squirrel discovered a 12 pebble possible Cryptid, implying solving peBBle(12) would be at least as hard as solving a BMO1-like problem.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562498516729991280]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to prove peBBle(10) = 5,778.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562579016895176798]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 28, Shawn Ligocki began enumeration of peBBle(11), finding a machine that demonstrates peBBle(11) ≥ 9,040,389.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565052555728257195]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, Shawn Ligocki completed enumeration of peBBle(11) using an enumerator and deciders written by Google Gemini, claiming to find 359,706 11-pebble holdouts (including automata with multiple undefined transitions).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565456164785881191]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki found two new champions for peBBle(11).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565462948103847957]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 30, Shawn Ligocki found a peBBle(11) champion that runs for 810,626,821 steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565541995852865558]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to produce peBBle(11) holdout lists with 160,367 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565580890082643968]&amp;lt;/sup&amp;gt; 960 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565594328217165984]&amp;lt;/sup&amp;gt; 580 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565754647644344401]&amp;lt;/sup&amp;gt; and 229 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565846253072285786]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 31, Shawn Ligocki claimed to have used Google Gemini to produce peBBle(11) holdout lists with 133 holdouts&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565890967935127663]&amp;lt;/sup&amp;gt; and 22 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565911083087167654]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, sheep reduced this claimed holdout list to 10 holdouts&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1566004742080045099]&amp;lt;/sup&amp;gt; and 7 unique paths.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1566012271719616573]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [https://discord.com/channels/960643023006490684/1476612651109843024 Busy Bricklayer Problem]&lt;br /&gt;
** On October 20, mathmasterzach, along with their friends, showed that the problem&#039;s associated busy beaver function, over the 10-ominos, either takes the value 138, or is larger than 3,000.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1561917906051407909]&amp;lt;/sup&amp;gt; Note that there is still one undecided 10-omino.&lt;br /&gt;
** On October 21, mathmasterzach, using the singular 10-omino holdout, produced a tiling of an 88-cell wide half-strip.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1562458368763891855]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 24, Drakou111 set up a distributed computation project that aims to determine which rectangles the 10-omino holdout can be shown to (not) tile. The project increased the minimum tiles required to 3,200.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1563594621030768731]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 25, the bound for the smallest number of the holdout 10-omino tiles (now named fe70&amp;lt;sup&amp;gt;[https://fe70.org/]&amp;lt;/sup&amp;gt;) required to tile a rectangle had increased to 3,264.&amp;lt;sup&amp;gt;[https://fe70.org/api/results]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 26, mathmasterzach completed an ennumeration of larger domains, finding lower bounds on the largest smallest rectangle a polyomino can tile for 11-ominos, 12-ominos, and 13-ominos, finding order 270, order 180, and order 2 tiles for each domain respectively, and finding 3, 16, and 0 holdout tiles for each domain respectively.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1564111342346960958]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, mathmasterzach announced that the minimum width of a hypothetical rectangle that the 10-omino holdout can tile had been shown to be at least 165, and that half-strip tilings were known to be constructible for widths of the form 168 + 8n.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1565474623254954015]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Instruction-Limited Busy Beaver]]&lt;br /&gt;
** On October 24, nickdrozd claimed to have used ChatGPT to claim two of the final nine informal BBi(8) holdouts halting.&lt;br /&gt;
** On the same day, prurq confirmed one of nickdrozd&#039;s claims,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1563639486670311576]&amp;lt;/sup&amp;gt; and claimed to use Aristotle to confirm the other of nickdrozd&#039;s claims.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1563647923013558374]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, hipparcos confirmed the other of nickdrozd&#039;s claims.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565202912903438408]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Semi Infinite Tape Turing Machine]]&lt;br /&gt;
** On October 25, [[User:Loader3229]] created an alternative model for Turing machines on a semi infinite tape, where a Turing machine that attempts to move leftwards off the tape remains stationary, giving rise to the function BB&amp;lt;sub&amp;gt;SI&amp;lt;/sub&amp;gt;(m,n), which they provided small champions for.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Semi_Infinite_Tape_Turing_Machine&amp;amp;oldid=9562]&amp;lt;/sup&amp;gt; Notably, one state machines do not act as trivially in this model, and that BB&amp;lt;sub&amp;gt;SI&amp;lt;/sub&amp;gt;(1,n) is at least quadratic in growth.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1450894930422530161/1563965787998392406]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Champions ==&lt;br /&gt;
{| class=&amp;quot;wikitable mw-collapsible mw-collapsed&amp;quot;&lt;br /&gt;
|+New&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;champions&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;discovered&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;this&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;month&lt;br /&gt;
|-&lt;br /&gt;
!Domain&lt;br /&gt;
!Champion&lt;br /&gt;
!Discoverer&lt;br /&gt;
!New lower bound&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Previous lower bound&lt;br /&gt;
|-&lt;br /&gt;
|BB(7)&lt;br /&gt;
|{{TM|1RB0RG_1RC1RB_0RD1RZ_0LE0LD_0LF1LE_1RA1LF_1LC0RB|halt}}&lt;br /&gt;
| rowspan=&amp;quot;8&amp;quot; |Jeff Ketchersid&lt;br /&gt;
|&amp;lt;math&amp;gt;3 \uparrow^{20} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Pavel&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;Kropitz&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;2 \uparrow^{11} 2 \uparrow^{11} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(8)&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LH0LC_1RG1LD_0RG0RF_1RG---|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^3(12)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(9)&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LH0LC_1RG1LD_0RG0RF_0LI---_1LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^6(12)&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}(f_{9}(2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(10)&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LI0LC_0RG1LD_1RH1LG_1LC0RG_0LJ0LI_1RZ0LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(2 \uparrow^{36} 3) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|racheline&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^2(25)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(11)&lt;br /&gt;
|{{TM|1RG0LH_1RK1RC_0LD1LA_0RE1LD_0LI1RF_1RZ0RG_1RB1RG_1LA1LH_0LK0LJ_1LH1LI_1LJ1RE|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(f_\omega^2(5))&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^2(10 \uparrow^4 4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(12)&lt;br /&gt;
|{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RG0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_1RZ0LL_0LH1LK|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}(f_{\omega + 1}^2(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|racheline&lt;br /&gt;
|&amp;lt;math&amp;gt;f_\omega^4(2 \uparrow\uparrow\uparrow 4-3) &amp;gt; f_\omega^4(f_4(2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(13)&lt;br /&gt;
|{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RM0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_0LL0LL_0LH1LK_1RZ0LH|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}^6(f_{\omega + 1}(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|50_ft_lock&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(2046) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(14)&lt;br /&gt;
|{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RM0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_0LN0LL_0LH1LK_1RZ0LH_0RJ0LI|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}^9(f_{\omega + 1}(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(f_\omega^4(f_7(3)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(29)&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |[https://discord.com/channels/960643023006490684/1331570843829932063/1564527050512142427 too long, see source]&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |mxdys&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega^\omega}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |racheline&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |&amp;lt;math&amp;gt;f_{\omega^2}^2(4 \uparrow\uparrow 341)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(31)&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega \uparrow\uparrow 4}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(33)&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega \uparrow\uparrow 6}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,4)&lt;br /&gt;
|{{TM|0LB3LB1RZ2RA_1LD3RB1LC2RA_3RB1LB3LC2RC_0RD2RC2LB0RA|halt}}&lt;br /&gt;
|[[User:Loader3229]]&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{509} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,4)&lt;br /&gt;
|{{TM|1LF2RA3RB---_3RD2LB3RB1LC_2RA1LB3RC2LC_1LD2RE0LA1LD_1RZ0LE1LF---_2RA---2LF2LF|halt}}&lt;br /&gt;
|Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(10 \uparrow\uparrow 65533) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^2(10 \uparrow\uparrow\uparrow6)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,4)&lt;br /&gt;
|{{TM|1RC3LB2RD2RA_1RF3RB1LC2RA_3RB1LB3LC2RC_0RF2LD1LD2LE_3RE3LB2RE2LE_0LG0LH1RZ3RB_1LG2RD1LG3RG_0LH0LC0LH3RD|halt}}&lt;br /&gt;
| rowspan=&amp;quot;7&amp;quot; |[[User:Loader3229]]&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}(f_\omega^4(12))&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;f_{\omega + 1}(f_{\omega}(f_7(2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(9,4)&lt;br /&gt;
|{{TM|2LI3LB2RD2RA_2LC3RB1LC2RA_3RB1LB3LC2RC_0RF2LD1LD2LE_3RE3LB2RE2LE_0LG0LH1RZ---_1LG2RD1LG3RG_0LH---0LH3RD_2LB---1LI3RF|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}(16)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,5)&lt;br /&gt;
|{{TM|1RB3LB4LC2RA4LB_2LC3RB1LC2RA4RD_3RB1LB3LC2RC4LC_2RC2RD1RZ4RB1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(27,041) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|racheline&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}(2 \uparrow^{15} 5)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(5,5)&lt;br /&gt;
|{{TM|1LB3LB4LC2RA4LB_3LE3RB1LC2RA4RD_3RB1LB3LC2RC4LC_1RZ------4LD4LE_3RB------4LE3LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(f_{\omega}^4(6))&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,5)&lt;br /&gt;
|{{TM|0LB3LB4LC2RA4LB_1LF3RB1LC2RA4RD_3RB1LB3LC2RC4LC_1RZ------4LD4LE_3RB------4LE3LC_4RF3RE---0RA3LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}(11)&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |Jacobzheng&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;f_{\omega}^2(10 \uparrow\uparrow\uparrow6)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,5)&lt;br /&gt;
|{{TM|2LE3LB4LC2RA4LB_4RA3RB1LC2RA4RD_3RB1LB3LC2RC4LC_---3LF1LG4LD4LE_3RB---1LE4LE3LC_4LC------3LF3LF_3LF------1LG1LG|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}^2(10)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,5)&lt;br /&gt;
|{{TM|0LB3LB1RZ2RA4RB_0LD1RB1LD2RA1LE_3RB1LB3LC2RC3LF_3RE2LF3LC2RC4LF_0LF3RE0LG4LH2LB_0LE3LG4LC2RF4LG_1LC3RG1LH2RF2RA_3RG1LG3LH2RH4LH|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega \cdot 2}(32)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(f_{\omega}(f_7(2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(2,7)&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA_2LA6RA4RB1RZ3LB6LA4RB|halt}}&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |roromachine14&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 4&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |Pavel Kropitz&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |&amp;lt;math&amp;gt;10 \uparrow\uparrow 10 \uparrow\uparrow 10^{10^{115}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(2,8)&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA1RZ_2LA6RA4RB7RA3LB6LA4RB4RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(2,9)&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA8RA1RZ_2LA6RA4RB7RA3LB6LA4RB4RA4RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 6&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
* Jeff Ketchersid claimed to have used Claude Opus 5.5 and Gemini 4 Argon to discover and prove the scores of a set of Ackermann-level machines, three of which ([[BB(8)]], BB(9), BB(10)) were derived from Pavel Kropitz&#039;s former [[BB(7)]] champion, and three of which (BB(12), BB(13), BB(14)) were derived from Jacobzheng&#039;s former champion for BB(14). Ketchersid also claimed to have found a new, novel champion for BB(7). Ketchersid&#039;s previous claimed bounds are listed here:&lt;br /&gt;
** On October 4, BB(8) &amp;gt; &amp;lt;math&amp;gt;2 \uparrow^{37} 3&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1448375857046360094/1556422395776995408][https://github.com/jeff87654/busy-beaver/commit/d8d00340fc3435684c0baf506f5c1d84b6f7f4a8]&amp;lt;/sup&amp;gt; Prior to this, the BB(7) champion, found by Pavel Kropitz, which held the BB(8) championship by default, ran for around &amp;lt;math&amp;gt;2 \uparrow^{11} 2 \uparrow^{11} 3&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
** On October 7, BB(9) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}(2 \uparrow^{13} 3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1557495370014130300][https://github.com/jeff87654/busy-beaver/commit/0b61aa598ce99ee04eaa88dec7f113d3d60340db]&amp;lt;/sup&amp;gt; Prior to October, the BB(9) champion, found by Jacobzheng, ran for around&amp;lt;math&amp;gt;f_{\omega}(f_{9}(2))&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
** On October 8, BB(10) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(2 \uparrow^{36} 3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1557806386073702622][https://github.com/jeff87654/busy-beaver/commit/772402455254c6afe9ba8fad50e074b14ec7a755]&amp;lt;/sup&amp;gt; Prior to October, the BB(10) champion, found by racheline, ran for around &amp;lt;math&amp;gt;f_{\omega}^2(25)&amp;lt;/math&amp;gt; steps; this machine also dethroned the previous BB(11) champion, which was found by Jaconzheng, and ran around &amp;lt;math&amp;gt;f_{\omega}^2(10 \uparrow^4 4)&amp;lt;/math&amp;gt; steps. for This is also the smallest 2-symbol machine (in states) known to run for longer than a [[Graham&#039;s number]] number number of steps; in other words, this machine shows that BB(10) &amp;gt; g&amp;lt;sub&amp;gt;64&amp;lt;/sub&amp;gt;, improving on 50_ft_lock&#039;s earlier result that BB(13) &amp;gt; g&amp;lt;sub&amp;gt;64&amp;lt;/sub&amp;gt;.&lt;br /&gt;
** On October 11, BB(12) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}^2(2 \uparrow^{36} 3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/ca5f0882319c02b86055a93ecbec1d150244a9c6]&amp;lt;/sup&amp;gt; Prior to October, the BB(12) champion, found by racheline, ran for around &amp;lt;math&amp;gt;f_{\omega}^4(2 \uparrow\uparrow\uparrow 4 - 3)&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
** On October 14, BB(13) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(f_{\omega}(20))&amp;lt;/math&amp;gt; and BB(14) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}^3(15)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1559991272456986684][https://github.com/jeff87654/busy-beaver/commit/502667dd6eb65ca014957b30487af3dc94192411]&amp;lt;/sup&amp;gt; Prior to October, the BB(13) champion, found by 50_ft_lock, ran for around &amp;lt;math&amp;gt;f_{\omega + 1}(2046)&amp;lt;/math&amp;gt; steps, and was previously the 2-symbol machine with the least amount of states used that was known to run longer than g&amp;lt;sub&amp;gt;64&amp;lt;/sub&amp;gt; steps, whereas the BB(14) champion, found by Jacobzheng, ran for around &amp;lt;math&amp;gt;f_{\omega + 1}(f_\omega^4(f_7(3)))&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
** On October 17, BB(9) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}(f_{\omega}(465,009))&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/9ed1e7a0e7437244942ed4545f199774c5c8a117]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 18, BB(9) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}^3(12)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/be5ae9e6b4ea975fe0eebf01b75a114d7bbf3889]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 19, BB(8) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}^3(12)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/be7b08caf8b6bc30a32c0c6274c1ce7f14f5c2d3]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 22, a new bound for BB(9) slightly larger than that for BB(8) at the time.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/52aab0ec4fbf1c93c177255a50eefb9e1e5dcc18]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 22, BB(9) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}^6(12)&amp;lt;/math&amp;gt;, with their new BB(8) champion from October 19 also being announced along with this champion on this day.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1562971399029526539][https://github.com/jeff87654/busy-beaver/commit/3750b1490e0e7b01e6301450e1b1774afb2658c5][https://github.com/jeff87654/busy-beaver/commit/e107e3b1ac28da6dae224181ae71fe1627348bd9]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 23, Jeff Ketchersid claimed to have used Gemini 4 Argon and Claude Opus 5.5 to search through the over fifteen million BB(7) holdouts, resulting in the finding of a &#039;&#039;&#039;new BB(7) champion&#039;&#039;&#039;, {{TM|1RB0RG_1RC1RB_0RD---_0LE0LD_0LF1LE_1RA1LF_1LC0RB|halt}}, which runs for over &amp;lt;math&amp;gt;3 \uparrow^{20} 3&amp;lt;/math&amp;gt; steps, leaving a similarly notated number of ones on the tape.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1563048075184836699][https://github.com/jeff87654/busy-beaver/commit/9d9a1a4fcaa5dbabc19e887e0fd834cb79567081]&amp;lt;/sup&amp;gt; This dethrones the previous champion, {{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF|halt}}, found by Pavel Kropitz in May 2025,&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=BB(7)&amp;amp;oldid=9434#cite_note-10]&amp;lt;/sup&amp;gt; which runs for around &amp;lt;math&amp;gt;2 \uparrow^{11} 2 \uparrow^{11} 3&amp;lt;/math&amp;gt; steps. Both of these champions begin by setting a pattern that repeats dozens of times, which is iterated upon by using an Ackermann-level mechanism to reach similarly impressive heights. Notably, this new champion has a twin machine, {{TM|1RB0RG_1RC1RB_0RD1RZ_0LE0LD_0LF1LE_1RA1LF_0LD0RB|halt}}, which differs in only one transition, and uses the same mechanism to output the same number of ones, but runs for slightly shorter than than the champion.&lt;br /&gt;
** On October 26, BB(12) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(f_{\omega + 1}^2(3))&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564399479707406348]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, BB(11) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(f_\omega^2(5))&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/27d8d20284b2a6c57f7389a7b3d8c587275b8b5a]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 28, BB(13) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}^6(f_{\omega + 1}(3))&amp;lt;/math&amp;gt; and BB(14) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}^9(f_{\omega + 1}(3))&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565084294110515250]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* roromachine14 claimed to have used Gemini 4 Argon to discover a new champion for BB(2,7) on October 22, and new champions for BB(2,8), and BB(2,9) on October 23, running for at least &amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 4&amp;lt;/math&amp;gt; steps, &amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 5&amp;lt;/math&amp;gt; steps, and &amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 6&amp;lt;/math&amp;gt; steps respectively.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1563058883654590494][https://discord.com/channels/960643023006490684/1084047886494470185/1563070360956698804]&amp;lt;/sup&amp;gt; The previous champion for these domains was, by default, Pavel Kropitz&#039;s BB(2,6) champion, which ran for around &amp;lt;math&amp;gt;10 \uparrow\uparrow 10 \uparrow\uparrow 10^{10^{115}}&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
* mxdys claimed to have used AI to discover three near-ε&amp;lt;sub&amp;gt;0&amp;lt;/sub&amp;gt;-level champions, demonstrating BB(29) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^\omega}(3)&amp;lt;/math&amp;gt;, BB(31) &amp;gt; &amp;lt;math&amp;gt;f_{\omega \uparrow\uparrow 4}(3)&amp;lt;/math&amp;gt;, and BB(33) &amp;gt; &amp;lt;math&amp;gt;f_{\omega \uparrow\uparrow 6}(3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1564527050512142427]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[User:Loader3229]] discovered an array of champions based on Kropitz&#039;s current [[BB(3,4)]] champion, demonstrating the following bounds:&lt;br /&gt;
** On October 27, BB(3,n + 4) &amp;gt; &amp;lt;math&amp;gt;f_\omega^{n + 1}(15)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564608571734495313]&amp;lt;/sup&amp;gt; and BB(4,4) &amp;gt; &amp;lt;math&amp;gt;2 \uparrow^{195} 3&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564638159944294442]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 28, BB(4,4) &amp;gt; &amp;lt;math&amp;gt;2 \uparrow^{509} 3&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;,[https://discord.com/channels/960643023006490684/1084047886494470185/1564816765031288876]&amp;lt;/sup&amp;gt; BB(4,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(27,041) &amp;gt; g_{64}&amp;lt;/math&amp;gt;,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564866772941672489]&amp;lt;/sup&amp;gt; and BB(6,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(97) &amp;gt; g_{64}&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565043340984979488]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, BB(8,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(83)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565368627304210483]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 30, BB(8,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(f_\omega^4(12))&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565534357181960424]&amp;lt;/sup&amp;gt; and BB(9,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 3}(16)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565660171684941895]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 31, BB(5,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(f_{\omega}^4(6)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566039528819400716]&amp;lt;/sup&amp;gt;, BB(6,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 3}(11)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566103427316977789]&amp;lt;/sup&amp;gt; (preceeded by &amp;lt;math&amp;gt;f_{\omega + 2}(126)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566047238252400641]&amp;lt;/sup&amp;gt;  and &amp;lt;math&amp;gt;f_{\omega + 2}(176)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566092396062711870]&amp;lt;/sup&amp;gt;), BB(7,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 3}^2(10)&amp;lt;/math&amp;gt;,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566111131926274121]&amp;lt;/sup&amp;gt; and BB(8,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega \cdot 2}(32)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566113702468390923]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* Jacobzheng discovered a 6-state, 4-symbol Turing machine that demonstrates the bound BB(6,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(10 \uparrow\uparrow 65533)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Champions&amp;amp;diff=prev&amp;amp;oldid=9777]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Holdouts ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&#039;&#039;&#039;BB Holdout Reduction by Domain&#039;&#039;&#039;&lt;br /&gt;
!Domain&lt;br /&gt;
!New Holdout Count&lt;br /&gt;
!Previous Holdout Count&lt;br /&gt;
!Holdout Reduction&lt;br /&gt;
!% Reduction&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|608&lt;br /&gt;
|797&lt;br /&gt;
|189&lt;br /&gt;
|23.71%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(7)]]&lt;br /&gt;
|12,663,440*&lt;br /&gt;
|15,743,264&lt;br /&gt;
|3,079,824&lt;br /&gt;
|19.56%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,3)]]&lt;br /&gt;
|4,673,384&lt;br /&gt;
|4,720,332&lt;br /&gt;
|46,948&lt;br /&gt;
|0.99%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,5)]]&lt;br /&gt;
|37&lt;br /&gt;
|39&lt;br /&gt;
|2&lt;br /&gt;
|5.13%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,6)]]&lt;br /&gt;
|389,503&lt;br /&gt;
|412,086&lt;br /&gt;
|22,583&lt;br /&gt;
|4.47%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,7)]]&lt;br /&gt;
|3,125,433,611&lt;br /&gt;
|&#039;&#039;Enumeration incomplete&#039;&#039;&lt;br /&gt;
|&#039;&#039;N/A&#039;&#039;&lt;br /&gt;
|&#039;&#039;N/A&#039;&#039;&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;nowiki&amp;gt;*&amp;lt;/nowiki&amp;gt;list may be incomplete, see Holdouts &amp;gt; BB(7).&lt;br /&gt;
* [[BB(6)]]&lt;br /&gt;
** On October 1, Discord user oscar claimed to have used GPT-6.1 Sol to prove a machine non-halting, [https://github.com/oscar172772/bb6-1RB1RF_1LC0LF_---0LD_0LE1LD_0RF0LB_1RA1RE-nonhalt-proof formalized] in Rocq the next day.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1555183165977403453/1555641766391324813]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 1, dyuan shared a subset of [[BB(6)]] holdouts, consisting of 24 machines which are expected to be easily analyzable by [[Longitudinal Analysis|longitudinal analysis]].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1555244959840337973]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 3, oscar claimed to have used GPT-6.1 Sol to prove a machine halting,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1555992557148831755]&amp;lt;/sup&amp;gt; formalized in Rocq the next day.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1556006145649545247/1556258332048887889]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 6, Discord user Zuck claimed to have used Claude to prove a machine non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1557025952217833632]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 7, mxdys released a holdout list of &#039;&#039;&#039;778&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1557353710101995550]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 10, Discord user Dennis claimed to have used Claude Opus 5.5 to [https://github.com/DennisKoshta/busycoq/blob/59de13796aa9dbccedd52bc5d081e87980dd2f7e/verify/BellEatsCounter_1RB0RF.v prove] a machine non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558558131213041755]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, mxdys released a holdout list of &#039;&#039;&#039;740&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558585686288891986]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 11, Dennis claimed to have used Claude Opus 5.5 to [https://github.com/ccz181078/busycoq/pull/16 prove] another 4 machines non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558644008199262220]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 13, Dennis claimed to have used Claude Opus 5.5 to [https://github.com/ccz181078/busycoq/pull/17 prove] another 3 machines non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1559650670632632360]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Dennis claimed to have used Claude Opus 5.5 to [https://github.com/ccz181078/busycoq/pull/18 prove] a machine halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1559661025270435870/1559661025270435870]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 15, mxdys released a holdout list of &#039;&#039;&#039;698&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560185889290985532]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/ccz181078/busycoq/pull/19 prove] 7 machines halting, and another 20 machines (pull requests [https://github.com/ccz181078/busycoq/pull/20 #1], [https://github.com/ccz181078/busycoq/pull/21 #2], [https://github.com/ccz181078/busycoq/pull/22 #3], [https://github.com/ccz181078/busycoq/pull/23 #4]) non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560409510156435476]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Dennis claimed to have used Claude Opus 5.5 and GPT-6 Astra to prove another 8 machines (pull requests [https://github.com/ccz181078/busycoq/pull/24 #1], [https://github.com/ccz181078/busycoq/pull/25 #2], [https://github.com/ccz181078/busycoq/pull/26 #3], [https://github.com/ccz181078/busycoq/pull/27 #4], [https://github.com/ccz181078/busycoq/pull/28 #5]) non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560430940168265729]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 16, mxdys released a holdout list of &#039;&#039;&#039;663&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560559556164063242]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 21, Re-us simulated a machine to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1562505095365787862]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 24, mxdys released a holdout list of &#039;&#039;&#039;623&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1563505561905926175]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, stratus1221 simulated two machines to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1563597080176500877]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 25, mxdys confirmed another three machines halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1563868945218408490]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, stratus1221 simulated another two machines to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1563927722445508618]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 27, stratus1221 simulated another machine to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1564592221603495937]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, enan456 claimed to have used Claude Fable 5.1&amp;lt;sup&amp;gt;[https://github.com/Enan456/bbchallenge-proofs/commit/72965887b21cfc0310a90c93ec36b09d8b3ee8f6]&amp;lt;/sup&amp;gt; to [https://github.com/Enan456/bbchallenge-proofs reproduce] 4 of Google DeepMind&#039;s potential cryptids forward behavior and to confirm the rules established. None of them have been decided&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1565230636741169234][https://github.com/Enan456/bbchallenge-proofs/blob/main/docs/results/2026-10-22-gdm-cross-verification.md]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 30, Ahmer Reza simulated four holdouts, all Reus Vampires, to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1565557844869382316]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, mxdys released a holdout list of &#039;&#039;&#039;608&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1565584609176195113]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Ahmer Reza simulated another holdout, a Reus Vampire, to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1565656577178992651]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(7)]]&lt;br /&gt;
** On October 23, Jeff Ketchersid claimed to have used Gemini 4 Argon and Claude Opus 5.5 to find a new BB(7) champion; more details are available in the Champions section.&lt;br /&gt;
** Finlay reduced the numbers of holdouts from &#039;&#039;&#039;15,743,264&#039;&#039;&#039; to &#039;&#039;&#039;12,663,440&#039;&#039;&#039;, a 19.56% reduction,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1564656989999472782]&amp;lt;/sup&amp;gt; though a handful of TNF children are reportedly missing from the final files.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1563950872000467005]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(4,3)]]&lt;br /&gt;
** Andrew Ducharme reduced the number of holdouts from &#039;&#039;&#039;4,720,332&#039;&#039;&#039; to &#039;&#039;&#039;4,673,384&#039;&#039;&#039;, a &#039;&#039;&#039;0.99%&#039;&#039;&#039; reduction using Meet-in-the-Middle CTL with tape folding.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564216669256294481]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,5)]]&lt;br /&gt;
** On October 2, prurq claimed to have used Aristotle AI, to prove one of the remaining holdouts halting, reducing the unofficial count to &#039;&#039;&#039;38&#039;&#039;&#039; out of initially 60 Rocq-proven.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1555690509245087827]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 9, prurq simulated a machine to halting using a Rocq-certified program, reducing the official and unofficial counts to respectively &#039;&#039;&#039;59&#039;&#039;&#039; and &#039;&#039;&#039;37&#039;&#039;&#039;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1558226290509742082]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 17, LegionMammal978 simulated {{TM|1RB---3RA2LA2RB_2LB3LA4LB4RA0RA|halt}} to over 10&amp;lt;sup&amp;gt;1,140,000,000&amp;lt;/sup&amp;gt; steps,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1561033327190872226]&amp;lt;/sup&amp;gt; previously claiming the machine to be a doubly-exponential probviously halting &amp;quot;hard-drive vampire&amp;quot;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1559400536690794496][https://discord.com/channels/960643023006490684/1259770421046411285/1559690798490980384]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,6)]]&lt;br /&gt;
** Andrew Ducharme reduced the number of holdouts from &#039;&#039;&#039;412,086&#039;&#039;&#039; to &#039;&#039;&#039;389,503&#039;&#039;&#039;, a &#039;&#039;&#039;5.48%&#039;&#039;&#039; reduction.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1561092563581145182][https://discord.com/channels/960643023006490684/1084047886494470185/1561506925126877265][https://discord.com/channels/960643023006490684/1084047886494470185/1562784657907650581]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,7)]]&lt;br /&gt;
** Terry Ligocki enumerated 20K more subtasks, increasing the number of holdouts to &#039;&#039;&#039;3,125,433,611&#039;&#039;&#039;. All 1 million subtasks have been enumerated! This enumeration took from November 2025 to October 2026 using the resources [Ligocki] had available to work on this enumeration. Now we can start decreasing the number of holdouts!&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
All Turing machines mentioned in this section work with an alphabet of 2 symbols unless explicitly stated. The state bounds given also only consider Turing machines which work with 2 symbols.&lt;br /&gt;
&lt;br /&gt;
* [[Cryptids#Cryptids at the Edge|Cryptids in the Wild]] (+ [[User:RobinCodes/Machines at the Edge|Energy Vampires]])&lt;br /&gt;
** On October 15, Google DeepMind claimed to have used Gemini 3.1 Pro to discover and [https://github.com/google-deepmind/cryptids/commit/ac5eff7b899f1920cea206363fa05a856005e130 prove] simple rules that characterise the behavior of 11 BB(6) holdouts, noting them as potential Cryptids.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560334894704492594]&amp;lt;/sup&amp;gt; Their methods are elaborated on in their [https://arxiv.org/abs/2610.22603 paper], published this month.&lt;br /&gt;
** [https://discord.com/channels/960643023006490684/1561037362581086228 Reus Vampires]&lt;br /&gt;
*** On October 15, Re-us claimed to have used Claude Opus 5.5 to discover 7 probviously halting BB(6) holdouts which rely on an exceedingly rare tape configuration to halt, similar to the mechanism used by {{TM|1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA|halt}}.&amp;lt;sup&amp;gt;[https://github.com/thomasreus-bb/bb6-vampire-family-1RB0LA_0RC0RB_1LD1LA_1LC1RE_1RF0RD_1LC---][https://discord.com/channels/960643023006490684/1239205785913790465/1560688456382939268]&amp;lt;/sup&amp;gt; Re-us has also estimated that, assuming perfect randomness of the machines&#039; bit generation, a median of 780 billion iterations would have to be applied for each machine to halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1562001104701759511][https://github.com/thomasreus-bb/bb6-vampire-family-1RB0LA_0RC0RB_1LD1LA_1LC1RE_1RF0RD_1LC---/commit/a523942bf34d6ad793727d3197d81f45f81f78a0]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 19, Re-us ran path O1 to 1.08 × 10&amp;lt;sup&amp;gt;10&amp;lt;/sup&amp;gt; iterations; the path, and therefore the machines associated with the path, have not yet halted.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1561737008143933491]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On the same day, Andrew Ducharme ran path O2 to 3.5 × 10&amp;lt;sup&amp;gt;9&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1561757313851990100]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On the same day, Re-us ran path O2 to 8 × 10&amp;lt;sup&amp;gt;9&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1561767318495694918]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On the same day, Ersen ran path O2 to 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1561787161726947358]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 21, Andrew Ducharme ran path O3 to 10&amp;lt;sup&amp;gt;10&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1562019033405063229]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 22, Re-us ran path O2 to 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt, confirming Ersen&#039;s previous simulation.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1562732252511731796]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 22, Ersen ran path O1 to 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1562918309697949796]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 23, Andrew Ducharme ran path O4 to 2 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1563298186301542441]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 25, Re-us ran path O2 to 3 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1563930665114800130]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 26, Re-us ran path O2 to 3.6 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1564302884554801224]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 27, Ahmer Raza ran path O3 to 4.4 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1564602113638531233]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 28, Ahmer Raza ran path O3 to 10&amp;lt;sup&amp;gt;12&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1564860941114544150]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 29, Re-us ran path O2 to 5 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1565282039547039851]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 30, Ahmer Raza ran path O1 and O2 to 747,242,483,684 and 731,899,010,932 iterations respectively, at which point they both halt!&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1565539982368706660]&amp;lt;/sup&amp;gt; These paths correspond to groups of machines with halting times of over 10&amp;lt;sup&amp;gt;263,165,730,000&amp;lt;/sup&amp;gt; and 10&amp;lt;sup&amp;gt;257,762,030,000&amp;lt;/sup&amp;gt; steps respectively.&lt;br /&gt;
*** On the same day, Ahmer Raza ran path O3 to 1,961,935,897,288 iterations, at which point it also halts!&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1565654168708841534]&amp;lt;/sup&amp;gt; This path corresponds to a group of machines with halting times of over 10&amp;lt;sup&amp;gt;690,959,520,000&amp;lt;/sup&amp;gt; steps. They also ran path O4 to 7.6 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations, and later 10&amp;lt;sup&amp;gt;12&amp;lt;/sup&amp;gt; iterations&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1565743330376159394]&amp;lt;/sup&amp;gt; without a halt.&lt;br /&gt;
*** On October 31, Ahmer Raza ran path O4 to 1.7 × 10&amp;lt;sup&amp;gt;12&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1566161389993599129]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 18, Ersen claimed to have used Claude to help run an independent (and currently ongoing) run of [[Antihydra]] to 2&amp;lt;sup&amp;gt;38&amp;lt;/sup&amp;gt; rule applications, seemingly verifying apgoucher&#039;s results.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1561480238586658867][https://discord.com/channels/960643023006490684/1026577255754903572/1271528180246773883]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[File:ZFC_Machine_254.png|alt=The transition table of a 254-state, 2-symbol Turing machine. The starting state, in the top left corner, has the rule 1LB0LC, and the halt transition occurs if the 78th state encounters a 1.|thumb|This month, Mira, using GPT-6 Astra, has claimed to have found this 254-state Turing machine that halts if, and only if, ZFC is inconsistent (Jeff Ketchersid has claimed to have proven this property using Claude Opus 5.5). The transition table of Mira&#039;s machine is shown in this image, with state 1 corresponding to the starting state.]]&lt;br /&gt;
* [[Cryptids#Larger Cryptids|Larger Cryptids]]&lt;br /&gt;
** [[Logical independence|Logical Independence]]&lt;br /&gt;
*** [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo-Frankel set theory]]&lt;br /&gt;
**** On October 6, Mira claimed to have used GPT-6 Astra to reduce their previous 256-state TM whose halting status is independent of ZFC, to a 254-state TM.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1557078543278678136]&amp;lt;/sup&amp;gt; They estimate that the Metamath formalization verifying that their previous 238-state TM is independent of Peano Arithmetic is roughly 70% complete, and the formalization verifying that their new 254-state ZFC-independent TM is roughly 40% complete.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1557065280004300913]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 10, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/7ba85376a9349d54e3460b46ed776df6e094c7dc/Cryptids/Zf393.lean formalize] the claims of the independence of Wade&#039;s 393-state TM&#039;s halting status from ZFC.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/7ba85376a9349d54e3460b46ed776df6e094c7dc#diff-b0e5d5e6cf367c2f1ba87f511ad05a12cee37dc578f5974b9e1b70e96bc11f8a]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 13, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/main/Cryptids/Zf380.lean formally] reduce Andrew Wade&#039;s 393-state ZFC-independent TM, to a 380-state TM.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/3f273d55d213d7676eb20ae0454acfa472ff4d5d]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On the same day, Jeff Ketchersid claimed to have used Claude Opus 5.5 to [https://github.com/jeff87654/busy-beaver/tree/main/ZF/verify/335 formally] reduce Andrew Wade&#039;s 393-state TM whose halting status is independent of ZFC, to a 335-state TM.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1559077555158392844]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 14, Jeff Ketchersid claimed to have used Claude Opus 5.5 to [https://github.com/jeff87654/busy-beaver/tree/zf-254/ZF/m254 prove] the independence of Mira&#039;s 254-state TM&#039;s halting status from ZFC.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1559799702776582244]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 18, Vladimir Reshetnikov claimed to have used Claude to reduce Mira&#039;s previous 254-state ZFC-independent TM, to a 246-state TM.&amp;lt;sup&amp;gt;[https://github.com/VladimirReshetnikov/ProveIt/commit/34f6b40a21305d4e1a6a36858aa7e5b9bebc03b9][https://github.com/VladimirReshetnikov/ProveIt/commit/8cdc55ff9281b0aaba49bf74b0b225d57f12b893]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 19, Kinata claimed to have used GPT-6 Astra&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1561712707860828261]&amp;lt;/sup&amp;gt; to [https://github.com/elliotglazer/k230-rocq/tree/main/coq formally] reduce Reshetnikov&#039;s previous 246-state ZFC-independent TM, to 230 states.&amp;lt;sup&amp;gt;[https://github.com/elliotglazer/k230-rocq/commit/088a8f2eb47b0dee9e7761cc49cd411157dd5e28][https://discord.com/channels/960643023006490684/1331570843829932063/1561712452679368824]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 20, Vladimir Reshetnikov claimed to have used Claude to [https://github.com/VladimirReshetnikov/ProveIt/tree/main/Computability/BusyBeaver/Research/ZFC/k225-formal/verification/k215/rocq formally] optimize their previous 246-state, ZFC-independent TM, to 215 states.&amp;lt;sup&amp;gt;[https://github.com/VladimirReshetnikov/ProveIt/commit/a61476422532a5d3b7dec11fc7a92751fe0d60f8]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** [[wikipedia:Peano_axioms|Peano Arithmetic]]&lt;br /&gt;
**** On October 15, Mira claimed to have used GPT-6 Astra to [https://github.com/jeff87654/busy-beaver/tree/main/PA/m238/coq prove] the independence of their 238-state PA-independent TM, building off of Jeff Ketchersid&#039;s proof of their ZFC-independent TM.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1560095900024442920]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 29, Discord user charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/PAK formally] reduce the number of defined instructions required in a PA-independent TM to 469 (470 including the halting transition).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1565325918896005130]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 30, Mira claimed to have found a 8,250,306-state TM that &amp;quot;ω-accepts&amp;quot; iff ZFC is ω-consistent. This condition presumably requires an ω-level oracle to determine.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1565752410956234844]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 31, Mira claimed to have found a 236-state TM that &amp;quot;ω-accepts&amp;quot; iff PA is ω-consistent.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1566168045343215777]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** [[wikipedia:Large_cardinal|Large Cardinal Axioms]]&lt;br /&gt;
**** On October 15, Jeff Ketchersid claimed to have used Claude Opus 5.5 to discover a 296-state TM whose halting status can be [https://github.com/jeff87654/busy-beaver/tree/main/ZF/tg296/coq proven] to be independent of ZFC + &amp;quot;Every set is contained in a Grothedieck universe&amp;quot;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/923f561312adaaad8bd0e6b20a1e17e5f0339d6d]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** Number Theory&lt;br /&gt;
*** [[wikipedia:Goldbach&#039;s_conjecture|Goldbach&#039;s Conjecture]]&lt;br /&gt;
**** On October 9, Google DeepMind claimed to have used Gemini 3.1 Pro to discover and [https://github.com/google-deepmind/cryptids/blob/c458ec7ae90f5603c35d1bd5534eb6fd4ac1bd58/Cryptids/Goldbach24.lean prove] the property of a 24-state TM that halts if and only if Goldbach&#039;s conjecture is false, improving on the previous smallest known machine with this property by one state.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/c458ec7ae90f5603c35d1bd5534eb6fd4ac1bd58]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 13, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/main/Cryptids/Goldbach21.lean formally] reduce the number of states required from 24 to 21.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/176e5f980ddc6e74f963b983e9d4ba7b28bacc26]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 25, Jeff Ketchersid claimed to have used Claude Opus 5.5 to discover and [https://github.com/jeff87654/busy-beaver/tree/main/PA/goldbach/coq prove] the property of a 449-state TM that halts if and only if Peano Arithmetic can prove Goldbach&#039;s conjecture.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1563983209744834570][https://github.com/jeff87654/busy-beaver/tree/main/PA/goldbach]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 31, Charlie used Claude to discover a BB(10,6) machine that halts if and only if Goldbach&#039;s conjecture is false, reducing the number of instructions from 41 to 34.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1566029907169910844]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** [[wikipedia:Riemann_hypothesis|Riemann Hypothesis]]&lt;br /&gt;
**** On October 10, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/7ba85376a9349d54e3460b46ed776df6e094c7dc/Cryptids/Riemann120.lean formalize] the claims of Shunia&#039;s 120-state TM&#039;s halting if and only if the Riemann hypothesis is false.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/7ba85376a9349d54e3460b46ed776df6e094c7dc#diff-c8f1a37032a46e9025c82851438f2d05a1ea34802d5a717c83eeb530a736014f]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 13, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/main/Cryptids/Riemann104.lean formally] reduce the number of states required for a specific TM to encode the truth value of the Riemann hypothesis from 120 to 104.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/468868ef0a7c82a667e8f8013eba19263e972811]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 19, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/main/Cryptids/Riemann95.lean formally] reduce the bound from 104 states to 95 states.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/bf17809905a1b9a514b0427e24290c7e860a649e]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** [https://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/ Weak Collatz Conjecture]&lt;br /&gt;
**** On October 18, charlie claimed to have used Claude to reduce the number of states required for a specific TM to encode the truth value of the Weak Collatz conjecture from 124 to 23.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1561339005432500386]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 20, Mira claimed to have used GPT-6 Astra&amp;lt;sup&amp;gt;[https://twitter.com/_Mira___Mira_/status/2112429878528324078]&amp;lt;/sup&amp;gt; to reduce the number of states required from 23 to 16.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1561995595848360066][https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On the same day, charlie claimed to have used Claude to reduce this bound to 14 states.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1562181014724546651][https://github.com/calr3/tinycryptids/blob/weakcollatz-14/weakcollatz/README.md]&amp;lt;/sup&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+Other problems encoded into Turing machines this month&lt;br /&gt;
!Conjecture&lt;br /&gt;
!Domain&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Discovery date&lt;br /&gt;
!Notes&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.jstor.org/stable/2689842 Erdős ternary conjecture]&lt;br /&gt;
|BB(14)&lt;br /&gt;
|[[User:Cosmo|Tristan Stérin]], GPT‑6&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;Astra&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1562203343114473472]&amp;lt;/sup&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1562205562798604390]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 20&lt;br /&gt;
|Probviously non-halting - halts iff the conjecture is false.&lt;br /&gt;
Reduces the previous known bound of BB(15).&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Fermat&#039;s_Last_Theorem|Fermat&#039;s Last Theorem]]&lt;br /&gt;
|BB(90)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1562937428678017055]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 22&lt;br /&gt;
|Non-halting. (if Wiles&#039;s proof is not assumed: Probviously non-halting - halts iff the theorem is false. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/Fermat Proof.])&lt;br /&gt;
Reduces the previous known bound of BB(400). The previous machine was a Cryptid at the time of construction (1965), whereas this one is not, as the theorem has sice been proven.&amp;lt;sup&amp;gt;[https://www.jstor.org/stable/2118559]&amp;lt;/sup&amp;gt; The proof of this machine&#039;s property, notably, does not rely on the theorem.&lt;br /&gt;
|-&lt;br /&gt;
|Erdős ternary conjecture variant&lt;br /&gt;
|BB(4,4)&lt;br /&gt;
|roromachine14, Gemini&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;4&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;Argon&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1563042146649382983]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 23&lt;br /&gt;
|Probviously non-halting - halts iff there exists an n &amp;gt; 0 such that 2&amp;lt;sup&amp;gt;n&amp;lt;/sup&amp;gt; - 1 does not contain a 1 in its ternary representation.&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Sierpiński_number#Smallest_Sierpi%C5%84ski_number|Smallest Sierpiński number]] &lt;br /&gt;
|BB(60)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1563258441055731712]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 23&lt;br /&gt;
|Unknown - halts iff 78,557 is the smallest Sierpiński number. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/Sierpinski Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Perfect_number#Odd_perfect_numbers|Odd perfect numbers]]&lt;br /&gt;
|BB(67)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1563258441055731712]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 23&lt;br /&gt;
|Probviously non-halting - halts iff an odd perfect number exists. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/OddPerfect Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Collatz_conjecture|Collatz conjecture]]&lt;br /&gt;
|BBB(17)&lt;br /&gt;
|Mira, GPT-6 Astra&amp;lt;sup&amp;gt;[https://twitter.com/_Mira___Mira_/status/2113850733326110966]&amp;lt;/sup&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1563419486055432192]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 24&lt;br /&gt;
|Probviously non-quasihalting - quasihalts iff the conjecture is false. [https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Twin_prime#Twin_prime_conjecture|Twin prime conjecture]]&lt;br /&gt;
|BBB(18)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1563635774178590750]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 25&lt;br /&gt;
|Probviously non-quasihalting - quasihalts iff the conjecture is false. [https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[oeis:A049782|Kurepa&#039;s conjecture]]&lt;br /&gt;
|BB(38)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1564196186192216166]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 26&lt;br /&gt;
|Unknown - halts iff the conjecture is false. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/Kurepa Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Fermat_number#Primality|Last Fermat prime]]&lt;br /&gt;
|BB(25)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1564553504364826627]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 27&lt;br /&gt;
|Probviously non-halting - halts iff 65,537 is not the last Fermat prime. [https://github.com/calr3/tinycryptids/tree/main/fermatprimes Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|Finite Fermat primes&lt;br /&gt;
|BBB(16)&lt;br /&gt;
|charlie, Claude&lt;br /&gt;
|October 27&lt;br /&gt;
|Probviously quasihalting - quasihalts iff there are finitely many Fermat primes. [https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM Proof.]&lt;br /&gt;
Announced along with the other Fermat prime-related machine.&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Abc_conjecture|abc conjecture]]&lt;br /&gt;
|BBBB(235)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1565097340560216205]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 28&lt;br /&gt;
|Probviously [[pseudoquasihalting]] - pseudoquasihalts iff the conjecture is &#039;&#039;true&#039;&#039;. [https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Wall–Sun–Sun_prime#Existence|Wall-Sun-Sun primes]]&lt;br /&gt;
|BB(50)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1565732795328766126]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 30&lt;br /&gt;
|Probviously halting - halts iff a Wall-Sun-Sun prime exists. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/WallSunSun2 Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|Finite Wall-Sun-Sun primes&lt;br /&gt;
|BBB(48)&lt;br /&gt;
|charlie, Claude&lt;br /&gt;
|October 30&lt;br /&gt;
|Probviously non-quasihalting - quasihalts iff there are finitely many Wall-Sun-Sun primes. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/WallSunSunInf Proof.]&lt;br /&gt;
Announced along with the other Wall-Sun-Sun prime-related machine.&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:P_versus_NP_problem|P = NP]]&lt;br /&gt;
|BBB(290)&lt;br /&gt;
|Mira, GPT-6.1 Terra&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1566167540445741147][https://twitter.com/_Mira___Mira_/status/2116578207210361277]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 31&lt;br /&gt;
|Unknown - quasihalts iff P = NP. Unformalized.&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Co-NP|NP = coNP]]&lt;br /&gt;
|BBB(284)&lt;br /&gt;
|Mira, GPT-6.1 Terra&lt;br /&gt;
|October 31&lt;br /&gt;
|Unknown - quasihalts iff NP = coNP. Unformalized.&lt;br /&gt;
Announced along with the P = NP machine.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Misc ==&lt;br /&gt;
&lt;br /&gt;
* On October 17, XnoobSpeakable began archiving messages of users who have consented to the archival project, as well as adding these archived messages to this wiki.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=1RB0LD_0RC0RE_1LC0LA_---1LE_0LF0RE_0RA0LE&amp;amp;diff=prev&amp;amp;oldid=9229]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On October 19, person89 began research for writing a book about the Busy Beaver function,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561880425914179634/1561880425914179634]&amp;lt;/sup&amp;gt; following a poll earlier that month.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1557640579007905853]&amp;lt;/sup&amp;gt; They plan to explain the function&#039;s history, how some values of the function were determined, the mechanisms behind deciders, the behaviors of special machines, and analogs to the function in other models of computation.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561880425914179634/1561880827959447582]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:This Month in Beaver Research|2026-10]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=TMBR:_October_2026&amp;diff=10637</id>
		<title>TMBR: October 2026</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=TMBR:_October_2026&amp;diff=10637"/>
		<updated>2026-11-13T04:25:44Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* BB Adjacent */ Add names Achilles and Patroclus and simplify a few bits of MBB section&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{TMBRnav|September 2026|November 2026}}&#039;&#039;This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[[:Category:This Month in Beaver Research|This Month in Beaver Research]] for October 2026. This was the month AI opened the floodgates on the Busy Beaver problem. Last month, existing experienced researchers like mxdys and prurq harnessed AI to solve many BB(6) and BB(2,5) holdouts, respectively. This month, several newcomers to the community used AI to solve multiple BB(6) holdouts, discover new champions in BB(7)-BB(14) and beyond, and create new cryptids connected to major open problems and/or the consistency of various axiomatic systems. &lt;br /&gt;
&lt;br /&gt;
Assisted by AI, BB(6) saw a massive drop to 608 holdouts and a respectable two of the last 39 BB(2,5) holdouts were solved. Conventional approaches to holdout reduction in other domains was also very successful this month, with a near 20% drop in BB(7) holdouts (over 3M machines solved), the completion of the nearly-year-long initial BB(2,7) enumeration, and the passing of 400,000 holdouts in BB(2,6), the first 100k barrier surpassed in six months.&lt;br /&gt;
&lt;br /&gt;
== Papers ==&lt;br /&gt;
&lt;br /&gt;
* Marco Dos Santos and researchers at [https://deepmind.google/ Google DeepMind] published a paper on the usage of AI to derive simple arithmetic rules for small Turing machine holdouts: [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]&lt;br /&gt;
&lt;br /&gt;
== Blog Posts / In the Media ==&lt;br /&gt;
&lt;br /&gt;
* [https://nickdrozd.github.io/2026/10/20/blanking-beavers-results-and-open-problems.html Blanking Beavers: Results and Open Problems]. Nick Drozd. 20 Oct 2026.&lt;br /&gt;
* [https://www.youtube.com/watch?v=kMHCl2PGloQ The Discord Server that Solved an Open Math Problem]. polylog. 25 Oct 2026.&lt;br /&gt;
&lt;br /&gt;
== BB Adjacent ==&lt;br /&gt;
&lt;br /&gt;
* [[Register machine|Register Machine]]&lt;br /&gt;
** On October 1, sheep discovered a 12-state, 2-register [[Cryptid]] which halts iff 7 converges to 1 under the Collatz-like 5n+1 map, thus showing that MBB(12, 2) is hard.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555083694937604097]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, @-d enumerated MBB(8), which left 7,891 holdouts after reduction, or 404 holdouts if an ai-created decider is used.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555102010473193513]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, @mineralli discovered a family of champions for MBB(n,1).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555268332465422508]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 2, @mineralli discovered a new champion for MBB(10,2).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555502006372663337]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, sheep discovered 2 new tetrational champions for MBB(10).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555512334846402573][https://discord.com/channels/960643023006490684/1552294888740098139/1555546324567335048]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki released an MBB(8) holdout list consisting of 145 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555699448066342953]&amp;lt;/sup&amp;gt; using another ai-created decider similar to CTL.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555699290285019147]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 3, Shawn Ligocki released another MBB(8) holdout list consisting of 46 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555754019606106212]&amp;lt;/sup&amp;gt; later reduced to 6&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555772428997886004]&amp;lt;/sup&amp;gt; holdouts.&lt;br /&gt;
** On the same day, Shawn Ligocki discovered a cryptid similar to [[Space Needle]] amongst the 6 remaining holdouts, showing MBB(8) is hard.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555767330531967099]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, sheep showed that all 6 holdouts were equivalent to two Space Needle-like cryptids: [[Register machine#MBB(8): Achilles and Patroclus|Achilles and Patroclus]],&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555897664078618675]&amp;lt;/sup&amp;gt; meaning MBB(8) &amp;quot;probviously&amp;quot; = 3,394.&lt;br /&gt;
** On the same day, Katelyn Doucette devised a method to show that a sizeable portion of powers of two could not be reached by Achilles&#039;s path.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1556086800861233154]&amp;lt;/sup&amp;gt; She later concluded that this backwards reasoning-like method, though powerful, would not be enough to decide Achilles.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1556810508160606243]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 7, sheep rediscovered a 2003 [https://web.archive.org/web/20061216201733/http://www2.cantabgold.net/users/m.y.becker.98/part2projects/rickdissertation.zip dissertation] by Rick Griffiths&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1557447684896464909]&amp;lt;/sup&amp;gt; which investigated the (maximum register value) Busy Beaver function for register machines (Beaver(n)); Griffiths determines the values of Beaver(n) for sizes 1 to 4 (using the modern instruction counting convention), and provides lower bounds for sizes 5 to 8. It also provides a machine (constructed by Ortwin Gasper in 2003) which shows the bound MBB(11) &amp;gt; 10↑↑17.74.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1557623496044183603]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 8, sheep marginally improved the bounds for MBB(10).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1557714856960983131]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 10, AlephSquirrel rediscovered a 2020 [https://www.sciencedirect.com/science/article/pii/S0304397519304633 article] by Yuri Matiyasevich&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1560363138946175047]&amp;lt;/sup&amp;gt; which provides a 130-instruction, 29-register machine which halts if and only if the Riemann hypothesis is false.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1557447684896464909]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 17, mineralli published a script capable of converting any arbitrary register machine into an equivalent 2-register machine.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1560932610723676202]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 22, mineralli released a list of 581 MBB(11,2) holdouts (though they are not confident that these are all of the MBB(11,2) holdouts) that display [[Collatz-like]] behavior.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1562879542643925073]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[SKI Calculus]]&lt;br /&gt;
** On October 8, cppdecksucker shared a holdouts list for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(8) consisting of 17 terms, 2 of which have been decided to not have a normal form.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1557759102187348009]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 12, cppdecksucker claimed to have used Aristotle AI to prove Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(8) = 80.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1559185635947057216]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Δ⁵ proved Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(5) = 47.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=prev&amp;amp;oldid=9048]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 13, Δ⁵ translated a 15 combinator term in the BCKW calculus, demonstrating Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(15) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{2 \uparrow\uparrow 18 - 1}}(2)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=9048]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 20, elgan65536 discovered new champions for Ξ₀(9)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1562237449848225846]&amp;lt;/sup&amp;gt; and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(11),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1562238534092464191]&amp;lt;/sup&amp;gt;, with trivial extensions that are new champions for Ξ₀(10), Ξ₀(11), and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(12).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1562251625597509764]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 21, elgan65536 discovered a new champion for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(10).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1562511629743165501]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Lambda Calculus]]&lt;br /&gt;
** On October 9, Discord user Sam discovered a new 80 bit term,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1557997291401642085]&amp;lt;/sup&amp;gt; shown by 50_ft_lock to demonstrate the bound BBλ(80) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^\omega + 1}(3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1558011994781778044]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 13, Sam optimized the BBλ(80) champion to a reduced and improved 79 bit term, demonstrating the bound BBλ(79) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^\omega + 1}(7)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1559448255803293757]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Gustavo Melo estimated that a specific family of terms, mentioned earlier by Sam,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1559075925449244794]&amp;lt;/sup&amp;gt; reaches &amp;lt;math&amp;gt;f_{\omega^\omega \cdot 2 + 1}&amp;lt;/math&amp;gt; growth.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1559648655135215627]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Sam discovered new &amp;lt;math&amp;gt;f_{\omega^\omega \cdot 2 + 1}&amp;lt;/math&amp;gt;-level champions for BBλ(70), BBλ(74), BBλ(78), and BBλ(80).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1559714680547844188]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 15, Gustavo Melo discovered new &amp;lt;math&amp;gt;f_{\omega^{\omega^\omega}}&amp;lt;/math&amp;gt;-level champions for BBλ(77),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560413331515379733]&amp;lt;/sup&amp;gt; BBλ(80),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560403657529360445]&amp;lt;/sup&amp;gt; and BBλ(85) (the next day),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560447706382602263]&amp;lt;/sup&amp;gt; and conjectured that a specific 76 bit term would have a normal form greater than &amp;lt;math&amp;gt;f_{\omega^{\omega^3}}(2)&amp;lt;/math&amp;gt; bits.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560406048337043459]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 16, Δ⁵ discovered a new 80 bit term, demonstrating the bound BBλ(80) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{\omega^{14}}}(2)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;amp;diff=prev&amp;amp;oldid=9125][https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;amp;diff=next&amp;amp;oldid=9167]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Gustavo Melo proved the conjecture about the 76 bit term&#039;s size, demonstrating the bound BBλ(76) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{\omega^3}}(2)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560695606035357816]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 17, Δ⁵ discovered a new 77 bit term, demonstrating the bound BBλ(77) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{\omega \cdot 2}}(3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;amp;diff=next&amp;amp;oldid=9199]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 18, Δ⁵ discovered a new 82 bit term, demonstrating the bound BBλ(82) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{\omega^\omega}}(2 \uparrow\uparrow\uparrow\uparrow 18)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;amp;diff=next&amp;amp;oldid=9214]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Beeping Busy Beaver]]&lt;br /&gt;
** On October 10, Crorem proved two bounds regarding different defintions of the Beeping Booping Busy Beaver function (BBBB(m,n)), which emulates a Turing machine equipped with a second-order oracle: BBBB&amp;lt;sub&amp;gt;first&amp;lt;/sub&amp;gt;(2,3) = 177, and BBBB&amp;lt;sub&amp;gt;last&amp;lt;/sub&amp;gt;(2,3) ≥ 265. Notably, Crorem reduced the BBBB&amp;lt;sub&amp;gt;last&amp;lt;/sub&amp;gt;(2,3) domain to 5 holdouts, one of which Crorem believes to be a Collatz-like Cryptid.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1558372326251438151]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 26, carrino claimed to have used Claude to determine the instruction-based champions for 1 to 4 states and 2 symbols, and for 2 states and 3 symbols.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1564393769984458862]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Instruction-Limited Busy Beaver|Domain-Restricted Instruction-Limited Busy Beaver]]&lt;br /&gt;
** On October 10, star claimed to have used Claude to discover a new champion for BBi(10, 6, 2) (colloquially known as BB(5.5)).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558608094949416993]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 11, star claimed to have used Claude to reduce BBi(10, 6, 2) to 4 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558654629821157499]&amp;lt;/sup&amp;gt; all of which were present in the most recent holdouts equivalence list at the time (BB6_holdouts_1581_eqv_740.txt).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558671475999772775]&amp;lt;/sup&amp;gt; She believes that two of these holdouts ({{TM|1RB1LA_1RC0RF_1RD---_0LE1RB_---0LA_1LD1RF}} and another equivalent machine) are Cryptids.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558766480424964169]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Fractran]]&lt;br /&gt;
** On October 13, @-d completed the verification of the ai-generated 1dpc decider and its certificates, reducing the official count of BBf(23) holdouts from 21,233 to 8,021, and the official count of BBf(24) holdouts from 231,432 to 85,726.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1559523323493482566]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, @-d discovered 0.1% of certificates created by the ai-generated ndpc decider to be invalid, hypothesized to have been caused by a soundness bug in the decider.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1559708872019681341]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 24, @-d discovered the size 24 energy vampire &amp;lt;code&amp;gt;[2/15, 1/6, 441/2, 11/3, 25/7, 6/11]&amp;lt;/code&amp;gt;, a Collatz-like machine that simulates an unbiased random walk. What separates this holdout from other random walks is its sheer luck; over several extremely far simulations (one to 2&amp;lt;sup&amp;gt;34&amp;lt;/sup&amp;gt; iterations,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1563511627742191627]&amp;lt;/sup&amp;gt; one to 2&amp;lt;sup&amp;gt;35&amp;lt;/sup&amp;gt; iterations,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1563991018401960128]&amp;lt;/sup&amp;gt; and one to 1.5 × 2&amp;lt;sup&amp;gt;38&amp;lt;/sup&amp;gt; iterations&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1565260814368251955]&amp;lt;/sup&amp;gt;), the machine has remained active; if this machine were to halt, it would show BBf(24) &amp;gt; 6.38 × 10&amp;lt;sup&amp;gt;175,634,090,326&amp;lt;/sup&amp;gt;.&lt;br /&gt;
** On October 26, Shawn Ligocki added BMO12 (&amp;lt;code&amp;gt;[2/15, 1/6, 441/2, 11/3, 25/7, 6/11]&amp;lt;/code&amp;gt;) to the [[Beaver Math Olympiad]].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1226543091264126976/1564372797709361262]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 30, @-d claimed the halting of BMO12 in 1.714 × 10&amp;lt;sup&amp;gt;210,914,744,116&amp;lt;/sup&amp;gt; steps (i.e. 495,141,375,730 iterations), awaiting verification.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1565647448452636672]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Pebble Automaton]]&lt;br /&gt;
** On October 13, AlephSquirrel proved peBBle(5) = 11 and peBBle(6) = 17.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1559703384943104163]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 18, AlephSquirrel proved peBBle(7) = 28.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561404687260065896]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 19, Shawn Ligocki claimed to have used Google Gemini to prove peBBle(8) = 63 using a CTL-like method,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561538647470379019]&amp;lt;/sup&amp;gt; and to find 54,394 9-pebble holdouts (including automata with multiple undefined transitions),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561539854834335764]&amp;lt;/sup&amp;gt; later reduced to 376 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561553087938953228]&amp;lt;/sup&amp;gt; then 104 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561571328253890590]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 19, a poll was held to determine whether a pebble automata that moves pebbles every step, but has no effect on any cells (i.e. it has a static tape), should be considered as halted (which is what the old halting definition decides); the general consensus is to class this behavior as non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561785819872886919]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to prove peBBle(9) = 63,577, under the old halting definition.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561852114299523185]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 20, Shawn Ligocki claimed to have used Google Gemini to find a peBBle(10) champion that runs for 5,778 steps, simultaneously finding 1,867 10-pebble holdouts (including automata with multiple undefined transitions),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561905431960485888]&amp;lt;/sup&amp;gt; later reduced to 1,221 holdouts, though these lists were considered only under the old halting definition.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561978057764376669]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, AlephSquirrel discovered that one of the peBBle(10) holdouts used a mechanism that simulates a [[Piecewise Affine Function]],&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562101152986828830]&amp;lt;/sup&amp;gt; though none of the extraneous conditions lead to halting;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562121777054879916]&amp;lt;/sup&amp;gt; she also provided a compressed spacetime diagram of this holdout.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562208455383580773]&amp;lt;/sup&amp;gt; A similar holdout was shared earlier that day by Shawn Ligocki, but not analyzed.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561915644536946739]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to produce peBBle(10) holdout lists with 429 holdouts&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562194616546238526]&amp;lt;/sup&amp;gt; and 319 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562230142577676439]&amp;lt;/sup&amp;gt; both updated to account for the new halting definition.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562160772551802953]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 21, AlephSquirrel analyzed the aforementioned peBBle(10) former holdout (excluding edge cases), confirming that it models a PAF.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562457437666017301]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to produce a peBBle(10) holdout list with 268 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562461150245814384]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Aleph Squirrel discovered a 12 pebble possible Cryptid, implying solving peBBle(12) would be at least as hard as solving a BMO1-like problem.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562498516729991280]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to prove peBBle(10) = 5,778.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562579016895176798]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 28, Shawn Ligocki began enumeration of peBBle(11), finding a machine that demonstrates peBBle(11) ≥ 9,040,389.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565052555728257195]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, Shawn Ligocki completed enumeration of peBBle(11) using an enumerator and deciders written by Google Gemini, claiming to find 359,706 11-pebble holdouts (including automata with multiple undefined transitions).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565456164785881191]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki found two new champions for peBBle(11).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565462948103847957]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 30, Shawn Ligocki found a peBBle(11) champion that runs for 810,626,821 steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565541995852865558]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to produce peBBle(11) holdout lists with 160,367 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565580890082643968]&amp;lt;/sup&amp;gt; 960 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565594328217165984]&amp;lt;/sup&amp;gt; 580 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565754647644344401]&amp;lt;/sup&amp;gt; and 229 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565846253072285786]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 31, Shawn Ligocki claimed to have used Google Gemini to produce peBBle(11) holdout lists with 133 holdouts&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565890967935127663]&amp;lt;/sup&amp;gt; and 22 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565911083087167654]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, sheep reduced this claimed holdout list to 10 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1566004742080045099]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [https://discord.com/channels/960643023006490684/1476612651109843024 Busy Bricklayer Problem]&lt;br /&gt;
** On October 20, mathmasterzach, along with their friends, showed that the problem&#039;s associated busy beaver function, over the 10-ominos, either takes the value 138, or is larger than 3,000.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1561917906051407909]&amp;lt;/sup&amp;gt; Note that there is still one undecided 10-omino.&lt;br /&gt;
** On October 21, mathmasterzach, using the singular 10-omino holdout, produced a tiling of an 88-cell wide half-strip.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1562458368763891855]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 24, Drakou111 set up a distributed computation project that aims to determine which rectangles the 10-omino holdout can be shown to (not) tile. The project increased the minimum tiles required to 3,200.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1563594621030768731]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 25, the bound for the smallest number of the holdout 10-omino tiles (now named fe70&amp;lt;sup&amp;gt;[https://fe70.org/]&amp;lt;/sup&amp;gt;) required to tile a rectangle had increased to 3,264.&amp;lt;sup&amp;gt;[https://fe70.org/api/results]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 26, mathmasterzach completed an ennumeration of larger domains, finding lower bounds on the largest smallest rectangle a polyomino can tile for 11-ominos, 12-ominos, and 13-ominos, finding order 270, order 180, and order 2 tiles for each domain respectively, and finding 3, 16, and 0 holdout tiles for each domain respectively.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1564111342346960958]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, mathmasterzach announced that the minimum width of a hypothetical rectangle that the 10-omino holdout can tile had been shown to be at least 165, and that half-strip tilings were known to be constructible for widths of the form 168 + 8n.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1565474623254954015]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Instruction-Limited Busy Beaver]]&lt;br /&gt;
** On October 24, nickdrozd claimed to have used ChatGPT to claim two of the final nine informal BBi(8) holdouts halting.&lt;br /&gt;
** On the same day, prurq confirmed one of nickdrozd&#039;s claims,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1563639486670311576]&amp;lt;/sup&amp;gt; and claimed to use Aristotle to confirm the other of nickdrozd&#039;s claims.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1563647923013558374]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, hipparcos confirmed the other of nickdrozd&#039;s claims.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565202912903438408]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Semi Infinite Tape Turing Machine]]&lt;br /&gt;
** On October 25, [[User:Loader3229]] created an alternative model for Turing machines on a semi infinite tape, where a Turing machine that attempts to move leftwards off the tape remains stationary, giving rise to the function BB&amp;lt;sub&amp;gt;SI&amp;lt;/sub&amp;gt;(m,n), which they provided small champions for.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Semi_Infinite_Tape_Turing_Machine&amp;amp;oldid=9562]&amp;lt;/sup&amp;gt; Notably, one state machines do not act as trivially in this model, and that BB&amp;lt;sub&amp;gt;SI&amp;lt;/sub&amp;gt;(1,n) is at least quadratic in growth.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1450894930422530161/1563965787998392406]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Champions ==&lt;br /&gt;
{| class=&amp;quot;wikitable mw-collapsible mw-collapsed&amp;quot;&lt;br /&gt;
|+New&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;champions&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;discovered&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;this&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;month&lt;br /&gt;
|-&lt;br /&gt;
!Domain&lt;br /&gt;
!Champion&lt;br /&gt;
!Discoverer&lt;br /&gt;
!New lower bound&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Previous lower bound&lt;br /&gt;
|-&lt;br /&gt;
|BB(7)&lt;br /&gt;
|{{TM|1RB0RG_1RC1RB_0RD1RZ_0LE0LD_0LF1LE_1RA1LF_1LC0RB|halt}}&lt;br /&gt;
| rowspan=&amp;quot;8&amp;quot; |Jeff Ketchersid&lt;br /&gt;
|&amp;lt;math&amp;gt;3 \uparrow^{20} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Pavel&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;Kropitz&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;2 \uparrow^{11} 2 \uparrow^{11} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(8)&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LH0LC_1RG1LD_0RG0RF_1RG---|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^3(12)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(9)&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LH0LC_1RG1LD_0RG0RF_0LI---_1LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^6(12)&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}(f_{9}(2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(10)&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LI0LC_0RG1LD_1RH1LG_1LC0RG_0LJ0LI_1RZ0LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(2 \uparrow^{36} 3) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|racheline&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^2(25)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(11)&lt;br /&gt;
|{{TM|1RG0LH_1RK1RC_0LD1LA_0RE1LD_0LI1RF_1RZ0RG_1RB1RG_1LA1LH_0LK0LJ_1LH1LI_1LJ1RE|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(f_\omega^2(5))&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^2(10 \uparrow^4 4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(12)&lt;br /&gt;
|{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RG0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_1RZ0LL_0LH1LK|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}(f_{\omega + 1}^2(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|racheline&lt;br /&gt;
|&amp;lt;math&amp;gt;f_\omega^4(2 \uparrow\uparrow\uparrow 4-3) &amp;gt; f_\omega^4(f_4(2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(13)&lt;br /&gt;
|{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RM0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_0LL0LL_0LH1LK_1RZ0LH|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}^6(f_{\omega + 1}(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|50_ft_lock&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(2046) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(14)&lt;br /&gt;
|{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RM0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_0LN0LL_0LH1LK_1RZ0LH_0RJ0LI|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}^9(f_{\omega + 1}(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(f_\omega^4(f_7(3)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(29)&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |[https://discord.com/channels/960643023006490684/1331570843829932063/1564527050512142427 too long, see source]&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |mxdys&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega^\omega}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |racheline&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |&amp;lt;math&amp;gt;f_{\omega^2}^2(4 \uparrow\uparrow 341)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(31)&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega \uparrow\uparrow 4}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(33)&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega \uparrow\uparrow 6}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,4)&lt;br /&gt;
|{{TM|0LB3LB1RZ2RA_1LD3RB1LC2RA_3RB1LB3LC2RC_0RD2RC2LB0RA|halt}}&lt;br /&gt;
|[[User:Loader3229]]&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{509} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,4)&lt;br /&gt;
|{{TM|1LF2RA3RB---_3RD2LB3RB1LC_2RA1LB3RC2LC_1LD2RE0LA1LD_1RZ0LE1LF---_2RA---2LF2LF|halt}}&lt;br /&gt;
|Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(10 \uparrow\uparrow 65533) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^2(10 \uparrow\uparrow\uparrow6)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,4)&lt;br /&gt;
|{{TM|1RC3LB2RD2RA_1RF3RB1LC2RA_3RB1LB3LC2RC_0RF2LD1LD2LE_3RE3LB2RE2LE_0LG0LH1RZ3RB_1LG2RD1LG3RG_0LH0LC0LH3RD|halt}}&lt;br /&gt;
| rowspan=&amp;quot;7&amp;quot; |[[User:Loader3229]]&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}(f_\omega^4(12))&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;f_{\omega + 1}(f_{\omega}(f_7(2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(9,4)&lt;br /&gt;
|{{TM|2LI3LB2RD2RA_2LC3RB1LC2RA_3RB1LB3LC2RC_0RF2LD1LD2LE_3RE3LB2RE2LE_0LG0LH1RZ---_1LG2RD1LG3RG_0LH---0LH3RD_2LB---1LI3RF|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}(16)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,5)&lt;br /&gt;
|{{TM|1RB3LB4LC2RA4LB_2LC3RB1LC2RA4RD_3RB1LB3LC2RC4LC_2RC2RD1RZ4RB1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(27,041) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|racheline&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}(2 \uparrow^{15} 5)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(5,5)&lt;br /&gt;
|{{TM|1LB3LB4LC2RA4LB_3LE3RB1LC2RA4RD_3RB1LB3LC2RC4LC_1RZ------4LD4LE_3RB------4LE3LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(f_{\omega}^4(6))&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,5)&lt;br /&gt;
|{{TM|0LB3LB4LC2RA4LB_1LF3RB1LC2RA4RD_3RB1LB3LC2RC4LC_1RZ------4LD4LE_3RB------4LE3LC_4RF3RE---0RA3LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}(11)&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |Jacobzheng&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;f_{\omega}^2(10 \uparrow\uparrow\uparrow6)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,5)&lt;br /&gt;
|{{TM|2LE3LB4LC2RA4LB_4RA3RB1LC2RA4RD_3RB1LB3LC2RC4LC_---3LF1LG4LD4LE_3RB---1LE4LE3LC_4LC------3LF3LF_3LF------1LG1LG|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}^2(10)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,5)&lt;br /&gt;
|{{TM|0LB3LB1RZ2RA4RB_0LD1RB1LD2RA1LE_3RB1LB3LC2RC3LF_3RE2LF3LC2RC4LF_0LF3RE0LG4LH2LB_0LE3LG4LC2RF4LG_1LC3RG1LH2RF2RA_3RG1LG3LH2RH4LH|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega \cdot 2}(32)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(f_{\omega}(f_7(2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(2,7)&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA_2LA6RA4RB1RZ3LB6LA4RB|halt}}&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |roromachine14&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 4&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |Pavel Kropitz&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |&amp;lt;math&amp;gt;10 \uparrow\uparrow 10 \uparrow\uparrow 10^{10^{115}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(2,8)&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA1RZ_2LA6RA4RB7RA3LB6LA4RB4RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(2,9)&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA8RA1RZ_2LA6RA4RB7RA3LB6LA4RB4RA4RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 6&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
* Jeff Ketchersid claimed to have used Claude Opus 5.5 and Gemini 4 Argon to discover and prove the scores of a set of Ackermann-level machines, three of which ([[BB(8)]], BB(9), BB(10)) were derived from Pavel Kropitz&#039;s former [[BB(7)]] champion, and three of which (BB(12), BB(13), BB(14)) were derived from Jacobzheng&#039;s former champion for BB(14). Ketchersid also claimed to have found a new, novel champion for BB(7). Ketchersid&#039;s previous claimed bounds are listed here:&lt;br /&gt;
** On October 4, BB(8) &amp;gt; &amp;lt;math&amp;gt;2 \uparrow^{37} 3&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1448375857046360094/1556422395776995408][https://github.com/jeff87654/busy-beaver/commit/d8d00340fc3435684c0baf506f5c1d84b6f7f4a8]&amp;lt;/sup&amp;gt; Prior to this, the BB(7) champion, found by Pavel Kropitz, which held the BB(8) championship by default, ran for around &amp;lt;math&amp;gt;2 \uparrow^{11} 2 \uparrow^{11} 3&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
** On October 7, BB(9) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}(2 \uparrow^{13} 3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1557495370014130300][https://github.com/jeff87654/busy-beaver/commit/0b61aa598ce99ee04eaa88dec7f113d3d60340db]&amp;lt;/sup&amp;gt; Prior to October, the BB(9) champion, found by Jacobzheng, ran for around&amp;lt;math&amp;gt;f_{\omega}(f_{9}(2))&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
** On October 8, BB(10) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(2 \uparrow^{36} 3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1557806386073702622][https://github.com/jeff87654/busy-beaver/commit/772402455254c6afe9ba8fad50e074b14ec7a755]&amp;lt;/sup&amp;gt; Prior to October, the BB(10) champion, found by racheline, ran for around &amp;lt;math&amp;gt;f_{\omega}^2(25)&amp;lt;/math&amp;gt; steps; this machine also dethroned the previous BB(11) champion, which was found by Jaconzheng, and ran around &amp;lt;math&amp;gt;f_{\omega}^2(10 \uparrow^4 4)&amp;lt;/math&amp;gt; steps. for This is also the smallest 2-symbol machine (in states) known to run for longer than a [[Graham&#039;s number]] number number of steps; in other words, this machine shows that BB(10) &amp;gt; g&amp;lt;sub&amp;gt;64&amp;lt;/sub&amp;gt;, improving on 50_ft_lock&#039;s earlier result that BB(13) &amp;gt; g&amp;lt;sub&amp;gt;64&amp;lt;/sub&amp;gt;.&lt;br /&gt;
** On October 11, BB(12) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}^2(2 \uparrow^{36} 3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/ca5f0882319c02b86055a93ecbec1d150244a9c6]&amp;lt;/sup&amp;gt; Prior to October, the BB(12) champion, found by racheline, ran for around &amp;lt;math&amp;gt;f_{\omega}^4(2 \uparrow\uparrow\uparrow 4 - 3)&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
** On October 14, BB(13) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(f_{\omega}(20))&amp;lt;/math&amp;gt; and BB(14) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}^3(15)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1559991272456986684][https://github.com/jeff87654/busy-beaver/commit/502667dd6eb65ca014957b30487af3dc94192411]&amp;lt;/sup&amp;gt; Prior to October, the BB(13) champion, found by 50_ft_lock, ran for around &amp;lt;math&amp;gt;f_{\omega + 1}(2046)&amp;lt;/math&amp;gt; steps, and was previously the 2-symbol machine with the least amount of states used that was known to run longer than g&amp;lt;sub&amp;gt;64&amp;lt;/sub&amp;gt; steps, whereas the BB(14) champion, found by Jacobzheng, ran for around &amp;lt;math&amp;gt;f_{\omega + 1}(f_\omega^4(f_7(3)))&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
** On October 17, BB(9) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}(f_{\omega}(465,009))&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/9ed1e7a0e7437244942ed4545f199774c5c8a117]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 18, BB(9) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}^3(12)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/be5ae9e6b4ea975fe0eebf01b75a114d7bbf3889]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 19, BB(8) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}^3(12)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/be7b08caf8b6bc30a32c0c6274c1ce7f14f5c2d3]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 22, a new bound for BB(9) slightly larger than that for BB(8) at the time.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/52aab0ec4fbf1c93c177255a50eefb9e1e5dcc18]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 22, BB(9) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}^6(12)&amp;lt;/math&amp;gt;, with their new BB(8) champion from October 19 also being announced along with this champion on this day.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1562971399029526539][https://github.com/jeff87654/busy-beaver/commit/3750b1490e0e7b01e6301450e1b1774afb2658c5][https://github.com/jeff87654/busy-beaver/commit/e107e3b1ac28da6dae224181ae71fe1627348bd9]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 23, Jeff Ketchersid claimed to have used Gemini 4 Argon and Claude Opus 5.5 to search through the over fifteen million BB(7) holdouts, resulting in the finding of a &#039;&#039;&#039;new BB(7) champion&#039;&#039;&#039;, {{TM|1RB0RG_1RC1RB_0RD---_0LE0LD_0LF1LE_1RA1LF_1LC0RB|halt}}, which runs for over &amp;lt;math&amp;gt;3 \uparrow^{20} 3&amp;lt;/math&amp;gt; steps, leaving a similarly notated number of ones on the tape.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1563048075184836699][https://github.com/jeff87654/busy-beaver/commit/9d9a1a4fcaa5dbabc19e887e0fd834cb79567081]&amp;lt;/sup&amp;gt; This dethrones the previous champion, {{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF|halt}}, found by Pavel Kropitz in May 2025,&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=BB(7)&amp;amp;oldid=9434#cite_note-10]&amp;lt;/sup&amp;gt; which runs for around &amp;lt;math&amp;gt;2 \uparrow^{11} 2 \uparrow^{11} 3&amp;lt;/math&amp;gt; steps. Both of these champions begin by setting a pattern that repeats dozens of times, which is iterated upon by using an Ackermann-level mechanism to reach similarly impressive heights. Notably, this new champion has a twin machine, {{TM|1RB0RG_1RC1RB_0RD1RZ_0LE0LD_0LF1LE_1RA1LF_0LD0RB|halt}}, which differs in only one transition, and uses the same mechanism to output the same number of ones, but runs for slightly shorter than than the champion.&lt;br /&gt;
** On October 26, BB(12) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(f_{\omega + 1}^2(3))&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564399479707406348]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, BB(11) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(f_\omega^2(5))&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/27d8d20284b2a6c57f7389a7b3d8c587275b8b5a]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 28, BB(13) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}^6(f_{\omega + 1}(3))&amp;lt;/math&amp;gt; and BB(14) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}^9(f_{\omega + 1}(3))&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565084294110515250]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* roromachine14 claimed to have used Gemini 4 Argon to discover a new champion for BB(2,7) on October 22, and new champions for BB(2,8), and BB(2,9) on October 23, running for at least &amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 4&amp;lt;/math&amp;gt; steps, &amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 5&amp;lt;/math&amp;gt; steps, and &amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 6&amp;lt;/math&amp;gt; steps respectively.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1563058883654590494][https://discord.com/channels/960643023006490684/1084047886494470185/1563070360956698804]&amp;lt;/sup&amp;gt; The previous champion for these domains was, by default, Pavel Kropitz&#039;s BB(2,6) champion, which ran for around &amp;lt;math&amp;gt;10 \uparrow\uparrow 10 \uparrow\uparrow 10^{10^{115}}&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
* mxdys claimed to have used AI to discover three near-ε&amp;lt;sub&amp;gt;0&amp;lt;/sub&amp;gt;-level champions, demonstrating BB(29) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^\omega}(3)&amp;lt;/math&amp;gt;, BB(31) &amp;gt; &amp;lt;math&amp;gt;f_{\omega \uparrow\uparrow 4}(3)&amp;lt;/math&amp;gt;, and BB(33) &amp;gt; &amp;lt;math&amp;gt;f_{\omega \uparrow\uparrow 6}(3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1564527050512142427]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[User:Loader3229]] discovered an array of champions based on Kropitz&#039;s current [[BB(3,4)]] champion, demonstrating the following bounds:&lt;br /&gt;
** On October 27, BB(3,n + 4) &amp;gt; &amp;lt;math&amp;gt;f_\omega^{n + 1}(15)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564608571734495313]&amp;lt;/sup&amp;gt; and BB(4,4) &amp;gt; &amp;lt;math&amp;gt;2 \uparrow^{195} 3&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564638159944294442]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 28, BB(4,4) &amp;gt; &amp;lt;math&amp;gt;2 \uparrow^{509} 3&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;,[https://discord.com/channels/960643023006490684/1084047886494470185/1564816765031288876]&amp;lt;/sup&amp;gt; BB(4,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(27,041) &amp;gt; g_{64}&amp;lt;/math&amp;gt;,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564866772941672489]&amp;lt;/sup&amp;gt; and BB(6,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(97) &amp;gt; g_{64}&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565043340984979488]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, BB(8,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(83)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565368627304210483]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 30, BB(8,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(f_\omega^4(12))&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565534357181960424]&amp;lt;/sup&amp;gt; and BB(9,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 3}(16)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565660171684941895]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 31, BB(5,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(f_{\omega}^4(6)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566039528819400716]&amp;lt;/sup&amp;gt;, BB(6,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 3}(11)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566103427316977789]&amp;lt;/sup&amp;gt; (preceeded by &amp;lt;math&amp;gt;f_{\omega + 2}(126)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566047238252400641]&amp;lt;/sup&amp;gt;  and &amp;lt;math&amp;gt;f_{\omega + 2}(176)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566092396062711870]&amp;lt;/sup&amp;gt;), BB(7,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 3}^2(10)&amp;lt;/math&amp;gt;,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566111131926274121]&amp;lt;/sup&amp;gt; and BB(8,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega \cdot 2}(32)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566113702468390923]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* Jacobzheng discovered a 6-state, 4-symbol Turing machine that demonstrates the bound BB(6,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(10 \uparrow\uparrow 65533)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Champions&amp;amp;diff=prev&amp;amp;oldid=9777]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Holdouts ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&#039;&#039;&#039;BB Holdout Reduction by Domain&#039;&#039;&#039;&lt;br /&gt;
!Domain&lt;br /&gt;
!New Holdout Count&lt;br /&gt;
!Previous Holdout Count&lt;br /&gt;
!Holdout Reduction&lt;br /&gt;
!% Reduction&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|608&lt;br /&gt;
|797&lt;br /&gt;
|189&lt;br /&gt;
|23.71%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(7)]]&lt;br /&gt;
|12,663,440*&lt;br /&gt;
|15,743,264&lt;br /&gt;
|3,079,824&lt;br /&gt;
|19.56%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,3)]]&lt;br /&gt;
|4,673,384&lt;br /&gt;
|4,720,332&lt;br /&gt;
|46,948&lt;br /&gt;
|0.99%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,5)]]&lt;br /&gt;
|37&lt;br /&gt;
|39&lt;br /&gt;
|2&lt;br /&gt;
|5.13%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,6)]]&lt;br /&gt;
|389,503&lt;br /&gt;
|412,086&lt;br /&gt;
|22,583&lt;br /&gt;
|4.47%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,7)]]&lt;br /&gt;
|3,125,433,611&lt;br /&gt;
|&#039;&#039;Enumeration incomplete&#039;&#039;&lt;br /&gt;
|&#039;&#039;N/A&#039;&#039;&lt;br /&gt;
|&#039;&#039;N/A&#039;&#039;&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;nowiki&amp;gt;*&amp;lt;/nowiki&amp;gt;list may be incomplete, see Holdouts &amp;gt; BB(7).&lt;br /&gt;
* [[BB(6)]]&lt;br /&gt;
** On October 1, Discord user oscar claimed to have used GPT-6.1 Sol to prove a machine non-halting, [https://github.com/oscar172772/bb6-1RB1RF_1LC0LF_---0LD_0LE1LD_0RF0LB_1RA1RE-nonhalt-proof formalized] in Rocq the next day.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1555183165977403453/1555641766391324813]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 1, dyuan shared a subset of [[BB(6)]] holdouts, consisting of 24 machines which are expected to be easily analyzable by [[Longitudinal Analysis|longitudinal analysis]].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1555244959840337973]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 3, oscar claimed to have used GPT-6.1 Sol to prove a machine halting,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1555992557148831755]&amp;lt;/sup&amp;gt; formalized in Rocq the next day.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1556006145649545247/1556258332048887889]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 6, Discord user Zuck claimed to have used Claude to prove a machine non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1557025952217833632]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 7, mxdys released a holdout list of &#039;&#039;&#039;778&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1557353710101995550]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 10, Discord user Dennis claimed to have used Claude Opus 5.5 to [https://github.com/DennisKoshta/busycoq/blob/59de13796aa9dbccedd52bc5d081e87980dd2f7e/verify/BellEatsCounter_1RB0RF.v prove] a machine non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558558131213041755]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, mxdys released a holdout list of &#039;&#039;&#039;740&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558585686288891986]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 11, Dennis claimed to have used Claude Opus 5.5 to [https://github.com/ccz181078/busycoq/pull/16 prove] another 4 machines non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558644008199262220]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 13, Dennis claimed to have used Claude Opus 5.5 to [https://github.com/ccz181078/busycoq/pull/17 prove] another 3 machines non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1559650670632632360]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Dennis claimed to have used Claude Opus 5.5 to [https://github.com/ccz181078/busycoq/pull/18 prove] a machine halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1559661025270435870/1559661025270435870]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 15, mxdys released a holdout list of &#039;&#039;&#039;698&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560185889290985532]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/ccz181078/busycoq/pull/19 prove] 7 machines halting, and another 20 machines (pull requests [https://github.com/ccz181078/busycoq/pull/20 #1], [https://github.com/ccz181078/busycoq/pull/21 #2], [https://github.com/ccz181078/busycoq/pull/22 #3], [https://github.com/ccz181078/busycoq/pull/23 #4]) non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560409510156435476]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Dennis claimed to have used Claude Opus 5.5 and GPT-6 Astra to prove another 8 machines (pull requests [https://github.com/ccz181078/busycoq/pull/24 #1], [https://github.com/ccz181078/busycoq/pull/25 #2], [https://github.com/ccz181078/busycoq/pull/26 #3], [https://github.com/ccz181078/busycoq/pull/27 #4], [https://github.com/ccz181078/busycoq/pull/28 #5]) non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560430940168265729]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 16, mxdys released a holdout list of &#039;&#039;&#039;663&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560559556164063242]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 21, Re-us simulated a machine to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1562505095365787862]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 24, mxdys released a holdout list of &#039;&#039;&#039;623&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1563505561905926175]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, stratus1221 simulated two machines to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1563597080176500877]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 25, mxdys confirmed another three machines halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1563868945218408490]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, stratus1221 simulated another two machines to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1563927722445508618]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 27, stratus1221 simulated another machine to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1564592221603495937]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, enan456 claimed to have used Claude Fable 5.1&amp;lt;sup&amp;gt;[https://github.com/Enan456/bbchallenge-proofs/commit/72965887b21cfc0310a90c93ec36b09d8b3ee8f6]&amp;lt;/sup&amp;gt; to [https://github.com/Enan456/bbchallenge-proofs reproduce] 4 of Google DeepMind&#039;s potential cryptids forward behavior and to confirm the rules established. None of them have been decided&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1565230636741169234][https://github.com/Enan456/bbchallenge-proofs/blob/main/docs/results/2026-10-22-gdm-cross-verification.md]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 30, Ahmer Reza simulated four holdouts, all Reus Vampires, to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1565557844869382316]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, mxdys released a holdout list of &#039;&#039;&#039;608&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1565584609176195113]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Ahmer Reza simulated another holdout, a Reus Vampire, to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1565656577178992651]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(7)]]&lt;br /&gt;
** On October 23, Jeff Ketchersid claimed to have used Gemini 4 Argon and Claude Opus 5.5 to find a new BB(7) champion; more details are available in the Champions section.&lt;br /&gt;
** Finlay reduced the numbers of holdouts from &#039;&#039;&#039;15,743,264&#039;&#039;&#039; to &#039;&#039;&#039;12,663,440&#039;&#039;&#039;, a 19.56% reduction,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1564656989999472782]&amp;lt;/sup&amp;gt; though a handful of TNF children are reportedly missing from the final files.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1563950872000467005]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(4,3)]]&lt;br /&gt;
** Andrew Ducharme reduced the number of holdouts from &#039;&#039;&#039;4,720,332&#039;&#039;&#039; to &#039;&#039;&#039;4,673,384&#039;&#039;&#039;, a &#039;&#039;&#039;0.99%&#039;&#039;&#039; reduction using Meet-in-the-Middle CTL with tape folding.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564216669256294481]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,5)]]&lt;br /&gt;
** On October 2, prurq claimed to have used Aristotle AI, to prove one of the remaining holdouts halting, reducing the unofficial count to &#039;&#039;&#039;38&#039;&#039;&#039; out of initially 60 Rocq-proven.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1555690509245087827]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 9, prurq simulated a machine to halting using a Rocq-certified program, reducing the official and unofficial counts to respectively &#039;&#039;&#039;59&#039;&#039;&#039; and &#039;&#039;&#039;37&#039;&#039;&#039;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1558226290509742082]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 17, LegionMammal978 simulated {{TM|1RB---3RA2LA2RB_2LB3LA4LB4RA0RA|halt}} to over 10&amp;lt;sup&amp;gt;1,140,000,000&amp;lt;/sup&amp;gt; steps,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1561033327190872226]&amp;lt;/sup&amp;gt; previously claiming the machine to be a doubly-exponential probviously halting &amp;quot;hard-drive vampire&amp;quot;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1559400536690794496][https://discord.com/channels/960643023006490684/1259770421046411285/1559690798490980384]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,6)]]&lt;br /&gt;
** Andrew Ducharme reduced the number of holdouts from &#039;&#039;&#039;412,086&#039;&#039;&#039; to &#039;&#039;&#039;389,503&#039;&#039;&#039;, a &#039;&#039;&#039;5.48%&#039;&#039;&#039; reduction.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1561092563581145182][https://discord.com/channels/960643023006490684/1084047886494470185/1561506925126877265][https://discord.com/channels/960643023006490684/1084047886494470185/1562784657907650581]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,7)]]&lt;br /&gt;
** Terry Ligocki enumerated 20K more subtasks, increasing the number of holdouts to &#039;&#039;&#039;3,125,433,611&#039;&#039;&#039;. All 1 million subtasks have been enumerated! This enumeration took from November 2025 to October 2026 using the resources [Ligocki] had available to work on this enumeration. Now we can start decreasing the number of holdouts!&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
All Turing machines mentioned in this section work with an alphabet of 2 symbols unless explicitly stated. The state bounds given also only consider Turing machines which work with 2 symbols.&lt;br /&gt;
&lt;br /&gt;
* [[Cryptids#Cryptids at the Edge|Cryptids in the Wild]] (+ [[User:RobinCodes/Machines at the Edge|Energy Vampires]])&lt;br /&gt;
** On October 15, Google DeepMind claimed to have used Gemini 3.1 Pro to discover and [https://github.com/google-deepmind/cryptids/commit/ac5eff7b899f1920cea206363fa05a856005e130 prove] simple rules that characterise the behavior of 11 BB(6) holdouts, noting them as potential Cryptids.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560334894704492594]&amp;lt;/sup&amp;gt; Their methods are elaborated on in their [https://arxiv.org/abs/2610.22603 paper], published this month.&lt;br /&gt;
** [https://discord.com/channels/960643023006490684/1561037362581086228 Reus Vampires]&lt;br /&gt;
*** On October 15, Re-us claimed to have used Claude Opus 5.5 to discover 7 probviously halting BB(6) holdouts which rely on an exceedingly rare tape configuration to halt, similar to the mechanism used by {{TM|1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA|halt}}.&amp;lt;sup&amp;gt;[https://github.com/thomasreus-bb/bb6-vampire-family-1RB0LA_0RC0RB_1LD1LA_1LC1RE_1RF0RD_1LC---][https://discord.com/channels/960643023006490684/1239205785913790465/1560688456382939268]&amp;lt;/sup&amp;gt; Re-us has also estimated that, assuming perfect randomness of the machines&#039; bit generation, a median of 780 billion iterations would have to be applied for each machine to halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1562001104701759511][https://github.com/thomasreus-bb/bb6-vampire-family-1RB0LA_0RC0RB_1LD1LA_1LC1RE_1RF0RD_1LC---/commit/a523942bf34d6ad793727d3197d81f45f81f78a0]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 19, Re-us ran path O1 to 1.08 × 10&amp;lt;sup&amp;gt;10&amp;lt;/sup&amp;gt; iterations; the path, and therefore the machines associated with the path, have not yet halted.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1561737008143933491]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On the same day, Andrew Ducharme ran path O2 to 3.5 × 10&amp;lt;sup&amp;gt;9&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1561757313851990100]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On the same day, Re-us ran path O2 to 8 × 10&amp;lt;sup&amp;gt;9&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1561767318495694918]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On the same day, Ersen ran path O2 to 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1561787161726947358]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 21, Andrew Ducharme ran path O3 to 10&amp;lt;sup&amp;gt;10&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1562019033405063229]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 22, Re-us ran path O2 to 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt, confirming Ersen&#039;s previous simulation.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1562732252511731796]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 22, Ersen ran path O1 to 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1562918309697949796]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 23, Andrew Ducharme ran path O4 to 2 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1563298186301542441]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 25, Re-us ran path O2 to 3 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1563930665114800130]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 26, Re-us ran path O2 to 3.6 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1564302884554801224]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 27, Ahmer Raza ran path O3 to 4.4 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1564602113638531233]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 28, Ahmer Raza ran path O3 to 10&amp;lt;sup&amp;gt;12&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1564860941114544150]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 29, Re-us ran path O2 to 5 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1565282039547039851]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 30, Ahmer Raza ran path O1 and O2 to 747,242,483,684 and 731,899,010,932 iterations respectively, at which point they both halt!&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1565539982368706660]&amp;lt;/sup&amp;gt; These paths correspond to groups of machines with halting times of over 10&amp;lt;sup&amp;gt;263,165,730,000&amp;lt;/sup&amp;gt; and 10&amp;lt;sup&amp;gt;257,762,030,000&amp;lt;/sup&amp;gt; steps respectively.&lt;br /&gt;
*** On the same day, Ahmer Raza ran path O3 to 1,961,935,897,288 iterations, at which point it also halts!&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1565654168708841534]&amp;lt;/sup&amp;gt; This path corresponds to a group of machines with halting times of over 10&amp;lt;sup&amp;gt;690,959,520,000&amp;lt;/sup&amp;gt; steps. They also ran path O4 to 7.6 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations, and later 10&amp;lt;sup&amp;gt;12&amp;lt;/sup&amp;gt; iterations&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1565743330376159394]&amp;lt;/sup&amp;gt; without a halt.&lt;br /&gt;
*** On October 31, Ahmer Raza ran path O4 to 1.7 × 10&amp;lt;sup&amp;gt;12&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1566161389993599129]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 18, Ersen claimed to have used Claude to help run an independent (and currently ongoing) run of [[Antihydra]] to 2&amp;lt;sup&amp;gt;38&amp;lt;/sup&amp;gt; rule applications, seemingly verifying apgoucher&#039;s results.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1561480238586658867][https://discord.com/channels/960643023006490684/1026577255754903572/1271528180246773883]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[File:ZFC_Machine_254.png|alt=The transition table of a 254-state, 2-symbol Turing machine. The starting state, in the top left corner, has the rule 1LB0LC, and the halt transition occurs if the 78th state encounters a 1.|thumb|This month, Mira, using GPT-6 Astra, has claimed to have found this 254-state Turing machine that halts if, and only if, ZFC is inconsistent (Jeff Ketchersid has claimed to have proven this property using Claude Opus 5.5). The transition table of Mira&#039;s machine is shown in this image, with state 1 corresponding to the starting state.]]&lt;br /&gt;
* [[Cryptids#Larger Cryptids|Larger Cryptids]]&lt;br /&gt;
** [[Logical independence|Logical Independence]]&lt;br /&gt;
*** [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo-Frankel set theory]]&lt;br /&gt;
**** On October 6, Mira claimed to have used GPT-6 Astra to reduce their previous 256-state TM whose halting status is independent of ZFC, to a 254-state TM.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1557078543278678136]&amp;lt;/sup&amp;gt; They estimate that the Metamath formalization verifying that their previous 238-state TM is independent of Peano Arithmetic is roughly 70% complete, and the formalization verifying that their new 254-state ZFC-independent TM is roughly 40% complete.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1557065280004300913]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 10, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/7ba85376a9349d54e3460b46ed776df6e094c7dc/Cryptids/Zf393.lean formalize] the claims of the independence of Wade&#039;s 393-state TM&#039;s halting status from ZFC.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/7ba85376a9349d54e3460b46ed776df6e094c7dc#diff-b0e5d5e6cf367c2f1ba87f511ad05a12cee37dc578f5974b9e1b70e96bc11f8a]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 13, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/main/Cryptids/Zf380.lean formally] reduce Andrew Wade&#039;s 393-state ZFC-independent TM, to a 380-state TM.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/3f273d55d213d7676eb20ae0454acfa472ff4d5d]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On the same day, Jeff Ketchersid claimed to have used Claude Opus 5.5 to [https://github.com/jeff87654/busy-beaver/tree/main/ZF/verify/335 formally] reduce Andrew Wade&#039;s 393-state TM whose halting status is independent of ZFC, to a 335-state TM.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1559077555158392844]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 14, Jeff Ketchersid claimed to have used Claude Opus 5.5 to [https://github.com/jeff87654/busy-beaver/tree/zf-254/ZF/m254 prove] the independence of Mira&#039;s 254-state TM&#039;s halting status from ZFC.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1559799702776582244]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 18, Vladimir Reshetnikov claimed to have used Claude to reduce Mira&#039;s previous 254-state ZFC-independent TM, to a 246-state TM.&amp;lt;sup&amp;gt;[https://github.com/VladimirReshetnikov/ProveIt/commit/34f6b40a21305d4e1a6a36858aa7e5b9bebc03b9][https://github.com/VladimirReshetnikov/ProveIt/commit/8cdc55ff9281b0aaba49bf74b0b225d57f12b893]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 19, Kinata claimed to have used GPT-6 Astra&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1561712707860828261]&amp;lt;/sup&amp;gt; to [https://github.com/elliotglazer/k230-rocq/tree/main/coq formally] reduce Reshetnikov&#039;s previous 246-state ZFC-independent TM, to 230 states.&amp;lt;sup&amp;gt;[https://github.com/elliotglazer/k230-rocq/commit/088a8f2eb47b0dee9e7761cc49cd411157dd5e28][https://discord.com/channels/960643023006490684/1331570843829932063/1561712452679368824]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 20, Vladimir Reshetnikov claimed to have used Claude to [https://github.com/VladimirReshetnikov/ProveIt/tree/main/Computability/BusyBeaver/Research/ZFC/k225-formal/verification/k215/rocq formally] optimize their previous 246-state, ZFC-independent TM, to 215 states.&amp;lt;sup&amp;gt;[https://github.com/VladimirReshetnikov/ProveIt/commit/a61476422532a5d3b7dec11fc7a92751fe0d60f8]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** [[wikipedia:Peano_axioms|Peano Arithmetic]]&lt;br /&gt;
**** On October 15, Mira claimed to have used GPT-6 Astra to [https://github.com/jeff87654/busy-beaver/tree/main/PA/m238/coq prove] the independence of their 238-state PA-independent TM, building off of Jeff Ketchersid&#039;s proof of their ZFC-independent TM.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1560095900024442920]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 29, Discord user charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/PAK formally] reduce the number of defined instructions required in a PA-independent TM to 469 (470 including the halting transition).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1565325918896005130]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 30, Mira claimed to have found a 8,250,306-state TM that &amp;quot;ω-accepts&amp;quot; iff ZFC is ω-consistent. This condition presumably requires an ω-level oracle to determine.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1565752410956234844]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 31, Mira claimed to have found a 236-state TM that &amp;quot;ω-accepts&amp;quot; iff PA is ω-consistent.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1566168045343215777]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** [[wikipedia:Large_cardinal|Large Cardinal Axioms]]&lt;br /&gt;
**** On October 15, Jeff Ketchersid claimed to have used Claude Opus 5.5 to discover a 296-state TM whose halting status can be [https://github.com/jeff87654/busy-beaver/tree/main/ZF/tg296/coq proven] to be independent of ZFC + &amp;quot;Every set is contained in a Grothedieck universe&amp;quot;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/923f561312adaaad8bd0e6b20a1e17e5f0339d6d]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** Number Theory&lt;br /&gt;
*** [[wikipedia:Goldbach&#039;s_conjecture|Goldbach&#039;s Conjecture]]&lt;br /&gt;
**** On October 9, Google DeepMind claimed to have used Gemini 3.1 Pro to discover and [https://github.com/google-deepmind/cryptids/blob/c458ec7ae90f5603c35d1bd5534eb6fd4ac1bd58/Cryptids/Goldbach24.lean prove] the property of a 24-state TM that halts if and only if Goldbach&#039;s conjecture is false, improving on the previous smallest known machine with this property by one state.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/c458ec7ae90f5603c35d1bd5534eb6fd4ac1bd58]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 13, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/main/Cryptids/Goldbach21.lean formally] reduce the number of states required from 24 to 21.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/176e5f980ddc6e74f963b983e9d4ba7b28bacc26]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 25, Jeff Ketchersid claimed to have used Claude Opus 5.5 to discover and [https://github.com/jeff87654/busy-beaver/tree/main/PA/goldbach/coq prove] the property of a 449-state TM that halts if and only if Peano Arithmetic can prove Goldbach&#039;s conjecture.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1563983209744834570][https://github.com/jeff87654/busy-beaver/tree/main/PA/goldbach]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 31, Charlie used Claude to discover a BB(10,6) machine that halts if and only if Goldbach&#039;s conjecture is false, reducing the number of instructions from 41 to 34.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1566029907169910844]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** [[wikipedia:Riemann_hypothesis|Riemann Hypothesis]]&lt;br /&gt;
**** On October 10, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/7ba85376a9349d54e3460b46ed776df6e094c7dc/Cryptids/Riemann120.lean formalize] the claims of Shunia&#039;s 120-state TM&#039;s halting if and only if the Riemann hypothesis is false.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/7ba85376a9349d54e3460b46ed776df6e094c7dc#diff-c8f1a37032a46e9025c82851438f2d05a1ea34802d5a717c83eeb530a736014f]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 13, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/main/Cryptids/Riemann104.lean formally] reduce the number of states required for a specific TM to encode the truth value of the Riemann hypothesis from 120 to 104.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/468868ef0a7c82a667e8f8013eba19263e972811]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 19, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/main/Cryptids/Riemann95.lean formally] reduce the bound from 104 states to 95 states.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/bf17809905a1b9a514b0427e24290c7e860a649e]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** [https://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/ Weak Collatz Conjecture]&lt;br /&gt;
**** On October 18, charlie claimed to have used Claude to reduce the number of states required for a specific TM to encode the truth value of the Weak Collatz conjecture from 124 to 23.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1561339005432500386]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 20, Mira claimed to have used GPT-6 Astra&amp;lt;sup&amp;gt;[https://twitter.com/_Mira___Mira_/status/2112429878528324078]&amp;lt;/sup&amp;gt; to reduce the number of states required from 23 to 16.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1561995595848360066][https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On the same day, charlie claimed to have used Claude to reduce this bound to 14 states.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1562181014724546651][https://github.com/calr3/tinycryptids/blob/weakcollatz-14/weakcollatz/README.md]&amp;lt;/sup&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+Other problems encoded into Turing machines this month&lt;br /&gt;
!Conjecture&lt;br /&gt;
!Domain&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Discovery date&lt;br /&gt;
!Notes&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.jstor.org/stable/2689842 Erdős ternary conjecture]&lt;br /&gt;
|BB(14)&lt;br /&gt;
|[[User:Cosmo|Tristan Stérin]], GPT‑6&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;Astra&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1562203343114473472]&amp;lt;/sup&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1562205562798604390]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 20&lt;br /&gt;
|Probviously non-halting - halts iff the conjecture is false.&lt;br /&gt;
Reduces the previous known bound of BB(15).&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Fermat&#039;s_Last_Theorem|Fermat&#039;s Last Theorem]]&lt;br /&gt;
|BB(90)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1562937428678017055]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 22&lt;br /&gt;
|Non-halting. (if Wiles&#039;s proof is not assumed: Probviously non-halting - halts iff the theorem is false. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/Fermat Proof.])&lt;br /&gt;
Reduces the previous known bound of BB(400). The previous machine was a Cryptid at the time of construction (1965), whereas this one is not, as the theorem has sice been proven.&amp;lt;sup&amp;gt;[https://www.jstor.org/stable/2118559]&amp;lt;/sup&amp;gt; The proof of this machine&#039;s property, notably, does not rely on the theorem.&lt;br /&gt;
|-&lt;br /&gt;
|Erdős ternary conjecture variant&lt;br /&gt;
|BB(4,4)&lt;br /&gt;
|roromachine14, Gemini&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;4&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;Argon&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1563042146649382983]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 23&lt;br /&gt;
|Probviously non-halting - halts iff there exists an n &amp;gt; 0 such that 2&amp;lt;sup&amp;gt;n&amp;lt;/sup&amp;gt; - 1 does not contain a 1 in its ternary representation.&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Sierpiński_number#Smallest_Sierpi%C5%84ski_number|Smallest Sierpiński number]] &lt;br /&gt;
|BB(60)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1563258441055731712]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 23&lt;br /&gt;
|Unknown - halts iff 78,557 is the smallest Sierpiński number. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/Sierpinski Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Perfect_number#Odd_perfect_numbers|Odd perfect numbers]]&lt;br /&gt;
|BB(67)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1563258441055731712]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 23&lt;br /&gt;
|Probviously non-halting - halts iff an odd perfect number exists. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/OddPerfect Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Collatz_conjecture|Collatz conjecture]]&lt;br /&gt;
|BBB(17)&lt;br /&gt;
|Mira, GPT-6 Astra&amp;lt;sup&amp;gt;[https://twitter.com/_Mira___Mira_/status/2113850733326110966]&amp;lt;/sup&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1563419486055432192]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 24&lt;br /&gt;
|Probviously non-quasihalting - quasihalts iff the conjecture is false. [https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Twin_prime#Twin_prime_conjecture|Twin prime conjecture]]&lt;br /&gt;
|BBB(18)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1563635774178590750]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 25&lt;br /&gt;
|Probviously non-quasihalting - quasihalts iff the conjecture is false. [https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[oeis:A049782|Kurepa&#039;s conjecture]]&lt;br /&gt;
|BB(38)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1564196186192216166]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 26&lt;br /&gt;
|Unknown - halts iff the conjecture is false. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/Kurepa Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Fermat_number#Primality|Last Fermat prime]]&lt;br /&gt;
|BB(25)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1564553504364826627]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 27&lt;br /&gt;
|Probviously non-halting - halts iff 65,537 is not the last Fermat prime. [https://github.com/calr3/tinycryptids/tree/main/fermatprimes Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|Finite Fermat primes&lt;br /&gt;
|BBB(16)&lt;br /&gt;
|charlie, Claude&lt;br /&gt;
|October 27&lt;br /&gt;
|Probviously quasihalting - quasihalts iff there are finitely many Fermat primes. [https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM Proof.]&lt;br /&gt;
Announced along with the other Fermat prime-related machine.&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Abc_conjecture|abc conjecture]]&lt;br /&gt;
|BBBB(235)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1565097340560216205]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 28&lt;br /&gt;
|Probviously [[pseudoquasihalting]] - pseudoquasihalts iff the conjecture is &#039;&#039;true&#039;&#039;. [https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Wall–Sun–Sun_prime#Existence|Wall-Sun-Sun primes]]&lt;br /&gt;
|BB(50)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1565732795328766126]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 30&lt;br /&gt;
|Probviously halting - halts iff a Wall-Sun-Sun prime exists. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/WallSunSun2 Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|Finite Wall-Sun-Sun primes&lt;br /&gt;
|BBB(48)&lt;br /&gt;
|charlie, Claude&lt;br /&gt;
|October 30&lt;br /&gt;
|Probviously non-quasihalting - quasihalts iff there are finitely many Wall-Sun-Sun primes. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/WallSunSunInf Proof.]&lt;br /&gt;
Announced along with the other Wall-Sun-Sun prime-related machine.&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:P_versus_NP_problem|P = NP]]&lt;br /&gt;
|BBB(290)&lt;br /&gt;
|Mira, GPT-6.1 Terra&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1566167540445741147][https://twitter.com/_Mira___Mira_/status/2116578207210361277]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 31&lt;br /&gt;
|Unknown - quasihalts iff P = NP. Unformalized.&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Co-NP|NP = coNP]]&lt;br /&gt;
|BBB(284)&lt;br /&gt;
|Mira, GPT-6.1 Terra&lt;br /&gt;
|October 31&lt;br /&gt;
|Unknown - quasihalts iff NP = coNP. Unformalized.&lt;br /&gt;
Announced along with the P = NP machine.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Misc ==&lt;br /&gt;
&lt;br /&gt;
* On October 17, XnoobSpeakable began archiving messages of users who have consented to the archival project, as well as adding these archived messages to this wiki.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=1RB0LD_0RC0RE_1LC0LA_---1LE_0LF0RE_0RA0LE&amp;amp;diff=prev&amp;amp;oldid=9229]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On October 19, person89 began research for writing a book about the Busy Beaver function,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561880425914179634/1561880425914179634]&amp;lt;/sup&amp;gt; following a poll earlier that month.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1557640579007905853]&amp;lt;/sup&amp;gt; They plan to explain the function&#039;s history, how some values of the function were determined, the mechanisms behind deciders, the behaviors of special machines, and analogs to the function in other models of computation.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561880425914179634/1561880827959447582]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:This Month in Beaver Research|2026-10]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Main_Page&amp;diff=10636</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Main_Page&amp;diff=10636"/>
		<updated>2026-11-13T04:19:54Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* This Month in Beaver Research (TMBR) */ TYBR 2025 was released a while ago&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The [[Busy Beaver function]] BB (called &#039;&#039;S&#039;&#039; originally) was introduced by [[Tibor Radó]] in 1962 for 2-symbol [[Turing machines]] and later generalized to &#039;&#039;m&#039;&#039;-symbol Turing machines:&amp;lt;ref&amp;gt;Radó, T. (1962), On Non-Computable Functions. Bell System Technical Journal, 41: 877-884. https://doi.org/10.1002/j.1538-7305.1962.tb00480.x&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Brady, Allen H, and the Meaning of Life, &#039;The Busy Beaver Game and the Meaning of Life&#039;, in Rolf Herken (ed.), The Universal Turing Machine: A Half-Century Survey (Oxford, 1990; online edn, Oxford Academic, 31 Oct. 2023), https://doi.org/10.1093/oso/9780198537748.003.0009, accessed 8 June 2024.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
| BB(&#039;&#039;n&#039;&#039;, &#039;&#039;m&#039;&#039;) = Maximum number of steps taken by a halting &#039;&#039;n&#039;&#039;-state, &#039;&#039;m&#039;&#039;-symbol Turing machine starting from a blank (all 0) tape&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
The 2-symbol case BB(&#039;&#039;n&#039;&#039;, 2) is abbreviated as BB(&#039;&#039;n&#039;&#039;). The Busy Beaver function is not [[wikipedia:Computability|computable]], but a few of its values are known:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ Small busy beaver values (up to 7 states and symbols)&amp;lt;ref&amp;gt;P. Michel, &amp;quot;[https://bbchallenge.org/~pascal.michel/ha.html Historical survey of Busy Beavers]&amp;quot;.&amp;lt;/ref&amp;gt;&lt;br /&gt;
! !!2-state !!3-state !!4-state !!5-state !!6-state !!7-state&lt;br /&gt;
|-&lt;br /&gt;
!2-symbol&lt;br /&gt;
| [[BB(2)]] = 6&lt;br /&gt;
| [[BB(3)]] = 21&lt;br /&gt;
| [[BB(4)]] = 107&lt;br /&gt;
| [[BB(5)]] = 47,176,870&lt;br /&gt;
| style=&amp;quot;background: orange;&amp;quot; title=&amp;quot;Cryptids: Antihydra and some other cryptids&amp;quot; | [[BB(6)]] &amp;gt; &amp;lt;math&amp;gt;10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 8&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(7)]] &amp;gt; &amp;lt;math&amp;gt;3 \uparrow^{20} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
!3-symbol&lt;br /&gt;
| [[BB(2,3)]] = 38&lt;br /&gt;
| style=&amp;quot;background: orange;&amp;quot; title=&amp;quot;Cryptid: Bigfoot&amp;quot; | [[BB(3,3)]] &amp;lt;math&amp;gt;\ge&amp;lt;/math&amp;gt; 119,112,334,170,342,541&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(4,3)]] &amp;gt; &amp;lt;math&amp;gt;10 \uparrow^{4} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; |&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | BB(6,3) &amp;gt; &amp;lt;math&amp;gt; f_\omega^2(10\uparrow\uparrow\uparrow 6)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; |&lt;br /&gt;
|-&lt;br /&gt;
!4-symbol&lt;br /&gt;
| [[BB(2,4)]] = 3,932,964&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(3,4)]] &amp;gt; &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(4,4)]] &amp;gt; &amp;lt;math&amp;gt;2 \uparrow^{509} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | BB(5,4) &amp;gt; &amp;lt;math&amp;gt;f_\omega^3(2 \uparrow^{15} 5)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(6,4) &amp;gt; &amp;lt;math&amp;gt; f_{\omega+1}(10\uparrow\uparrow 65\,533)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; |BB(7,4) &amp;gt; &amp;lt;math&amp;gt; f_{\omega+3}(21)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
!5-symbol&lt;br /&gt;
| style=&amp;quot;background: orange;&amp;quot; title=&amp;quot;Cryptids: Hydra and Bonus Cryptid&amp;quot; | [[BB(2,5)]] &amp;gt; &amp;lt;math&amp;gt;10^{10^{10^{3\,314\,360}}}&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(3,5)]] &amp;gt; &amp;lt;math&amp;gt; f_\omega(2 \uparrow^{15} 5)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(4,5) &amp;gt; &amp;lt;math&amp;gt; f_{\omega+1}(27\,041)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; |BB(5,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega+1}(f_\omega^4(6))&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(6,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega+3}(11)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; |BB(7,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega+3}^2(10)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
!6-symbol&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(2,6)]] &amp;gt; &amp;lt;math&amp;gt;10 \uparrow \uparrow 10 \uparrow\uparrow 10^{10^{115}}&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | BB(3,6) &amp;gt; &amp;lt;math&amp;gt; f_\omega^3(15)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(4,6) &amp;gt; &amp;lt;math&amp;gt; f_{\omega+2}(29)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(5,6) &amp;gt; &amp;lt;math&amp;gt; f_{\omega+3}(31)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(6,6) &amp;gt; &amp;lt;math&amp;gt; f_{\omega \times 2}(89)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(7,6) &amp;gt; &amp;lt;math&amp;gt; f_{\omega^2}(110)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
!7-symbol&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(2,7)]] &amp;gt; &amp;lt;math&amp;gt;10 \uparrow \uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 155&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(3,7) &amp;gt; &amp;lt;math&amp;gt; f_{\omega+1}(117)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(4,7) &amp;gt; &amp;lt;math&amp;gt;f_{\omega+3}(34)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; |&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; |&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; |&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Table key:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;span style=&amp;quot;background: orange&amp;quot;&amp;gt;Orange cell&amp;lt;/span&amp;gt;: smallest known [[Cryptid]] (a mathematically-hard machine) is in this class&lt;br /&gt;
* &amp;lt;span style=&amp;quot;background: #ddc290&amp;quot;&amp;gt;Tan cell&amp;lt;/span&amp;gt;: a Cryptid is known using fewer states or symbols than this class.&lt;br /&gt;
* &amp;lt;span style=&amp;quot;background: yellow&amp;quot;&amp;gt;Yellow cell&amp;lt;/span&amp;gt;: the Busy Beaver number is known to be more than [[Graham&#039;s number]].&lt;br /&gt;
* Blank cell: no known champion that surpasses a champion with fewer states or symbols by a non-trivial amount.&lt;br /&gt;
&lt;br /&gt;
1-state domains and 1-symbol domains are omitted in the table as [[BB(1,m)]] = 1 and [[BB(n,1)]] = n.&lt;br /&gt;
&lt;br /&gt;
== About bbchallenge ==&lt;br /&gt;
[[bbchallenge]] is a massively collaborative research project whose general goal is to obtain more knowledge on the [[Busy Beaver function]]. In practice, it mainly consists in collaboratively building [[Deciders]], programs that automatically prove that some Turing machines do not halt. Other efforts also include:&lt;br /&gt;
&lt;br /&gt;
* Formalizing results using theorem provers (such as [https://en.wikipedia.org/wiki/Rocq Rocq])&lt;br /&gt;
* Maintaining [[Holdouts lists]] for small busy beaver values&lt;br /&gt;
* [[Analysis Tools and Techniques|Proving]] the behavior of [[:Category:Individual Machines|Individual machines]]&lt;br /&gt;
* Finding [[Cryptids]] (mathematically-hard machines)&lt;br /&gt;
* Searching for new [[Champions]]&lt;br /&gt;
* Building [[Accelerated Simulator|Accelerated simulator]]s to simulate halting machines faster&lt;br /&gt;
* Writing papers and giving talks about the Busy Beaver function, see [[Papers &amp;amp; Talks]]&lt;br /&gt;
* Exploring different [[:Category:Functions|Busy Beaver-style functions]] built from different systems of computation&lt;br /&gt;
&lt;br /&gt;
In June 2024, bbchallenge achieved a significant milestone by proving in [https://en.wikipedia.org/wiki/Rocq Rocq] (previously known as Coq) that the 5th busy beaver value, [[BB(5)]], is equal to the lower bound found in 1989: 47,176,870.&amp;lt;ref&amp;gt;H. Marxen and J. Buntrock. Attacking the Busy Beaver 5.&lt;br /&gt;
Bulletin of the EATCS, 40, pages 247-251, February 1990. https://turbotm.de/~heiner/BB/mabu90.html&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== This Month in Beaver Research (TMBR) ==&lt;br /&gt;
[[:Category:This Month in Beaver Research|This Month in Beaver Research]] (TMBR, pronounced &amp;quot;timber&amp;quot;) is a monthly summary of Busy Beaver research progress. Here are the three most recent released entries:&lt;br /&gt;
&lt;br /&gt;
* [[TMBR: August 2026]]&lt;br /&gt;
* [[TMBR: June 2026]]&lt;br /&gt;
* [[TMBR: May 2026]]&lt;br /&gt;
&lt;br /&gt;
[[TMBR: July 2026]], [[TMBR: September 2026]], [[TMBR: October 2026]], and [[TMBR: November 2026]] are currently works in progress.&lt;br /&gt;
&lt;br /&gt;
This Year in Beaver Research (TYBR) is a yearly summary of Busy Beaver research progress. Its first edition is [[TYBR: 2025]].&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Main_Page&amp;diff=10635</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Main_Page&amp;diff=10635"/>
		<updated>2026-11-13T04:18:58Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* This Month in Beaver Research (TMBR) */ Update released TMBR&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The [[Busy Beaver function]] BB (called &#039;&#039;S&#039;&#039; originally) was introduced by [[Tibor Radó]] in 1962 for 2-symbol [[Turing machines]] and later generalized to &#039;&#039;m&#039;&#039;-symbol Turing machines:&amp;lt;ref&amp;gt;Radó, T. (1962), On Non-Computable Functions. Bell System Technical Journal, 41: 877-884. https://doi.org/10.1002/j.1538-7305.1962.tb00480.x&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Brady, Allen H, and the Meaning of Life, &#039;The Busy Beaver Game and the Meaning of Life&#039;, in Rolf Herken (ed.), The Universal Turing Machine: A Half-Century Survey (Oxford, 1990; online edn, Oxford Academic, 31 Oct. 2023), https://doi.org/10.1093/oso/9780198537748.003.0009, accessed 8 June 2024.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
| BB(&#039;&#039;n&#039;&#039;, &#039;&#039;m&#039;&#039;) = Maximum number of steps taken by a halting &#039;&#039;n&#039;&#039;-state, &#039;&#039;m&#039;&#039;-symbol Turing machine starting from a blank (all 0) tape&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
The 2-symbol case BB(&#039;&#039;n&#039;&#039;, 2) is abbreviated as BB(&#039;&#039;n&#039;&#039;). The Busy Beaver function is not [[wikipedia:Computability|computable]], but a few of its values are known:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ Small busy beaver values (up to 7 states and symbols)&amp;lt;ref&amp;gt;P. Michel, &amp;quot;[https://bbchallenge.org/~pascal.michel/ha.html Historical survey of Busy Beavers]&amp;quot;.&amp;lt;/ref&amp;gt;&lt;br /&gt;
! !!2-state !!3-state !!4-state !!5-state !!6-state !!7-state&lt;br /&gt;
|-&lt;br /&gt;
!2-symbol&lt;br /&gt;
| [[BB(2)]] = 6&lt;br /&gt;
| [[BB(3)]] = 21&lt;br /&gt;
| [[BB(4)]] = 107&lt;br /&gt;
| [[BB(5)]] = 47,176,870&lt;br /&gt;
| style=&amp;quot;background: orange;&amp;quot; title=&amp;quot;Cryptids: Antihydra and some other cryptids&amp;quot; | [[BB(6)]] &amp;gt; &amp;lt;math&amp;gt;10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 8&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(7)]] &amp;gt; &amp;lt;math&amp;gt;3 \uparrow^{20} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
!3-symbol&lt;br /&gt;
| [[BB(2,3)]] = 38&lt;br /&gt;
| style=&amp;quot;background: orange;&amp;quot; title=&amp;quot;Cryptid: Bigfoot&amp;quot; | [[BB(3,3)]] &amp;lt;math&amp;gt;\ge&amp;lt;/math&amp;gt; 119,112,334,170,342,541&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(4,3)]] &amp;gt; &amp;lt;math&amp;gt;10 \uparrow^{4} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; |&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | BB(6,3) &amp;gt; &amp;lt;math&amp;gt; f_\omega^2(10\uparrow\uparrow\uparrow 6)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; |&lt;br /&gt;
|-&lt;br /&gt;
!4-symbol&lt;br /&gt;
| [[BB(2,4)]] = 3,932,964&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(3,4)]] &amp;gt; &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(4,4)]] &amp;gt; &amp;lt;math&amp;gt;2 \uparrow^{509} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | BB(5,4) &amp;gt; &amp;lt;math&amp;gt;f_\omega^3(2 \uparrow^{15} 5)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(6,4) &amp;gt; &amp;lt;math&amp;gt; f_{\omega+1}(10\uparrow\uparrow 65\,533)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; |BB(7,4) &amp;gt; &amp;lt;math&amp;gt; f_{\omega+3}(21)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
!5-symbol&lt;br /&gt;
| style=&amp;quot;background: orange;&amp;quot; title=&amp;quot;Cryptids: Hydra and Bonus Cryptid&amp;quot; | [[BB(2,5)]] &amp;gt; &amp;lt;math&amp;gt;10^{10^{10^{3\,314\,360}}}&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(3,5)]] &amp;gt; &amp;lt;math&amp;gt; f_\omega(2 \uparrow^{15} 5)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(4,5) &amp;gt; &amp;lt;math&amp;gt; f_{\omega+1}(27\,041)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; |BB(5,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega+1}(f_\omega^4(6))&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(6,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega+3}(11)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; |BB(7,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega+3}^2(10)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
!6-symbol&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(2,6)]] &amp;gt; &amp;lt;math&amp;gt;10 \uparrow \uparrow 10 \uparrow\uparrow 10^{10^{115}}&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | BB(3,6) &amp;gt; &amp;lt;math&amp;gt; f_\omega^3(15)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(4,6) &amp;gt; &amp;lt;math&amp;gt; f_{\omega+2}(29)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(5,6) &amp;gt; &amp;lt;math&amp;gt; f_{\omega+3}(31)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(6,6) &amp;gt; &amp;lt;math&amp;gt; f_{\omega \times 2}(89)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(7,6) &amp;gt; &amp;lt;math&amp;gt; f_{\omega^2}(110)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
!7-symbol&lt;br /&gt;
| style=&amp;quot;background: #ddc290;&amp;quot; | [[BB(2,7)]] &amp;gt; &amp;lt;math&amp;gt;10 \uparrow \uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 155&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(3,7) &amp;gt; &amp;lt;math&amp;gt; f_{\omega+1}(117)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; | BB(4,7) &amp;gt; &amp;lt;math&amp;gt;f_{\omega+3}(34)&amp;lt;/math&amp;gt;&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; |&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; |&lt;br /&gt;
| style=&amp;quot;background: yellow;&amp;quot; |&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Table key:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;span style=&amp;quot;background: orange&amp;quot;&amp;gt;Orange cell&amp;lt;/span&amp;gt;: smallest known [[Cryptid]] (a mathematically-hard machine) is in this class&lt;br /&gt;
* &amp;lt;span style=&amp;quot;background: #ddc290&amp;quot;&amp;gt;Tan cell&amp;lt;/span&amp;gt;: a Cryptid is known using fewer states or symbols than this class.&lt;br /&gt;
* &amp;lt;span style=&amp;quot;background: yellow&amp;quot;&amp;gt;Yellow cell&amp;lt;/span&amp;gt;: the Busy Beaver number is known to be more than [[Graham&#039;s number]].&lt;br /&gt;
* Blank cell: no known champion that surpasses a champion with fewer states or symbols by a non-trivial amount.&lt;br /&gt;
&lt;br /&gt;
1-state domains and 1-symbol domains are omitted in the table as [[BB(1,m)]] = 1 and [[BB(n,1)]] = n.&lt;br /&gt;
&lt;br /&gt;
== About bbchallenge ==&lt;br /&gt;
[[bbchallenge]] is a massively collaborative research project whose general goal is to obtain more knowledge on the [[Busy Beaver function]]. In practice, it mainly consists in collaboratively building [[Deciders]], programs that automatically prove that some Turing machines do not halt. Other efforts also include:&lt;br /&gt;
&lt;br /&gt;
* Formalizing results using theorem provers (such as [https://en.wikipedia.org/wiki/Rocq Rocq])&lt;br /&gt;
* Maintaining [[Holdouts lists]] for small busy beaver values&lt;br /&gt;
* [[Analysis Tools and Techniques|Proving]] the behavior of [[:Category:Individual Machines|Individual machines]]&lt;br /&gt;
* Finding [[Cryptids]] (mathematically-hard machines)&lt;br /&gt;
* Searching for new [[Champions]]&lt;br /&gt;
* Building [[Accelerated Simulator|Accelerated simulator]]s to simulate halting machines faster&lt;br /&gt;
* Writing papers and giving talks about the Busy Beaver function, see [[Papers &amp;amp; Talks]]&lt;br /&gt;
* Exploring different [[:Category:Functions|Busy Beaver-style functions]] built from different systems of computation&lt;br /&gt;
&lt;br /&gt;
In June 2024, bbchallenge achieved a significant milestone by proving in [https://en.wikipedia.org/wiki/Rocq Rocq] (previously known as Coq) that the 5th busy beaver value, [[BB(5)]], is equal to the lower bound found in 1989: 47,176,870.&amp;lt;ref&amp;gt;H. Marxen and J. Buntrock. Attacking the Busy Beaver 5.&lt;br /&gt;
Bulletin of the EATCS, 40, pages 247-251, February 1990. https://turbotm.de/~heiner/BB/mabu90.html&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== This Month in Beaver Research (TMBR) ==&lt;br /&gt;
[[:Category:This Month in Beaver Research|This Month in Beaver Research]] (TMBR, pronounced &amp;quot;timber&amp;quot;) is a monthly summary of Busy Beaver research progress. Here are the three most recent released entries:&lt;br /&gt;
&lt;br /&gt;
* [[TMBR: August 2026]]&lt;br /&gt;
* [[TMBR: June 2026]]&lt;br /&gt;
* [[TMBR: May 2026]]&lt;br /&gt;
&lt;br /&gt;
[[TMBR: July 2026]], [[TMBR: September 2026]], [[TMBR: October 2026]], and [[TMBR: November 2026]] are currently works in progress.&lt;br /&gt;
&lt;br /&gt;
This Year in Beaver Research (TYBR) is a yearly summary of Busy Beaver research progress. Its first edition, [[TYBR: 2025]] is currently a work in progress.&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Register_machine&amp;diff=10634</id>
		<title>Register machine</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Register_machine&amp;diff=10634"/>
		<updated>2026-11-13T04:17:51Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* MBB(8): Achilles and Patroclus */ Link to naming post&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Register machines&#039;&#039;&#039;, also known as &#039;&#039;&#039;Minsky machines&#039;&#039;&#039;, are a [[Turing complete|Turing-complete]] model of computation.&lt;br /&gt;
&lt;br /&gt;
Register machines contain a set of instructions and a set of registers. The instructions are labelled A, B, C, and so on. The registers are numbered 0, 1, 2, and so on. There are 2 types of instructions:&lt;br /&gt;
&lt;br /&gt;
* inc(c, n) adds 1 to the register c then jumps to instruction n.&lt;br /&gt;
* dec(c, n, m) jumps to instruction m if register c equals 0, else subtract 1 to the register c then jump to instruction n.&lt;br /&gt;
&lt;br /&gt;
The program halts if it reaches an undefined instruction. Here we label an undefined instruction with &amp;lt;code&amp;gt;*&amp;lt;/code&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
== Register Busy Beaver ==&lt;br /&gt;
The Register Busy Beaver function, denoted MBB(n,r), returns the maximum number of instructions executed by a register machine with n instructions and r registers when started in instruction A and all registers initialized to 0. MBB(n) = MBB(n,n) (unlimited registers).&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Halting Time&lt;br /&gt;
!Champion&lt;br /&gt;
|-&lt;br /&gt;
|MBB(0)&lt;br /&gt;
|0&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|MBB(1)&lt;br /&gt;
|1&lt;br /&gt;
|&amp;lt;code&amp;gt;0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(2)&lt;br /&gt;
|3&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(3)&lt;br /&gt;
|5&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0-C*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(4)&lt;br /&gt;
|10&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1+C_0-BD_1-C*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(5)&lt;br /&gt;
|24&lt;br /&gt;
|&amp;lt;code&amp;gt;0-DB_0+C_1-ED_1+A_1-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(6)&lt;br /&gt;
|49&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1-FC_1+D_0-CE_0+A_1-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(7)&lt;br /&gt;
|231&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+D_1-GE_1+F_0-EC_1-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(8)&lt;br /&gt;
|≥ 3,394&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_1-GD_1+E_0-DF_2-HG_2+A_2-D*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(9)&lt;br /&gt;
|&amp;gt; 4.493 × 10&amp;lt;sup&amp;gt;74&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_1-HD_0-EG_0-FI_1+D_2+H_0+A_2-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(10)&lt;br /&gt;
|&amp;gt; 10↑↑4.03&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1-AC_2-ED_1+E_1+F_0-DG_2-JH_2+I_1-HE_2-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(11)&lt;br /&gt;
|&amp;gt; 10↑↑17.74&lt;br /&gt;
|&amp;lt;code&amp;gt;0-KB_1-IC_1+D_1+E_2-CF_0-AG_0+H_1-GI_2+J_2+B_0-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
The Register Sigma function, denoted MΣ(n,r), returns the maximum value in any register when a register machine with n instructions and r registers halting when started in instruction A and all registers initialized to 0. MΣ(n) = MΣ(n,n) (unlimited registers) = [[oeis:A081419|A081419]](n+1).&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Sigma&lt;br /&gt;
!Champion&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(0)&lt;br /&gt;
|0&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(1)&lt;br /&gt;
|1&lt;br /&gt;
|&amp;lt;code&amp;gt;0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(2)&lt;br /&gt;
|2&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(3)&lt;br /&gt;
|3&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(4)&lt;br /&gt;
|4&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+D_0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(5)&lt;br /&gt;
|6&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+D_1-*E_1+A&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(6)&lt;br /&gt;
|9&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_1+D_1+E_1+F_0-C*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(7)&lt;br /&gt;
|34&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+D_1-GE_1+F_0-EC_1-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(8)&lt;br /&gt;
|≥ 520&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1+C_2-AD_2+E_2+F_0-DG_1-H*_1-EB&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(9)&lt;br /&gt;
|&amp;gt; 2.64 × 10&amp;lt;sup&amp;gt;73&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_1-HD_0-EG_0-FI_1+D_2+H_0+A_2-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(10)&lt;br /&gt;
|&amp;gt; 10↑↑4.03&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1-AC_2-ED_1+E_1+F_0-DG_2-JH_2+I_1-HE_2-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(11)&lt;br /&gt;
|&amp;gt; 10↑↑17.74&lt;br /&gt;
|&amp;lt;code&amp;gt;0-KB_1-IC_1+D_1+E_2-CF_0-AG_0+H_1-GI_2+J_2+B_0-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Analysis ==&lt;br /&gt;
MBB(7):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(x) = A:[x, 0]&lt;br /&gt;
A(2x) -&amp;gt; 9x+20 -&amp;gt; A(3x+4)&lt;br /&gt;
A(2x+1) -&amp;gt; 9x+27 -&amp;gt; halt&lt;br /&gt;
&lt;br /&gt;
A(0) -&amp;gt; 20 -&amp;gt; A(4) -&amp;gt; 38 -&amp;gt; A(10) -&amp;gt; 65 -&amp;gt; A(19) -&amp;gt; 108 -&amp;gt; halt&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(8):&lt;br /&gt;
&amp;lt;pre&amp;gt;Let S(z) = F:[0, 2z+1, z]&lt;br /&gt;
S(2k) -&amp;gt; 44k+19 -&amp;gt; S(5k+2)&lt;br /&gt;
S(2k+1) -&amp;gt; 4k+2 -&amp;gt; halt&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] -&amp;gt; 44 -&amp;gt; S(4) -&amp;gt; 107 -&amp;gt; S(12) -&amp;gt; 283 -&amp;gt; S(32) -&amp;gt; 723 -&amp;gt;  S(82) -&amp;gt; 1823 -&amp;gt; S(207) -&amp;gt; 414 -&amp;gt; halt&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(9):&lt;br /&gt;
&amp;lt;pre&amp;gt;Let A(x, y) = D:[x, 0, y]&lt;br /&gt;
A(2k, y) --(7k + 6)--&amp;gt; A(3k + 3, y + 1)&lt;br /&gt;
A(2k + 1, y + 1) --(7k + 5)--&amp;gt; A(3k + 1, y)&lt;br /&gt;
A(2k + 1, 0) --(3k + 3)--&amp;gt; *:[0, k, 0]&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0]&lt;br /&gt;
--(3)--&amp;gt; A(2, 0)&lt;br /&gt;
--(13)--&amp;gt; A(6, 1)&lt;br /&gt;
--(27)--&amp;gt; A(12, 2)&lt;br /&gt;
...&lt;br /&gt;
--(2753550047052785432549)--&amp;gt; A(1180092877308336613950, 31)&lt;br /&gt;
--(4130325070579178148831)--&amp;gt; A(1770139315962504920928, 32)&lt;br /&gt;
--(6195487605868767223254)--&amp;gt; A(2655208973943757381395, 33)&lt;br /&gt;
...&lt;br /&gt;
--(123361440505394191838159894807429323394336791980165278392551786831696080997)--&amp;gt; A(52869188788026082216354240631755424311858625134356547882522194356441177569, 0)&lt;br /&gt;
--(79303783182039123324531360947633136467787937701534821823783291534661766355)--&amp;gt; *[0, 26434594394013041108177120315877712155929312567178273941261097178220588784, 0]&lt;br /&gt;
MBB(9) ≥ 449388104698221698839011045369921106650798313642030657001438652029750007257&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(10):&lt;br /&gt;
&amp;lt;pre&amp;gt;Let A(x) = E:[0, 0, x]&lt;br /&gt;
A(3k) --(28 × 2^k - 5k - 21)--&amp;gt; A(4 × 2^k - 2)&lt;br /&gt;
A(3k + 1) --(20 × 2^k - 5k - 16)--&amp;gt; *:[0, 4 × 2^k - 3, 0]&lt;br /&gt;
A(3k + 2) --(56 × 2^k - 5k - 23)--&amp;gt; A(8 × 2^k - 1)&lt;br /&gt;
&lt;br /&gt;
Let t3 = 2^5864062014807&lt;br /&gt;
Let t4 = 2^((t3 + 4) / 3)&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0]&lt;br /&gt;
--(20)--&amp;gt; A(5)&lt;br /&gt;
--(84)--&amp;gt; A(15)&lt;br /&gt;
--(850)--&amp;gt; A(126)&lt;br /&gt;
--(123145302310681)--&amp;gt; A(17592186044414)&lt;br /&gt;
--(7 × t3 - 29320310074043)--&amp;gt; A(t3 - 1)&lt;br /&gt;
--(5 × t4 - 5 / 3 × t3 - 38 / 3)--&amp;gt; *:[0, t4 - 3, 0]&lt;br /&gt;
MBB(10) ≥ 5 × t4 + 16 / 3 × t3 + 281474976712738 / 3 &amp;gt; 10^^4.03&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(11):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(x) = I:[x, 0, 0]&lt;br /&gt;
A(3k) --&amp;gt; A((20 * 4^k + 1)/3) if k ≥ 1&lt;br /&gt;
A(3k + 1) --&amp;gt; A((80 * 4^k + 1)/3) if k ≥ 1&lt;br /&gt;
A(3k + 2) --&amp;gt; *:[0, (20 * 4^k - 2)/3, 0] if k ≥ 1&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] --(140)--&amp;gt; A(27)&lt;br /&gt;
--&amp;gt; A((20 * 4^9 + 1) / 3) = A(1747627)&lt;br /&gt;
--&amp;gt; A((80 * 4^582542 + 1) / 3) ≡ A(4897384) mod 3^15&lt;br /&gt;
--&amp;gt; A((80 * 4^1632461 + 1) / 3) ≡ A(2637523) mod 3^14&lt;br /&gt;
--&amp;gt; A((80 * 4^879174 + 1) / 3) ≡ A(813591) mod 3^13&lt;br /&gt;
--&amp;gt; A((20 * 4^271197 + 1) / 3) ≡ A(72385) mod 3^12&lt;br /&gt;
--&amp;gt; A((80 * 4^24128 + 1) / 3) ≡ A(84526) mod 3^11&lt;br /&gt;
--&amp;gt; A((80 * 4^28175 + 1) / 3) ≡ A(35479) mod 3^10&lt;br /&gt;
--&amp;gt; A((80 * 4^11826 + 1) / 3) ≡ A(14202) mod 3^9&lt;br /&gt;
--&amp;gt; A((20 * 4^4734 + 1) / 3) ≡ A(268) mod 3^8&lt;br /&gt;
--&amp;gt; A((80 * 4^89 + 1) / 3) ≡ A(2077) mod 3^7&lt;br /&gt;
--&amp;gt; A((80 * 4^692 + 1) / 3) ≡ A(394) mod 3^6&lt;br /&gt;
--&amp;gt; A((80 * 4^131 + 1) / 3) ≡ A(235) mod 3^5&lt;br /&gt;
--&amp;gt; A((80 * 4^78 + 1) / 3) ≡ A(21) mod 3^4&lt;br /&gt;
--&amp;gt; A((20 * 4^7 + 1) / 3) ≡ A(12) mod 3^3&lt;br /&gt;
--&amp;gt; A((20 * 4^4 + 1) / 3) ≡ A(6) mod 3^2&lt;br /&gt;
--&amp;gt; A((20 * 4^2 + 1) / 3) ≡ A(2) mod 3^1&lt;br /&gt;
--&amp;gt; *:[0, (20 * 4^0 - 2) / 3, 0] ≡ *:[0, 0, 0] mod 3^0&lt;br /&gt;
MBB(11) &amp;gt; 10^^17.74&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
&lt;br /&gt;
=== &#039;&#039;&#039;Cryptids in the Wild&#039;&#039;&#039; ===&lt;br /&gt;
These cryptids were discovered through exhaustive enumeration of a domain, rather than being constructed by hand.&lt;br /&gt;
&lt;br /&gt;
==== MBB(8): Achilles and Patroclus ====&lt;br /&gt;
Through the exhaustive search of the MBB(8) domain, all eight instruction machines have either been decided, or are equivalent to one of the two following potential [[cryptids]]: Achilles (&amp;lt;code&amp;gt;0+B_1+C_2-AD_1-EH_2+F_1-DG_0-EB_2-C*&amp;lt;/code&amp;gt;) and Patroclus (&amp;lt;code&amp;gt;0+B_1-FC_2-GD_0-EF_1+C_2+A_2-EH_1-B*&amp;lt;/code&amp;gt;), which may each be interpreted in the following ways:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Achilles: 0+B_1+C_2-AD_1-EH_2+F_1-DG_0-EB_2-C*&lt;br /&gt;
&lt;br /&gt;
Let A(x, y) = D:[x, y, 0]&lt;br /&gt;
A(x, 0) --(2)--&amp;gt; *:[x, 0, 0]&lt;br /&gt;
A(x, 2k + 1) --(6x + 6k + 9)--&amp;gt; A(x + k + 1, x + k + 2)&lt;br /&gt;
A(x, 2k + 2) --(6k + 6)--&amp;gt; A(x + k, k)&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] --(3)--&amp;gt; A(1, 1)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Needle rules:&lt;br /&gt;
Let C(x + 3) = A(x, x + 1) = D:[x, x + 1, 0].&lt;br /&gt;
Let a and b be non-negative integers satisfying x = (2a + 1) * 2^b.&lt;br /&gt;
C(x) --&amp;gt; C(2x - a - 2b - 1) if a &amp;gt; 0&lt;br /&gt;
C(x) --&amp;gt; *:[2x - 2b - 3, 0, 0] if a = 0&lt;br /&gt;
&lt;br /&gt;
START: C(5)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Patroclus: 0+B_1-FC_2-GD_0-EF_1+C_2+A_2-EH_1-B*&lt;br /&gt;
&lt;br /&gt;
Let A(x, y) = C:[x, 0, y]&lt;br /&gt;
A(x, 2k) --(6x + 6k + 5)--&amp;gt; A(x + k + 1, x + k + 1)&lt;br /&gt;
A(x, 2k + 3) --(6k + 7)--&amp;gt; A(x + k, k)&lt;br /&gt;
A(x, 1) --(3)--&amp;gt; *:[x, 0, 0]&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] --(2)--&amp;gt; A(1, 0)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Needle rules:&lt;br /&gt;
Let C(x + 3) = A(x, x) = C:[x, 0, x].&lt;br /&gt;
Let a and b be non-negative integers satisfying x = (2a + 1) * 2^b.&lt;br /&gt;
C(x) --&amp;gt; C(2x - a - 3b - 1) if a &amp;gt; 0&lt;br /&gt;
C(x) --&amp;gt; *:[2x - 3b - 1, 0, 0] if a = 0&lt;br /&gt;
&lt;br /&gt;
START: C(5)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
They are similar to the [[BB(6)]] cryptid [[Space Needle]], which is also the [[Beaver Math Olympiad#Unsolved problems|BMO&#039;s]] 6th problem.&lt;br /&gt;
&lt;br /&gt;
These were found by Shawn Ligocki as the only 6 remaining 8-instruction holdouts on 2 Oct 2026 with an initial analysis of &amp;lt;code&amp;gt;0+B_1-GC_2-AD_1+E_2+F_0-DB_1-AH_0-F*&amp;lt;/code&amp;gt; .&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555767330531967099]&amp;lt;/sup&amp;gt; Sheep noticed the connection to Space Needle,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555825617197342816]&amp;lt;/sup&amp;gt; analyzed all 6 holdouts and discovered that they can be reduced down to just two behaviors (listed above)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555896809208156202]&amp;lt;/sup&amp;gt; and named them.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1567887303014223883]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Larger Cryptids ===&lt;br /&gt;
These cryptids were constructed by hand, translating a previously known Cryptid-like mechanism into a register machine. Note that this does not include Rick Griffith&#039;s 85-instruction, 16-register machine which would have halted had Fermat&#039;s Last Theorem turned out to be false,&amp;lt;sup&amp;gt;[https://web.archive.org/web/20120612014351/http://www.cantabgold.net/users/m.y.becker.98/part2projects/rickdissertation.zip]&amp;lt;/sup&amp;gt; as the theorem had already been proven true&amp;lt;sup&amp;gt;[https://www.jstor.org/stable/2118559]&amp;lt;/sup&amp;gt; by the time Griffith&#039;s machine was constructed (2003).&lt;br /&gt;
&lt;br /&gt;
==== MBB(10): Hydra ====&lt;br /&gt;
[[Hydra]] was hand coded into a 10-instruction, 3-register register machine: &amp;lt;code&amp;gt;0-BF_1+C_1+D_0-EH_1+A_2+G_2+I_2-I*_0+J_1-IA&amp;lt;/code&amp;gt; which can be interpreted the following way:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1446694179337011325]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let S(h,w) = A:[h-3,0,w]&lt;br /&gt;
&lt;br /&gt;
Start: A:[0,0,0] = S(3,0)&lt;br /&gt;
S(2k,0) = A:[2k-3,0,0] -&amp;gt; Halt&lt;br /&gt;
S(2k,w+1) = A:[2k-3,0,w+1] -&amp;gt; A:[3k-3,0,w] = S(3k,w)&lt;br /&gt;
S(2k+1,w) = A:[2k-2,0,w] -&amp;gt; A:[3k-2,0,w+2] = S(3k+1,w+2)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== MBB(12,2): Convergence of 7 under the 5n + 1 map ====&lt;br /&gt;
The 5n + 1 map has also been hand coded into a 12-instruction, 2-register machine: &amp;lt;code&amp;gt;0+B_0+C_0+D_0+E_1-IF_1+G_0-HE_0-FJ_0+A_1-KL_0+J_0-H*&amp;lt;/code&amp;gt; which can be interpreted the following way:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555083694937604097]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
0+B_0+C_0+D_0+E_1-IF_1+G_0-HE_0-FJ_0+A_1-KL_0+J_0-H*&lt;br /&gt;
&lt;br /&gt;
Let A(x + 3) = F:[x, 0]&lt;br /&gt;
Assume x &amp;gt; 0.&lt;br /&gt;
A(4) --(10)--&amp;gt; *:[0, 0]&lt;br /&gt;
A(2k) --(5k - 2)--&amp;gt; A(k)&lt;br /&gt;
A(2k + 1) --(9k)--&amp;gt; A(5k + 3)&lt;br /&gt;
 &lt;br /&gt;
A:[0, 0] --(5)--&amp;gt; A(7)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== MBB(130): Riemann Hypothesis ====&lt;br /&gt;
The Riemann Hypothesis has been coded into a 130-instruction, 29-register machine.&amp;lt;sup&amp;gt;[https://www.sciencedirect.com/science/article/pii/S0304397519304633]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[Category:functions]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Register_machine&amp;diff=10633</id>
		<title>Register machine</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Register_machine&amp;diff=10633"/>
		<updated>2026-11-13T04:16:49Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Cryptids */ Listed names for Achilles and Patroclus&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Register machines&#039;&#039;&#039;, also known as &#039;&#039;&#039;Minsky machines&#039;&#039;&#039;, are a [[Turing complete|Turing-complete]] model of computation.&lt;br /&gt;
&lt;br /&gt;
Register machines contain a set of instructions and a set of registers. The instructions are labelled A, B, C, and so on. The registers are numbered 0, 1, 2, and so on. There are 2 types of instructions:&lt;br /&gt;
&lt;br /&gt;
* inc(c, n) adds 1 to the register c then jumps to instruction n.&lt;br /&gt;
* dec(c, n, m) jumps to instruction m if register c equals 0, else subtract 1 to the register c then jump to instruction n.&lt;br /&gt;
&lt;br /&gt;
The program halts if it reaches an undefined instruction. Here we label an undefined instruction with &amp;lt;code&amp;gt;*&amp;lt;/code&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
== Register Busy Beaver ==&lt;br /&gt;
The Register Busy Beaver function, denoted MBB(n,r), returns the maximum number of instructions executed by a register machine with n instructions and r registers when started in instruction A and all registers initialized to 0. MBB(n) = MBB(n,n) (unlimited registers).&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Halting Time&lt;br /&gt;
!Champion&lt;br /&gt;
|-&lt;br /&gt;
|MBB(0)&lt;br /&gt;
|0&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|MBB(1)&lt;br /&gt;
|1&lt;br /&gt;
|&amp;lt;code&amp;gt;0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(2)&lt;br /&gt;
|3&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(3)&lt;br /&gt;
|5&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0-C*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(4)&lt;br /&gt;
|10&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1+C_0-BD_1-C*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(5)&lt;br /&gt;
|24&lt;br /&gt;
|&amp;lt;code&amp;gt;0-DB_0+C_1-ED_1+A_1-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(6)&lt;br /&gt;
|49&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1-FC_1+D_0-CE_0+A_1-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(7)&lt;br /&gt;
|231&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+D_1-GE_1+F_0-EC_1-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(8)&lt;br /&gt;
|≥ 3,394&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_1-GD_1+E_0-DF_2-HG_2+A_2-D*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(9)&lt;br /&gt;
|&amp;gt; 4.493 × 10&amp;lt;sup&amp;gt;74&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_1-HD_0-EG_0-FI_1+D_2+H_0+A_2-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(10)&lt;br /&gt;
|&amp;gt; 10↑↑4.03&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1-AC_2-ED_1+E_1+F_0-DG_2-JH_2+I_1-HE_2-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(11)&lt;br /&gt;
|&amp;gt; 10↑↑17.74&lt;br /&gt;
|&amp;lt;code&amp;gt;0-KB_1-IC_1+D_1+E_2-CF_0-AG_0+H_1-GI_2+J_2+B_0-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
The Register Sigma function, denoted MΣ(n,r), returns the maximum value in any register when a register machine with n instructions and r registers halting when started in instruction A and all registers initialized to 0. MΣ(n) = MΣ(n,n) (unlimited registers) = [[oeis:A081419|A081419]](n+1).&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Sigma&lt;br /&gt;
!Champion&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(0)&lt;br /&gt;
|0&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(1)&lt;br /&gt;
|1&lt;br /&gt;
|&amp;lt;code&amp;gt;0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(2)&lt;br /&gt;
|2&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(3)&lt;br /&gt;
|3&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(4)&lt;br /&gt;
|4&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+D_0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(5)&lt;br /&gt;
|6&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+D_1-*E_1+A&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(6)&lt;br /&gt;
|9&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_1+D_1+E_1+F_0-C*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(7)&lt;br /&gt;
|34&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+D_1-GE_1+F_0-EC_1-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(8)&lt;br /&gt;
|≥ 520&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1+C_2-AD_2+E_2+F_0-DG_1-H*_1-EB&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(9)&lt;br /&gt;
|&amp;gt; 2.64 × 10&amp;lt;sup&amp;gt;73&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_1-HD_0-EG_0-FI_1+D_2+H_0+A_2-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(10)&lt;br /&gt;
|&amp;gt; 10↑↑4.03&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1-AC_2-ED_1+E_1+F_0-DG_2-JH_2+I_1-HE_2-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(11)&lt;br /&gt;
|&amp;gt; 10↑↑17.74&lt;br /&gt;
|&amp;lt;code&amp;gt;0-KB_1-IC_1+D_1+E_2-CF_0-AG_0+H_1-GI_2+J_2+B_0-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Analysis ==&lt;br /&gt;
MBB(7):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(x) = A:[x, 0]&lt;br /&gt;
A(2x) -&amp;gt; 9x+20 -&amp;gt; A(3x+4)&lt;br /&gt;
A(2x+1) -&amp;gt; 9x+27 -&amp;gt; halt&lt;br /&gt;
&lt;br /&gt;
A(0) -&amp;gt; 20 -&amp;gt; A(4) -&amp;gt; 38 -&amp;gt; A(10) -&amp;gt; 65 -&amp;gt; A(19) -&amp;gt; 108 -&amp;gt; halt&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(8):&lt;br /&gt;
&amp;lt;pre&amp;gt;Let S(z) = F:[0, 2z+1, z]&lt;br /&gt;
S(2k) -&amp;gt; 44k+19 -&amp;gt; S(5k+2)&lt;br /&gt;
S(2k+1) -&amp;gt; 4k+2 -&amp;gt; halt&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] -&amp;gt; 44 -&amp;gt; S(4) -&amp;gt; 107 -&amp;gt; S(12) -&amp;gt; 283 -&amp;gt; S(32) -&amp;gt; 723 -&amp;gt;  S(82) -&amp;gt; 1823 -&amp;gt; S(207) -&amp;gt; 414 -&amp;gt; halt&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(9):&lt;br /&gt;
&amp;lt;pre&amp;gt;Let A(x, y) = D:[x, 0, y]&lt;br /&gt;
A(2k, y) --(7k + 6)--&amp;gt; A(3k + 3, y + 1)&lt;br /&gt;
A(2k + 1, y + 1) --(7k + 5)--&amp;gt; A(3k + 1, y)&lt;br /&gt;
A(2k + 1, 0) --(3k + 3)--&amp;gt; *:[0, k, 0]&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0]&lt;br /&gt;
--(3)--&amp;gt; A(2, 0)&lt;br /&gt;
--(13)--&amp;gt; A(6, 1)&lt;br /&gt;
--(27)--&amp;gt; A(12, 2)&lt;br /&gt;
...&lt;br /&gt;
--(2753550047052785432549)--&amp;gt; A(1180092877308336613950, 31)&lt;br /&gt;
--(4130325070579178148831)--&amp;gt; A(1770139315962504920928, 32)&lt;br /&gt;
--(6195487605868767223254)--&amp;gt; A(2655208973943757381395, 33)&lt;br /&gt;
...&lt;br /&gt;
--(123361440505394191838159894807429323394336791980165278392551786831696080997)--&amp;gt; A(52869188788026082216354240631755424311858625134356547882522194356441177569, 0)&lt;br /&gt;
--(79303783182039123324531360947633136467787937701534821823783291534661766355)--&amp;gt; *[0, 26434594394013041108177120315877712155929312567178273941261097178220588784, 0]&lt;br /&gt;
MBB(9) ≥ 449388104698221698839011045369921106650798313642030657001438652029750007257&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(10):&lt;br /&gt;
&amp;lt;pre&amp;gt;Let A(x) = E:[0, 0, x]&lt;br /&gt;
A(3k) --(28 × 2^k - 5k - 21)--&amp;gt; A(4 × 2^k - 2)&lt;br /&gt;
A(3k + 1) --(20 × 2^k - 5k - 16)--&amp;gt; *:[0, 4 × 2^k - 3, 0]&lt;br /&gt;
A(3k + 2) --(56 × 2^k - 5k - 23)--&amp;gt; A(8 × 2^k - 1)&lt;br /&gt;
&lt;br /&gt;
Let t3 = 2^5864062014807&lt;br /&gt;
Let t4 = 2^((t3 + 4) / 3)&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0]&lt;br /&gt;
--(20)--&amp;gt; A(5)&lt;br /&gt;
--(84)--&amp;gt; A(15)&lt;br /&gt;
--(850)--&amp;gt; A(126)&lt;br /&gt;
--(123145302310681)--&amp;gt; A(17592186044414)&lt;br /&gt;
--(7 × t3 - 29320310074043)--&amp;gt; A(t3 - 1)&lt;br /&gt;
--(5 × t4 - 5 / 3 × t3 - 38 / 3)--&amp;gt; *:[0, t4 - 3, 0]&lt;br /&gt;
MBB(10) ≥ 5 × t4 + 16 / 3 × t3 + 281474976712738 / 3 &amp;gt; 10^^4.03&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(11):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(x) = I:[x, 0, 0]&lt;br /&gt;
A(3k) --&amp;gt; A((20 * 4^k + 1)/3) if k ≥ 1&lt;br /&gt;
A(3k + 1) --&amp;gt; A((80 * 4^k + 1)/3) if k ≥ 1&lt;br /&gt;
A(3k + 2) --&amp;gt; *:[0, (20 * 4^k - 2)/3, 0] if k ≥ 1&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] --(140)--&amp;gt; A(27)&lt;br /&gt;
--&amp;gt; A((20 * 4^9 + 1) / 3) = A(1747627)&lt;br /&gt;
--&amp;gt; A((80 * 4^582542 + 1) / 3) ≡ A(4897384) mod 3^15&lt;br /&gt;
--&amp;gt; A((80 * 4^1632461 + 1) / 3) ≡ A(2637523) mod 3^14&lt;br /&gt;
--&amp;gt; A((80 * 4^879174 + 1) / 3) ≡ A(813591) mod 3^13&lt;br /&gt;
--&amp;gt; A((20 * 4^271197 + 1) / 3) ≡ A(72385) mod 3^12&lt;br /&gt;
--&amp;gt; A((80 * 4^24128 + 1) / 3) ≡ A(84526) mod 3^11&lt;br /&gt;
--&amp;gt; A((80 * 4^28175 + 1) / 3) ≡ A(35479) mod 3^10&lt;br /&gt;
--&amp;gt; A((80 * 4^11826 + 1) / 3) ≡ A(14202) mod 3^9&lt;br /&gt;
--&amp;gt; A((20 * 4^4734 + 1) / 3) ≡ A(268) mod 3^8&lt;br /&gt;
--&amp;gt; A((80 * 4^89 + 1) / 3) ≡ A(2077) mod 3^7&lt;br /&gt;
--&amp;gt; A((80 * 4^692 + 1) / 3) ≡ A(394) mod 3^6&lt;br /&gt;
--&amp;gt; A((80 * 4^131 + 1) / 3) ≡ A(235) mod 3^5&lt;br /&gt;
--&amp;gt; A((80 * 4^78 + 1) / 3) ≡ A(21) mod 3^4&lt;br /&gt;
--&amp;gt; A((20 * 4^7 + 1) / 3) ≡ A(12) mod 3^3&lt;br /&gt;
--&amp;gt; A((20 * 4^4 + 1) / 3) ≡ A(6) mod 3^2&lt;br /&gt;
--&amp;gt; A((20 * 4^2 + 1) / 3) ≡ A(2) mod 3^1&lt;br /&gt;
--&amp;gt; *:[0, (20 * 4^0 - 2) / 3, 0] ≡ *:[0, 0, 0] mod 3^0&lt;br /&gt;
MBB(11) &amp;gt; 10^^17.74&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
&lt;br /&gt;
=== &#039;&#039;&#039;Cryptids in the Wild&#039;&#039;&#039; ===&lt;br /&gt;
These cryptids were discovered through exhaustive enumeration of a domain, rather than being constructed by hand.&lt;br /&gt;
&lt;br /&gt;
==== MBB(8): Achilles and Patroclus ====&lt;br /&gt;
Through the exhaustive search of the MBB(8) domain, all eight instruction machines have either been decided, or are equivalent to one of the two following potential [[cryptids]]: Achilles (&amp;lt;code&amp;gt;0+B_1+C_2-AD_1-EH_2+F_1-DG_0-EB_2-C*&amp;lt;/code&amp;gt;) and Patroclus (&amp;lt;code&amp;gt;0+B_1-FC_2-GD_0-EF_1+C_2+A_2-EH_1-B*&amp;lt;/code&amp;gt;), which may each be interpreted in the following ways:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Achilles: 0+B_1+C_2-AD_1-EH_2+F_1-DG_0-EB_2-C*&lt;br /&gt;
&lt;br /&gt;
Let A(x, y) = D:[x, y, 0]&lt;br /&gt;
A(x, 0) --(2)--&amp;gt; *:[x, 0, 0]&lt;br /&gt;
A(x, 2k + 1) --(6x + 6k + 9)--&amp;gt; A(x + k + 1, x + k + 2)&lt;br /&gt;
A(x, 2k + 2) --(6k + 6)--&amp;gt; A(x + k, k)&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] --(3)--&amp;gt; A(1, 1)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Needle rules:&lt;br /&gt;
Let C(x + 3) = A(x, x + 1) = D:[x, x + 1, 0].&lt;br /&gt;
Let a and b be non-negative integers satisfying x = (2a + 1) * 2^b.&lt;br /&gt;
C(x) --&amp;gt; C(2x - a - 2b - 1) if a &amp;gt; 0&lt;br /&gt;
C(x) --&amp;gt; *:[2x - 2b - 3, 0, 0] if a = 0&lt;br /&gt;
&lt;br /&gt;
START: C(5)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Patroclus: 0+B_1-FC_2-GD_0-EF_1+C_2+A_2-EH_1-B*&lt;br /&gt;
&lt;br /&gt;
Let A(x, y) = C:[x, 0, y]&lt;br /&gt;
A(x, 2k) --(6x + 6k + 5)--&amp;gt; A(x + k + 1, x + k + 1)&lt;br /&gt;
A(x, 2k + 3) --(6k + 7)--&amp;gt; A(x + k, k)&lt;br /&gt;
A(x, 1) --(3)--&amp;gt; *:[x, 0, 0]&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] --(2)--&amp;gt; A(1, 0)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Needle rules:&lt;br /&gt;
Let C(x + 3) = A(x, x) = C:[x, 0, x].&lt;br /&gt;
Let a and b be non-negative integers satisfying x = (2a + 1) * 2^b.&lt;br /&gt;
C(x) --&amp;gt; C(2x - a - 3b - 1) if a &amp;gt; 0&lt;br /&gt;
C(x) --&amp;gt; *:[2x - 3b - 1, 0, 0] if a = 0&lt;br /&gt;
&lt;br /&gt;
START: C(5)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
They are similar to the [[BB(6)]] cryptid [[Space Needle]], which is also the [[Beaver Math Olympiad#Unsolved problems|BMO&#039;s]] 6th problem.&lt;br /&gt;
&lt;br /&gt;
These were found by Shawn Ligocki as the only 6 remaining 8-instruction holdouts on 2 Oct 2026 with an initial analysis of &amp;lt;code&amp;gt;0+B_1-GC_2-AD_1+E_2+F_0-DB_1-AH_0-F*&amp;lt;/code&amp;gt; .&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555767330531967099]&amp;lt;/sup&amp;gt; Sheep noticed the connection to Space Needle,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555825617197342816]&amp;lt;/sup&amp;gt; analyzed all 6 holdouts and discovered that they can be reduced down to just two behaviors (listed above) and named them.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555896809208156202]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Larger Cryptids ===&lt;br /&gt;
These cryptids were constructed by hand, translating a previously known Cryptid-like mechanism into a register machine. Note that this does not include Rick Griffith&#039;s 85-instruction, 16-register machine which would have halted had Fermat&#039;s Last Theorem turned out to be false,&amp;lt;sup&amp;gt;[https://web.archive.org/web/20120612014351/http://www.cantabgold.net/users/m.y.becker.98/part2projects/rickdissertation.zip]&amp;lt;/sup&amp;gt; as the theorem had already been proven true&amp;lt;sup&amp;gt;[https://www.jstor.org/stable/2118559]&amp;lt;/sup&amp;gt; by the time Griffith&#039;s machine was constructed (2003).&lt;br /&gt;
&lt;br /&gt;
==== MBB(10): Hydra ====&lt;br /&gt;
[[Hydra]] was hand coded into a 10-instruction, 3-register register machine: &amp;lt;code&amp;gt;0-BF_1+C_1+D_0-EH_1+A_2+G_2+I_2-I*_0+J_1-IA&amp;lt;/code&amp;gt; which can be interpreted the following way:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1446694179337011325]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let S(h,w) = A:[h-3,0,w]&lt;br /&gt;
&lt;br /&gt;
Start: A:[0,0,0] = S(3,0)&lt;br /&gt;
S(2k,0) = A:[2k-3,0,0] -&amp;gt; Halt&lt;br /&gt;
S(2k,w+1) = A:[2k-3,0,w+1] -&amp;gt; A:[3k-3,0,w] = S(3k,w)&lt;br /&gt;
S(2k+1,w) = A:[2k-2,0,w] -&amp;gt; A:[3k-2,0,w+2] = S(3k+1,w+2)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== MBB(12,2): Convergence of 7 under the 5n + 1 map ====&lt;br /&gt;
The 5n + 1 map has also been hand coded into a 12-instruction, 2-register machine: &amp;lt;code&amp;gt;0+B_0+C_0+D_0+E_1-IF_1+G_0-HE_0-FJ_0+A_1-KL_0+J_0-H*&amp;lt;/code&amp;gt; which can be interpreted the following way:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555083694937604097]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
0+B_0+C_0+D_0+E_1-IF_1+G_0-HE_0-FJ_0+A_1-KL_0+J_0-H*&lt;br /&gt;
&lt;br /&gt;
Let A(x + 3) = F:[x, 0]&lt;br /&gt;
Assume x &amp;gt; 0.&lt;br /&gt;
A(4) --(10)--&amp;gt; *:[0, 0]&lt;br /&gt;
A(2k) --(5k - 2)--&amp;gt; A(k)&lt;br /&gt;
A(2k + 1) --(9k)--&amp;gt; A(5k + 3)&lt;br /&gt;
 &lt;br /&gt;
A:[0, 0] --(5)--&amp;gt; A(7)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== MBB(130): Riemann Hypothesis ====&lt;br /&gt;
The Riemann Hypothesis has been coded into a 130-instruction, 29-register machine.&amp;lt;sup&amp;gt;[https://www.sciencedirect.com/science/article/pii/S0304397519304633]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[Category:functions]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Beaver_Math_Olympiad&amp;diff=10617</id>
		<title>Beaver Math Olympiad</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Beaver_Math_Olympiad&amp;diff=10617"/>
		<updated>2026-11-12T21:19:39Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Move BMO12 to solved&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Beaver Mathematical Olympiad&#039;&#039;&#039; (BMO) is an attempt to re-formulate the halting problem for some particular Turing machines as a mathematical problem in a style suitable for a hypothetical math olympiad. &lt;br /&gt;
&lt;br /&gt;
The purpose of the BMO is twofold. First, statements where non-essential details (related to tape encoding, number of steps, etc.) are discarded are more suitable to be shared with mathematicians who perhaps are able to help. Second, it&#039;s a way to jokingly highlight how a hard question could appear deceptively simple.&lt;br /&gt;
&lt;br /&gt;
BMO problems have been formalized in Lean and added to the DeepMind formal-conjectures database ([https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Other/BeaverMathOlympiad.lean Github]).&lt;br /&gt;
&lt;br /&gt;
== Unsolved problems ==&lt;br /&gt;
&lt;br /&gt;
=== 1. {{TM|1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0LB0LE|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 1}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;(b_n)_{n \ge 1}&amp;lt;/math&amp;gt; be two sequences such that &amp;lt;math&amp;gt;(a_1, b_1) = (1, 2)&amp;lt;/math&amp;gt; and&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;(a_{n+1}, b_{n+1}) = \begin{cases}&lt;br /&gt;
(a_n-b_n, 4b_n+2) &amp;amp; \text{if }a_n \ge b_n \\&lt;br /&gt;
(2a_n+1, b_n-a_n) &amp;amp; \text{if }a_n &amp;lt; b_n&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for all positive integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Does there exist a positive integer &amp;lt;math&amp;gt;i&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;a_i = b_i&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
The first 10 values of &amp;lt;math&amp;gt;(a_n, b_n)&amp;lt;/math&amp;gt; are &amp;lt;math&amp;gt;(1, 2), (3, 1), (2, 6), (5, 4), (1, 18), (3, 17), (7, 14), (15, 7), (8, 30), (17, 22)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 2. [[Hydra]] and [[Antihydra]] ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 0}&amp;lt;/math&amp;gt; be a sequence such that &amp;lt;math&amp;gt;a_{n+1} = a_n+\left\lfloor\frac{a_n}{2}\right\rfloor&amp;lt;/math&amp;gt; for all non-negative integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
# If &amp;lt;math&amp;gt;a_0=3&amp;lt;/math&amp;gt;, does there exist a non-negative integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that the list of numbers &amp;lt;math&amp;gt;a_0, a_1, a_2, \dots, a_k&amp;lt;/math&amp;gt; have more than twice as many even numbers as odd numbers? ([[Hydra]])&lt;br /&gt;
# If &amp;lt;math&amp;gt;a_0=8&amp;lt;/math&amp;gt;, does there exist a non-negative integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that the list of numbers &amp;lt;math&amp;gt;a_0, a_1, a_2, \dots, a_k&amp;lt;/math&amp;gt; have more than twice as many odd numbers as even numbers? ([[Antihydra]])&lt;br /&gt;
&lt;br /&gt;
=== 5. {{TM|1RB0LD_1LC0RA_1RA1LB_1LA1LE_1RF0LC_---0RE|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 1}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;(b_n)_{n \ge 1}&amp;lt;/math&amp;gt; be two sequences such that &amp;lt;math&amp;gt;(a_1, b_1) = (0, 5)&amp;lt;/math&amp;gt; and&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;(a_{n+1}, b_{n+1}) = \begin{cases}&lt;br /&gt;
(a_n+1, b_n-f(a_n)) &amp;amp; \text{if } b_n \ge f(a_n) \\&lt;br /&gt;
(a_n, 3b_n+a_n+5) &amp;amp; \text{if } b_n &amp;lt; f(a_n)&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;f(x)=10\cdot 2^x-1&amp;lt;/math&amp;gt; for all non-negative integers &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;. &lt;br /&gt;
&lt;br /&gt;
Does there exist a positive integer &amp;lt;math&amp;gt;i&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;b_i = f(a_i)-1&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
=== 6. [[Space Needle]] ===&lt;br /&gt;
Let &amp;lt;math&amp;gt;f(b) = b + k + 3a&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;a&amp;lt;/math&amp;gt; are non-negative integers satisfying &amp;lt;math&amp;gt;b = (2a+1)\cdot 2^k&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Now consider the iterated application of the function &amp;lt;math&amp;gt;f^{n+1}(b) = f(f^n(b))&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;f^0(b)=b&amp;lt;/math&amp;gt;. Does there exist a non-negative integer &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;f^n(6)&amp;lt;/math&amp;gt; equals a power of 2?&lt;br /&gt;
&lt;br /&gt;
=== 8. {{TM|1RB0LD_0RC1RB_0RD0RA_1LE0RD_1LF---_0LA1LA|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 1}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;(b_n)_{n \ge 1}&amp;lt;/math&amp;gt; be two sequences such that &amp;lt;math&amp;gt;(a_1, b_1) = (10, 12)&amp;lt;/math&amp;gt; and&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;(a_{n+1}, b_{n+1}) = \begin{cases}&lt;br /&gt;
(a_n-\left\lfloor\frac{b_n}{2}\right\rfloor-3, 3\left\lfloor\frac{b_n+1}{2}\right\rfloor+6) &amp;amp; \text{if }a_n &amp;gt; \left\lfloor\frac{b_n}{2}\right\rfloor \\&lt;br /&gt;
(3a_n+5, b_n-2a_n) &amp;amp; \text{if }a_n \le \left\lfloor\frac{b_n}{2}\right\rfloor&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for all positive integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Does there exist a positive integer &amp;lt;math&amp;gt;i&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;a_n = \left\lfloor \frac{b_n}{2} \right\rfloor + 1&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
=== 10. {{TM|1RB0LB_0RC0LD_1LD1RE_0LA0RF_0RD1RF_0RC---|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;\Sigma=\{0,1,\#\}&amp;lt;/math&amp;gt;.  Consider two-sided infinite words over &amp;lt;math&amp;gt;\Sigma&amp;lt;/math&amp;gt;.  The initial word is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
w^{(0)}=\cdots 10\#10\#10\#10\#0000\cdots,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
that is, a left-infinite repetition of &amp;lt;math&amp;gt;10\#&amp;lt;/math&amp;gt;, followed by a right-infinite tail of &amp;lt;math&amp;gt;0&amp;lt;/math&amp;gt;&#039;s.&lt;br /&gt;
&lt;br /&gt;
The rewrite rules are&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#0 \to 1,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#100 \to 000\#,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#110 \to 000\#,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#1010 \to 1010\#\#.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A rewrite step consists of choosing any occurrence of the left-hand side of one of these rules in the current word and replacing it by the corresponding right-hand side.  The&lt;br /&gt;
occurrence may be chosen arbitrarily; there is no prescribed reduction order.&lt;br /&gt;
&lt;br /&gt;
At any stage, call a symbol &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; active if it is the leftmost symbol of an occurrence of one of the four left-hand sides above.  Equivalently, a &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; is&lt;br /&gt;
active if the word beginning at that &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; starts with one of&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#0,\qquad \#100,\qquad \#110,\qquad \#1010.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The question is whether there exists some finite sequence of rewrite steps, starting from &amp;lt;math&amp;gt;w^{(0)}&amp;lt;/math&amp;gt;, after which the rightmost occurrence of &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; is not&lt;br /&gt;
active.  In other words, does there exist a rewrite order such that the rightmost &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; can no longer be rewritten?&lt;br /&gt;
&lt;br /&gt;
=== 11. {{TM|1RB0LD_0LC0RE_1LA0RD_0RB0LC_1RC1RF_0LD---|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;\Sigma=\{0,1,\#\}&amp;lt;/math&amp;gt;.  Consider two-sided infinite words over &amp;lt;math&amp;gt;\Sigma&amp;lt;/math&amp;gt;.  The initial word is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
w^{(0)}=\cdots 10\#10\#10\#10\#0000\cdots,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
that is, a left-infinite repetition of &amp;lt;math&amp;gt;10\#&amp;lt;/math&amp;gt;, followed by a right-infinite tail of &amp;lt;math&amp;gt;0&amp;lt;/math&amp;gt;&#039;s.&lt;br /&gt;
&lt;br /&gt;
The rewrite rules are&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#0 \to 1,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#100 \to 010\#,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#1010 \to 1010\#\#,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#10110 \to 10101,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#11 \to 10.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A rewrite step consists of choosing any occurrence of the left-hand side of one of these rules in the current word and replacing it by the corresponding right-hand side.  The&lt;br /&gt;
occurrence may be chosen arbitrarily; there is no prescribed reduction order.&lt;br /&gt;
&lt;br /&gt;
At any stage, call a symbol &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; active if it is the leftmost symbol of an occurrence of one of the five left-hand sides above.  Equivalently, a &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; is&lt;br /&gt;
active if the word beginning at that &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; starts with one of&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#0,\qquad \#100,\qquad \#1010,\qquad \#10110,\qquad \#11.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The question is whether there exists some finite sequence of rewrite steps, starting from &amp;lt;math&amp;gt;w^{(0)}&amp;lt;/math&amp;gt;, after which the rightmost occurrence of &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; is not&lt;br /&gt;
active.  In other words, does there exist a rewrite order such that the rightmost &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; can no longer be rewritten?&lt;br /&gt;
&lt;br /&gt;
== Solved problems ==&lt;br /&gt;
&lt;br /&gt;
=== 3. {{TM|1RB0RB3LA4LA2RA_2LB3RA---3RA4RB|non-halt}} and {{TM|1RB1RB3LA4LA2RA_2LB3RA---3RA4RB|non-halt}}===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;v_2(n)&amp;lt;/math&amp;gt; be the largest integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;2^k&amp;lt;/math&amp;gt; divides &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Let &amp;lt;math&amp;gt;(a_n)_{n \ge 0}&amp;lt;/math&amp;gt; be a sequence such that&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;a_n = \begin{cases}&lt;br /&gt;
2 &amp;amp; \text{if } n=0 \\&lt;br /&gt;
a_{n-1}+2^{v_2(a_{n-1})+2}-1 &amp;amp; \text{if } n \ge 1&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for all non-negative integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Is there an integer &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;a_n=4^k&amp;lt;/math&amp;gt; for some positive integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
Link to Discord discussion: https://discord.com/channels/960643023006490684/1084047886494470185/1252634913220591728&lt;br /&gt;
&lt;br /&gt;
Formalised solution: [https://discord.com/channels/960643023006490684/1259770421046411285/1488737894943166604 Initial announcement], [https://discord.com/channels/960643023006490684/1259770421046411285/1488743526882738276 Lean proof], [https://discord.com/channels/960643023006490684/1259770421046411285/1488781537699696821 LLM-translated Rocq proof], [https://discord.com/channels/960643023006490684/1259770421046411285/1488898995865784442 Proof of closure of existing mid-level rules].&lt;br /&gt;
&lt;br /&gt;
=== 4. {{TM|1RB3RB---1LB0LA_2LA4RA3LA4RB1LB|non-halt}}===&lt;br /&gt;
&lt;br /&gt;
Bonnie the beaver was bored, so she tried to construct a sequence of integers &amp;lt;math&amp;gt;\{a_n\}_{n \ge 0}&amp;lt;/math&amp;gt;. She first defined &amp;lt;math&amp;gt;a_0=2&amp;lt;/math&amp;gt;, then defined &amp;lt;math&amp;gt;a_{n+1}&amp;lt;/math&amp;gt; depending on &amp;lt;math&amp;gt;a_n&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; using the following rules:&lt;br /&gt;
&lt;br /&gt;
* If &amp;lt;math&amp;gt;a_n \equiv 0\text{ (mod 3)}&amp;lt;/math&amp;gt;, then &amp;lt;math&amp;gt;a_{n+1}=\frac{a_n}{3}+2^n+1&amp;lt;/math&amp;gt;.&lt;br /&gt;
* If &amp;lt;math&amp;gt;a_n \equiv 2\text{ (mod 3)}&amp;lt;/math&amp;gt;, then &amp;lt;math&amp;gt;a_{n+1}=\frac{a_n-2}{3}+2^n-1&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
With these two rules alone, Bonnie calculates the first few terms in the sequence: &amp;lt;math&amp;gt;2, 0, 3, 6, 11, 18, 39, 78, 155, 306, \dots&amp;lt;/math&amp;gt;. At this point, Bonnie plans to continue writing terms until a term becomes &amp;lt;math&amp;gt;1\text{ (mod 3)}&amp;lt;/math&amp;gt;. If Bonnie sticks to her plan, will she ever finish?&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Solution&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
How to guess the closed-form solution: Firstly, notice that &amp;lt;math&amp;gt;a_n \approx \frac{3}{5} \times 2^n&amp;lt;/math&amp;gt;. Secondly, calculate the error term &amp;lt;math&amp;gt;a_n - \frac{3}{5} \times 2^n&amp;lt;/math&amp;gt;. The error term appears to have a period of 4. This leads to the following guess:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;a_n=\frac{3}{5}\begin{cases}&lt;br /&gt;
2^n+\frac{7}{3} &amp;amp;\text{if } n\equiv 0 \pmod{4}\\&lt;br /&gt;
2^n-2 &amp;amp;\text{if } n\equiv 1 \pmod{4}\\&lt;br /&gt;
2^n+1 &amp;amp;\text{if } n\equiv 2 \pmod{4}\\&lt;br /&gt;
2^n+2 &amp;amp;\text{if } n\equiv 3 \pmod{4}&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This closed-form solution can be proven correct by induction. Unfortunately, the induction may require a lot of tedious calculations.&lt;br /&gt;
&lt;br /&gt;
For all &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt;, we have &amp;lt;math&amp;gt;a_{4k} \equiv 2\text{ (mod 3)}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;a_{4k+1} \equiv a_{4k+2} \equiv a_{4k+3} \equiv 0\text{ (mod 3)}&amp;lt;/math&amp;gt;. Therefore, Bonnie will never finish.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== 7. {{TM|1RB1RF_1RC0RA_1LD1RC_1LE0LE_0RA0LD_0RB---|non-halt}}===&lt;br /&gt;
Let &amp;lt;math&amp;gt;v_2(n)&amp;lt;/math&amp;gt; be the largest integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;2^k&amp;lt;/math&amp;gt; divides &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;f(n) = n+1+(v_2(n+1) \bmod 2)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Now consider the iterated application of the function &amp;lt;math&amp;gt;f^{n+1}(b) = f(f^n(b))&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;f^0(b)=b&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 0}&amp;lt;/math&amp;gt; be a sequence such that &amp;lt;math&amp;gt;a_0=1&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;a_{n+1} = f^{n+2}\left(\left\lfloor\frac{a_n}{2}\right\rfloor\right)&amp;lt;/math&amp;gt; for all non-negative integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Does there exist a non-negative integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;a_k&amp;lt;/math&amp;gt; is even?&lt;br /&gt;
&lt;br /&gt;
(for simplicity, this question is slightly stronger than the halting problem of this TM)&lt;br /&gt;
&lt;br /&gt;
Link to Discord discussion: https://discord.com/channels/960643023006490684/1421782442213376000/1431483206208852001&lt;br /&gt;
&lt;br /&gt;
=== 9. {{TM|1RB1LA_1RC0RD_1LA---_1RE1RD_1LF0LA_---0LE|undecided}}===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;\mathbb{N}=\{0,1,2,\ldots\}&amp;lt;/math&amp;gt;.  Consider configurations given by infinite sequences of non-negative integers,&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\mathbb{N}^{\omega}&lt;br /&gt;
=&lt;br /&gt;
\{(x_0,x_1,x_2,\ldots): x_i\in\mathbb{N}\}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Define a partial transition map&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
T:\mathbb{N}^{\omega}\to \mathbb{N}^{\omega}\cup\{\mathrm{Halt}\}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
by the following rewrite rules.  For all &amp;lt;math&amp;gt;a,b,c\in\mathbb{N}&amp;lt;/math&amp;gt; and every infinite tail sequence &amp;lt;math&amp;gt;\mathbf r\in\mathbb{N}^{\omega}&amp;lt;/math&amp;gt;,&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(0,a,c,\mathbf r)\mapsto (3+a+c,\mathbf r),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(1,0,\mathbf r)\mapsto \mathrm{Halt},&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(1,1+a,c,\mathbf r)\mapsto (a,0,1,1+c,\mathbf r),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(2+a,b,c,\mathbf r)\mapsto (a,1+b,1+c,\mathbf r).&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The initial configuration is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\mathbf x^{(0)}=(0,0,0,0,\ldots).&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The question is whether the orbit of &amp;lt;math&amp;gt;\mathbf x^{(0)}&amp;lt;/math&amp;gt; under repeated application of &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt; eventually halts; that is, whether there exists some&lt;br /&gt;
&amp;lt;math&amp;gt;n\in\mathbb{N}&amp;lt;/math&amp;gt; such that&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
T(\mathbf x^{(n)})=\mathrm{Halt},&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\mathbf x^{(n+1)}=T(\mathbf x^{(n)})&amp;lt;/math&amp;gt; whenever the right-hand side is not &amp;lt;math&amp;gt;\mathrm{Halt}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 12. [[Fractran#Size 24: Energy Vampire|[2/15, 1/6, 441/2, 11/3, 25/7, 6/11]]] ===&lt;br /&gt;
Let &amp;lt;math&amp;gt;(h_n)_{n \ge 1}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;(w_n)_{n \ge 1}&amp;lt;/math&amp;gt; be two sequences such that &amp;lt;math&amp;gt;(h_1, w_1) = (1, 2)&amp;lt;/math&amp;gt; and&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;h_{n+1} = \left\lceil \frac{8 h_n}{3} \right\rceil&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;&lt;br /&gt;
w_{n+1} = \begin{cases}&lt;br /&gt;
  w_n - 1 &amp;amp; \text{if }h_n \equiv 0 \pmod{3} \\&lt;br /&gt;
  w_n     &amp;amp; \text{if }h_n \equiv 1 \pmod{3} \\&lt;br /&gt;
  w_n + 1 &amp;amp; \text{if }h_n \equiv 2 \pmod{3}&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for all positive integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Does there exist a positive integer &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;w_n = 0&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
Jason Yuen found that &amp;lt;math&amp;gt;w_{495141375730} = 0&amp;lt;/math&amp;gt;: https://discord.com/channels/960643023006490684/1438019511155691521/1565647448452636672&lt;br /&gt;
&lt;br /&gt;
== Practice Problems ==&lt;br /&gt;
Problems that are not BMO-level, but provide counter-examples to certain [[probvious]] intuition:&lt;br /&gt;
&lt;br /&gt;
* {{TM|1RB0LE_1LC1RA_---1LD_0RB1LF_1RD1LA_0LA0RD}}&lt;br /&gt;
* {{TM|1RB0RD_0LC1RA_0RA1LB_1RE1LB_1LF1LB_---1LE}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Individual machines]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Fractran&amp;diff=10616</id>
		<title>Fractran</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Fractran&amp;diff=10616"/>
		<updated>2026-11-12T21:18:41Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Correct Holdouts repo attribution&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Fractran&#039;&#039;&#039; (originally styled FRACTRAN) is an esoteric [[Turing complete]] model of computation invented by John Conway in 1987.&amp;lt;ref&amp;gt;Conway, John H. (1987). &amp;quot;FRACTRAN: A Simple Universal Programming Language for Arithmetic&amp;quot;. &#039;&#039;Open Problems in Communication and Computation&#039;&#039;. Springer-Verlag New York, Inc. pp. 4–26. &amp;lt;nowiki&amp;gt;http://doi.org/10.1007/978-1-4612-4808-8_2&amp;lt;/nowiki&amp;gt;&amp;lt;/ref&amp;gt; In this model a program is simply a finite list of fractions (rational numbers), the program state is an integer. For more details see https://en.wikipedia.org/wiki/FRACTRAN.&lt;br /&gt;
&lt;br /&gt;
Discord user Coda came up with a way to transform any Fractran program into a Turing Machine, see [https://discord.com/channels/960643023006490684/1438019511155691521/1441844795613122560 source].&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;BB_fractran&#039;&#039;&#039;(n) or &#039;&#039;&#039;BBf&#039;&#039;&#039;(n) is the Busy Beaver function for Fractran programs. Holdouts lists by Jason Yuen (@-d): [https://github.com/int-y1/BBFractran/blob/main/holdout/README.md Holdouts lists]&lt;br /&gt;
&lt;br /&gt;
== Definition ==&lt;br /&gt;
A Fractran program is a list of rational numbers &amp;lt;math&amp;gt;[q_0, q_1, \dots, q_{k-1}]&amp;lt;/math&amp;gt; called rules and a Fractran state is an integer &amp;lt;math&amp;gt;s \in \mathbb{Z}&amp;lt;/math&amp;gt;. The numerator and denominator of any rational number fraction do not share any prime factors (they are in reduced form). We say that a rule &amp;lt;math&amp;gt;q_i&amp;lt;/math&amp;gt; applies to state &amp;lt;math&amp;gt;s&amp;lt;/math&amp;gt; if &amp;lt;math&amp;gt;s \cdot q_i \in \mathbb{Z}&amp;lt;/math&amp;gt;. If no rule applies, we say that the computation has halted otherwise we apply the first applicable rule at each step. In that case we say &amp;lt;math&amp;gt;s \to t&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;t = s \cdot q_i&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;i = \min \{ i : s \cdot q_i \in \mathbb{Z} \}&amp;lt;/math&amp;gt;. As with [[Turing machines]], we will write &amp;lt;math&amp;gt;s \xrightarrow{N} t&amp;lt;/math&amp;gt; if &amp;lt;math&amp;gt;s \to s_1 \to \cdots \to s_{N-1} \to t&amp;lt;/math&amp;gt; (s goes to t after N steps) and &amp;lt;math&amp;gt;s \to^* t&amp;lt;/math&amp;gt; or &amp;lt;math&amp;gt;s \to^+ t&amp;lt;/math&amp;gt; if &amp;lt;math&amp;gt;s \xrightarrow{N} t&amp;lt;/math&amp;gt; for some N≥0 or N≥1 (respectively). We say that a program has runtime N (or halts in N steps) starting in state s if &amp;lt;math&amp;gt;s \xrightarrow{N} t&amp;lt;/math&amp;gt; and computation halts on t.&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;\Omega(n)&amp;lt;/math&amp;gt; be the total number of prime factors of a positive integer n. In other words, &amp;lt;math&amp;gt;\Omega(2^{a_0} 3^{a_1} \cdots p_n^{a_n}) = \sum_{k=0}^n a_k&amp;lt;/math&amp;gt;. Then given a rule &amp;lt;math&amp;gt;\frac{a}{b}&amp;lt;/math&amp;gt; we say that &amp;lt;math&amp;gt;\text{size} \left( \frac{a}{b} \right) = \Omega(a) + \Omega(b)&amp;lt;/math&amp;gt;. And the size of a Fractran program &amp;lt;math&amp;gt;[q_0, q_1, \dots, q_{k-1}]&amp;lt;/math&amp;gt; is &amp;lt;math&amp;gt;k + \sum_{i=0}^{k-1} \text{size}(q_i)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
BB_fractran(n) or BBf(n) is the maximum runtime starting in state 2 for all halting Fractran programs of size n. It is a non-computable function akin to the [[Busy Beaver Functions]] since Fractran is Turing Complete.&lt;br /&gt;
&lt;br /&gt;
== Vector Representation ==&lt;br /&gt;
Fractran programs are not easy to interpret, in fact it may be completely unclear at first that they can perform any computation at all. One of the key insights is to represent all numbers (states and rules) in their prime factorization form. For example, we can use a vector &amp;lt;math&amp;gt;[ a_0, a_1, \dots, a_{n-1} ] \in \mathbb{Z}^n&amp;lt;/math&amp;gt; to represent the number &amp;lt;math&amp;gt;2^{a_0} 3^{a_1} \cdots p_{n-1}^{a_{n-1}}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Let the vector representation (for a sufficiently large n) for a state &amp;lt;math&amp;gt;a = 2^{a_0} 3^{a_1} \cdots p_{n-1}^{a_{n-1}}&amp;lt;/math&amp;gt; be &amp;lt;math&amp;gt;v(a) = [ a_0, a_1, \dots, a_{n-1} ] \in \mathbb{N}^n&amp;lt;/math&amp;gt; and the vector representation for a rule &amp;lt;math&amp;gt;\frac{a}{b}&amp;lt;/math&amp;gt; be &amp;lt;math&amp;gt;v \left( \frac{a}{b} \right) = v(a) - v(b) \in \mathbb{Z}^n&amp;lt;/math&amp;gt; (Note that this is just an extension of the original definition extended to allow negative &amp;lt;math&amp;gt;a_i&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
Now, rule q applies to state s iff &amp;lt;math&amp;gt;v(s) + v(q) \in \mathbb{N}^n&amp;lt;/math&amp;gt; (all components of the vector are ≥0) and if &amp;lt;math&amp;gt;s \to t&amp;lt;/math&amp;gt; then &amp;lt;math&amp;gt;v(t) = v(s) + v(q)&amp;lt;/math&amp;gt;. So the Fractran multiplication model is completely equivalent to the vector adding model. For presentation, we will represent a Fractran program with a matrix where each row is the vector representation for a rule.&lt;br /&gt;
&lt;br /&gt;
For example, the BBf(15) champion (&amp;lt;code&amp;gt;[1/45, 4/5, 3/2, 25/3]&amp;lt;/code&amp;gt;) in vector representation would be:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   0 &amp;amp; -2 &amp;amp; -1 \\&lt;br /&gt;
   2 &amp;amp;  0 &amp;amp; -1 \\&lt;br /&gt;
  -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  2&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In this representation, it becomes much easier to reason about Fractran programs and describe general rules. It is also very easy to calculate the size of a rule or program in vector representation. It is the sum of absolute values of all elements in the matrix + number of rules (number of rows).&lt;br /&gt;
&lt;br /&gt;
=== Relationship to VAS / Petri Nets ===&lt;br /&gt;
Using vector representation, Fractran programs are a deterministic version of [[wikipedia:Vector_addition_system|Vector Addition Systems (VAS)]] (and, equivalently, [[wikipedia:Petri_net|Petri Nets]]). VAS are identical to Fractran programs in vector representation except that the rules are unordered and non-deterministic, they are used to model distributed systems where precise order of rule execution cannot be predicted. Interestingly, many problems about VAS are actually decidable, but their runtimes are extremely slow. Notably, the reachability problem (given states A and B are there a sequence of rules so that &amp;lt;math&amp;gt;A \to^* B&amp;lt;/math&amp;gt;) is &amp;quot;Ackermann-complete&amp;quot; meaning that the optimal algorithm has worst-case runtime akin to the famously fast-growing Ackermann function.&amp;lt;ref&amp;gt;Czerwiński, Wojciech; Orlikowski, Łukasz (2021). &#039;&#039;Reachability in Vector Addition Systems is Ackermann-complete&#039;&#039;. 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). https://arxiv.org/abs/2104.13866.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Visualizing Fractran Programs&#039; Space-Time Diagrams ==&lt;br /&gt;
Katelyn Doucette&#039;s Fractran space-time diagram visualizer produces the following space-time diagrams for some notable Fractran Programs, under the following principle: Each color represents a prime factor. Left -&amp;gt; right colors indicating the index of that register, and how wide the color is representing how big the value is at that step. Source code: https://github.com/Laturas/FractranVisualizer&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
|[[File:Fractran_22_Cryptid.webp|alt=The space-time diagram of Fenrir|460x460px]]&lt;br /&gt;
The space-time diagram of Fenrir&lt;br /&gt;
|[[File:Hydra.webp|alt=The space-time diagram of Hydra.|460x460px]]&lt;br /&gt;
The space-time diagram of Hydra.&lt;br /&gt;
|[[File:Bbf21 champ full.png|alt=The space-time diagram of the BBf(21) champion.|400x400px]]&lt;br /&gt;
&lt;br /&gt;
The space-time diagram of the BBf(21) champion. The width &amp;amp; height of the diagram can be set in the visualizer.&lt;br /&gt;
|[[File:Space_Needle.webp|alt=The space-time diagram of Space Needle.|460x460px]]&lt;br /&gt;
The space-time diagram of Space Needle.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Deciders ==&lt;br /&gt;
[[File:Fractran deciders.png|alt=Fractran deciders|thumb|All Fractran deciders summarized and their relations, shared by Daniel Yuan on [https://discord.com/channels/960643023006490684/1438019511155691521/1439001835904958655 14 Nov 2025]]]Many specialized deciders have been invented to prove Fractran programs non-halting. See image at right. There are three extra deciders: [https://discord.com/channels/960643023006490684/1438019511155691521/1449775657554022531 Spanning Vectors Masked,] which should be very effective, but implementing it is in-progress, a version of Spanning Vectors Masked - [https://discord.com/channels/960643023006490684/1438019511155691521/1453217977385091092 Masked Linear Invariant] - which is very powerful, and some holdouts were removed by [[User:Sligocki|Shawn Ligocki]] with [https://lsv.ens-paris-saclay.fr/Software/fast/ FAST] (Fast Acceleration of Symbolic Transition systems), a pre-existing general tool.&lt;br /&gt;
&lt;br /&gt;
-d released a new decider on 25 Jan 2026: [https://discord.com/channels/960643023006490684/1438019511155691521/1464873923647639703 Beeping Permutation].&lt;br /&gt;
&lt;br /&gt;
TODO: create pages about the deciders.&lt;br /&gt;
&lt;br /&gt;
== Champions ==&lt;br /&gt;
The table of champions is split into two pieces: the first for small champions (up to BBf(14)) which all share the same relatively simple behavior (sequential programs) is collapsed by default; the second for champions BBf(15) and beyond which have more complex and varied behavior.&lt;br /&gt;
All small champions as well as the first few larger ones were discovered and proven maximal by Jason Yuen (@-d) in their initial enumeration on [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]. &lt;br /&gt;
&lt;br /&gt;
BBf(21) and below are solved. BBf(22) is the smallest domain to contain a Cryptid, and all other machines for BBf(22) are solved.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Small Champions&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!BBf(n)&lt;br /&gt;
!Example Champion&lt;br /&gt;
!Vector Representation&lt;br /&gt;
|-&lt;br /&gt;
| 2 || 1 || &amp;lt;code&amp;gt;[1/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 3 || 1 || &amp;lt;code&amp;gt;[3/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp; 1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 4 || 1 || &amp;lt;code&amp;gt;[9/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp; 2&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 5 || 2 || &amp;lt;code&amp;gt;[3/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  1 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 6 || 3 || &amp;lt;code&amp;gt;[9/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  2 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 7 || 4 || &amp;lt;code&amp;gt;[27/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  3 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 8 || 5 || &amp;lt;code&amp;gt;[81/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  4 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 9 || 6 || &amp;lt;code&amp;gt;[243/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  5 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 10 || 7 || &amp;lt;code&amp;gt;[729/2, 1/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  6 \\&lt;br /&gt;
   0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 11 || 10 || &amp;lt;code&amp;gt;[27/2, 25/3, 1/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  3 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  2 \\&lt;br /&gt;
   0 &amp;amp;  0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 12 || 13 || &amp;lt;code&amp;gt;[81/2, 25/3, 1/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  4 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  2 \\&lt;br /&gt;
   0 &amp;amp;  0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 13 || 17 || &amp;lt;code&amp;gt;[81/2, 125/3, 1/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  4 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  3 \\&lt;br /&gt;
   0 &amp;amp;  0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 14 || 21 || &amp;lt;code&amp;gt;[243/2, 125/3, 1/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
  -1 &amp;amp;  5 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  3 \\&lt;br /&gt;
   0 &amp;amp;  0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!BBf(n)&lt;br /&gt;
!Example Champion&lt;br /&gt;
!Vector Representation&lt;br /&gt;
!Champion Found&lt;br /&gt;
!Holdouts Proven&lt;br /&gt;
|-&lt;br /&gt;
| 15 || 28 || &amp;lt;code&amp;gt;[1/45, 4/5, 3/2, 25/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   0 &amp;amp; -2 &amp;amp; -1 \\&lt;br /&gt;
   2 &amp;amp;  0 &amp;amp; -1 \\&lt;br /&gt;
  -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  2&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]&lt;br /&gt;
|-&lt;br /&gt;
| 16 || 53 || &amp;lt;code&amp;gt;[1/45, 4/5, 3/2, 125/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   0 &amp;amp; -2 &amp;amp; -1 \\&lt;br /&gt;
   2 &amp;amp;  0 &amp;amp; -1 \\&lt;br /&gt;
  -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  3&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434033599094587595 1 Nov 2025]&lt;br /&gt;
|-&lt;br /&gt;
| 17 || 107 || &amp;lt;code&amp;gt;[5/6, 49/2, 3/5, 40/7]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   -1 &amp;amp;  0 &amp;amp;  0 &amp;amp;  2 \\&lt;br /&gt;
    0 &amp;amp;  1 &amp;amp; -1 &amp;amp;  0 \\&lt;br /&gt;
    3 &amp;amp;  0 &amp;amp;  1 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1434313398799175710 1 Nov 2025]&lt;br /&gt;
|Daniel Yuan (@dyuan01) [https://discord.com/channels/960643023006490684/1362008236118511758/1434771877376557086 3 Nov 2025]&lt;br /&gt;
|-&lt;br /&gt;
| 18 || 211 || &amp;lt;code&amp;gt;[5/6, 49/2, 3/5, 80/7]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   -1 &amp;amp;  0 &amp;amp;  0 &amp;amp;  2 \\&lt;br /&gt;
    0 &amp;amp;  1 &amp;amp; -1 &amp;amp;  0 \\&lt;br /&gt;
    4 &amp;amp;  0 &amp;amp;  1 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1435313806493614131 4 Nov 2025]&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1362008236118511758/1436661215911870584 8 Nov 2025]&lt;br /&gt;
|-&lt;br /&gt;
| 19 || 370 || &amp;lt;code&amp;gt;[5/6, 49/2, 3/5, 160/7]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   -1 &amp;amp;  0 &amp;amp;  0 &amp;amp;  2 \\&lt;br /&gt;
    0 &amp;amp;  1 &amp;amp; -1 &amp;amp;  0 \\&lt;br /&gt;
    5 &amp;amp;  0 &amp;amp;  1 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|@creeperman7002 [https://discord.com/channels/960643023006490684/1362008236118511758/1435763150489387090 5 Nov 2025]&lt;br /&gt;
|Decider: Daniel Yuan (@dyuan01) [https://discord.com/channels/960643023006490684/1438019511155691521/1438558242388312165 13 Nov 2025]&lt;br /&gt;
3 Holdouts: Racheline &amp;amp; Shawn Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|20&lt;br /&gt;
|746&lt;br /&gt;
|&amp;lt;code&amp;gt;[7/15, 22/3, 6/77, 5/2, 9/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
    1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    -1 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1438019511155691521/1438480761169776733 13 Nov 2025]&lt;br /&gt;
|Decider: Jason Yuen (@-d) &lt;br /&gt;
([https://github.com/int-y1/BBFractran/tree/main/holdout Enum+initial]) &lt;br /&gt;
Daniel Yuan (@dyuan01) [https://discord.com/channels/960643023006490684/1438019511155691521/1438559507579011194 13] and [https://discord.com/channels/960643023006490684/1438019511155691521/1438996636389998773 14 Nov 2025]&lt;br /&gt;
&lt;br /&gt;
Shawn Ligocki (@sligocki) [https://discord.com/channels/960643023006490684/1438019511155691521/1447069110541484146 7] and [https://discord.com/channels/960643023006490684/1438019511155691521/1453213088630444168 24 Dec 2025]&lt;br /&gt;
6 Holdouts: Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1438019511155691521/1452913055053778945 23 Dec 2025]&lt;br /&gt;
|-&lt;br /&gt;
|21&lt;br /&gt;
|31,957,632&lt;br /&gt;
|&amp;lt;code&amp;gt;[7/15, 4/3, 27/14, 5/2, 9/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 \\&lt;br /&gt;
    2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     3 &amp;amp;     0 &amp;amp;    -1 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1438019511155691521/1439759182587891894 16 Nov 2025]&lt;br /&gt;
|No holdouts remain. Claude Opus 4.6&#039;s proof of nonhalting of all the 140 holdouts: [https://discord.com/channels/960643023006490684/1438019511155691521/1485168251997786173 28 March 2026]&lt;br /&gt;
|-&lt;br /&gt;
|22&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 1.146 \times 10^{62}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/12, 9/10, 14/3, 11/2, 5/7, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Shawn Ligocki (@sligocki) [https://discord.com/channels/960643023006490684/1438019511155691521/1448912286713384961 11 Dec 2025] and Jason Yuen (@-d)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1448953682237460480 &amp;lt;nowiki&amp;gt;[1]&amp;lt;/nowiki&amp;gt;]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|3 holdouts remain. Claude Opus 4.6 gave a proof of all machines but the 3 Fenrir Cryptids, see [https://discord.com/channels/960643023006490684/1438019511155691521/1493027835559022824 Discord].&lt;br /&gt;
&lt;br /&gt;
The holdouts list whose elements are exactly the 3 Fenrir Cryptids on GitHub: [https://github.com/int-y1/BBFractran/blob/main/holdout/sz22_3.txt sz22_3.txt]&lt;br /&gt;
Known [[Cryptid|Cryptids]]: &lt;br /&gt;
&lt;br /&gt;
# Fenrir&lt;br /&gt;
|-&lt;br /&gt;
|23&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 4.393 \times 10^{124}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;[10/3, 9/14, 5/4, 121/2, 7/5, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
   -2 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     2 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Shawn Ligocki (@sligocki) [https://discord.com/channels/960643023006490684/1438019511155691521/1510781736374763702 1 Jun 2026]&lt;br /&gt;
|21,295 holdouts remain. [https://discord.com/channels/960643023006490684/1438019511155691521/1511579969825013811 2 Jun 2026]&lt;br /&gt;
By August 5th, 2026, the unofficial holdouts count had been reduced to 13. [https://github.com/int-y1/BBFractran/blob/main/holdout/sz23_13_unofficial.txt sz23_13_unofficial.txt]&lt;br /&gt;
Known [[Cryptid|Cryptids]]: &lt;br /&gt;
&lt;br /&gt;
# 11 Hydra-like Cryptids (including Frankenstein&#039;s Monster and Antihydra-like Cryptid)&lt;br /&gt;
|-&lt;br /&gt;
|24&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 9.000 \times 10^{14448}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;[14/15, 1/6, 11/3, 441/2, 5/7, 15/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;     0 &amp;amp;     2 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jason Yuen (@-d) [https://discord.com/channels/960643023006490684/1438019511155691521/1547182811713380383 9 Sep 2026]&lt;br /&gt;
|231,432 holdouts remain. [https://github.com/int-y1/BBFractran/blob/main/holdout/sz24_231432.txt 12 Sep 2026]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Behavior of Champions ===&lt;br /&gt;
&lt;br /&gt;
==== Sequential programs ====&lt;br /&gt;
All champions up to BBf(14) have very simple behavior. They are all of the form: &amp;lt;math&amp;gt;\left[ \frac{3^{a_1}}{2}, \frac{5^{a_2}}{3}, \dots, \frac{p_n^{a_k}}{p_{k-1}}, \frac{1}{p_k} \right]&amp;lt;/math&amp;gt; or in vector representation (limited to k=4):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; a_1 &amp;amp;   0 &amp;amp;   0 &amp;amp;   0 \\&lt;br /&gt;
    0 &amp;amp;  -1 &amp;amp; a_2 &amp;amp;   0 &amp;amp;   0 \\&lt;br /&gt;
    0 &amp;amp;   0 &amp;amp;  -1 &amp;amp; a_3 &amp;amp;   0 \\&lt;br /&gt;
    0 &amp;amp;   0 &amp;amp;   0 &amp;amp;  -1 &amp;amp; a_4 \\&lt;br /&gt;
    0 &amp;amp;   0 &amp;amp;   0 &amp;amp;   0 &amp;amp;  -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
These champions repeatedly apply the rules in sequence, never going back to a previous rule. They apply the first rule until they&#039;ve exhausted all 2s, then the second rule until they&#039;ve exhausted all 3s, etc. They have a runtime of &amp;lt;math&amp;gt;1 + a_1 + a_1 a_2 + a_1 a_2 a_3 + \cdots = \sum_{i=0}^k \prod_{j=1}^i a_j&amp;lt;/math&amp;gt; and size &amp;lt;math&amp;gt;2k+2 + \sum_{i=1}^k a_i&amp;lt;/math&amp;gt;. This grows linearly for k=1 (BBf(5) to BBf(10)) and quadratically for k=2 (BBf(11) to BBf(14)). Letting k grow with the size, the maximum runtime grows exponentially in the program size.&lt;br /&gt;
&lt;br /&gt;
==== BBf(15) Family ====&lt;br /&gt;
The BBf(15) and BBf(16) champions are members of a family of programs (parameterized by &amp;lt;math&amp;gt;n \ge 1&amp;lt;/math&amp;gt;):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   0 &amp;amp; -2 &amp;amp; -1 \\&lt;br /&gt;
   2 &amp;amp;  0 &amp;amp; -1 \\&lt;br /&gt;
  -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   0 &amp;amp; -1 &amp;amp;  n&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Let a = 2, b = 3, and c = 5.&lt;br /&gt;
&lt;br /&gt;
The BBf(15) champion (n = 2) implements this iteration:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  b^0     &amp;amp; \xrightarrow{0} &amp;amp; \text{halt} \\&lt;br /&gt;
  b^1     &amp;amp; \xrightarrow{7} &amp;amp; b^4 \\&lt;br /&gt;
  b^2     &amp;amp; \xrightarrow{7} &amp;amp; b^5 \\&lt;br /&gt;
  b^3     &amp;amp; \xrightarrow{5} &amp;amp; b^2 \\&lt;br /&gt;
  b^4     &amp;amp; \xrightarrow{5} &amp;amp; b^3 \\&lt;br /&gt;
  b^{k+5} &amp;amp; \xrightarrow{3} &amp;amp; b^k \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which follows a permutation-like trajectory: &amp;lt;math&amp;gt;a \xrightarrow{1} b^1 \to b^4 \to b^3 \to b^2 \to b^5 \to b^0 \to \text{halt}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The BBf(16) champion (n = 3) implements this iteration:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  b^0     &amp;amp; \xrightarrow{0}  &amp;amp; \text{halt} \\&lt;br /&gt;
  b^1     &amp;amp; \xrightarrow{10} &amp;amp; b^6 \\&lt;br /&gt;
  b^2     &amp;amp; \xrightarrow{10} &amp;amp; b^7 \\&lt;br /&gt;
  b^3     &amp;amp; \xrightarrow{8}  &amp;amp; b^4 \\&lt;br /&gt;
  b^4     &amp;amp; \xrightarrow{8}  &amp;amp; b^5 \\&lt;br /&gt;
  b^5     &amp;amp; \xrightarrow{6}  &amp;amp; b^2 \\&lt;br /&gt;
  b^6     &amp;amp; \xrightarrow{6}  &amp;amp; b^3 \\&lt;br /&gt;
  b^{k+7} &amp;amp; \xrightarrow{4}  &amp;amp; b^k \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which follows a permutation-like trajectory: &amp;lt;math&amp;gt;a \xrightarrow{1} b^1 \to b^6 \to b^3 \to b^4 \to b^5 \to b^2 \to b^7 \to b^0 \to \text{halt}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== BBf(17) Family ====&lt;br /&gt;
The BBf(17) to BBf(19) champions are members of a family of programs (parameterized by &amp;lt;math&amp;gt;m,n \ge 0&amp;lt;/math&amp;gt;)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp; -1 &amp;amp;  1 &amp;amp;  0 \\&lt;br /&gt;
   -1 &amp;amp;  0 &amp;amp;  0 &amp;amp;  n \\&lt;br /&gt;
    0 &amp;amp;  1 &amp;amp; -1 &amp;amp;  0 \\&lt;br /&gt;
    m &amp;amp;  0 &amp;amp;  1 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which have size &amp;lt;math&amp;gt;m+n+12&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This family obeys the following rules:&lt;br /&gt;
&lt;br /&gt;
# &amp;lt;math&amp;gt;[1, 0, 0, 0] \xrightarrow{1} [0, 0, 0, n]&amp;lt;/math&amp;gt;&lt;br /&gt;
# if d≥1 and b≤m:&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;[0, b, 0, d] \xrightarrow{m+b+2} [0, b+1, 0, d - 1 + n(m-b)]&amp;lt;/math&amp;gt;&lt;br /&gt;
# if d≥1 and b≥m:&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;[0, b, 0, d] \xrightarrow{2m+2} [0, b+1, 0, d - 1]&amp;lt;/math&amp;gt;&lt;br /&gt;
#if d=0: [0,b,0,d] has halted&lt;br /&gt;
&lt;br /&gt;
and furthermore these rules are applied in order since b is always increasing (and d is eventually decreasing). Combining these together we get runtime:&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;1 + n(m+1)(m(m+1)+2) - \frac{m(m+1)}{2}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The optimal choices for n,m for various program sizes are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Size&lt;br /&gt;
!n&lt;br /&gt;
!m&lt;br /&gt;
!Runtime&lt;br /&gt;
|-&lt;br /&gt;
|16&lt;br /&gt;
|1&lt;br /&gt;
|3&lt;br /&gt;
|51&lt;br /&gt;
|-&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;17&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;2&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;3&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;107&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|-&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;18&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;2&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;4&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;211&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|-&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;19&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;2&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;5&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;&#039;&#039;370&#039;&#039;&#039;&#039;&#039;&lt;br /&gt;
|-&lt;br /&gt;
|20&lt;br /&gt;
|2&lt;br /&gt;
|6&lt;br /&gt;
|596&lt;br /&gt;
|-&lt;br /&gt;
|21&lt;br /&gt;
|3&lt;br /&gt;
|6&lt;br /&gt;
|904&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
==== BBf(20) ====&lt;br /&gt;
[[File:Screenshot 2026-04-01 104704.png|alt=Full space-time diagram of the BBf(20) champion.|left|507x507px]]&lt;br /&gt;
The BBf(20) champion (running 746 steps):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
    1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    -1 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This program implements a [[Collatz-like]] iteration. Let &amp;lt;math&amp;gt;C(n) = [0, 0, n, 2, 0]&amp;lt;/math&amp;gt;, then:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0] &amp;amp; \xrightarrow{49}     &amp;amp; C(2) \\&lt;br /&gt;
  C(3k)       &amp;amp; \xrightarrow{3k}     &amp;amp; \text{halt} \\&lt;br /&gt;
  C(3k+1)     &amp;amp; \xrightarrow{11k+22} &amp;amp; C(4k+3) \\&lt;br /&gt;
  C(3k+2)     &amp;amp; \xrightarrow{11k+22} &amp;amp; C(4k+4) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which follows the reasonably &amp;quot;lucky&amp;quot; trajectory:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;C(2) \to C(4) \to C(7) \to C(11) \to C(16) \to C(23) \to C(32) \to C(44) \to C(60) \to \text{halt}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==== BBf(21) ====&lt;br /&gt;
[[File:Bbf21 champ full.png|alt=The full space-time diagram of the BBf(21) champion until halting.|thumb|The full space-time diagram of the BBf(21) champion until halting.]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The BBf(21) champion (running &amp;gt;31M steps):&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     1 \\&lt;br /&gt;
    2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     3 &amp;amp;     0 &amp;amp;    -1 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This program implements a Collatz-like iteration. Let &amp;lt;math&amp;gt;D(n) = [0, 0, n, 0]&amp;lt;/math&amp;gt;, then:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1439779341365022852]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0] &amp;amp; \xrightarrow{1}      &amp;amp; D(1) \\&lt;br /&gt;
  D(3k)       &amp;amp; \xrightarrow{k}      &amp;amp; \text{halt} \\&lt;br /&gt;
  D(3k+1)     &amp;amp; \xrightarrow{21k+7}  &amp;amp; C(10k+4) \\&lt;br /&gt;
  D(3k+2)     &amp;amp; \xrightarrow{21k+14} &amp;amp; C(10k+7) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which follows the reasonably &amp;quot;lucky&amp;quot; trajectory:&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{ll}&lt;br /&gt;
  D(1) &amp;amp; \to D(4) \to D(14) \to D(47) \to D(157) \to D(524) \to D(1747) \to D(5824) \to D(19414) \\&lt;br /&gt;
       &amp;amp; \to D(64714) \to D(215714) \to D(719047) \to D(2396824) \to D(7989414) \to \text{halt} \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== BBf(22) ====&lt;br /&gt;
The BBf(22) champion (running &amp;lt;math&amp;gt;&amp;gt; 10^{62}&amp;lt;/math&amp;gt; steps):&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This program implements a [[Collatz-like]] unbiased pseudo-random walk. Let &amp;lt;math&amp;gt;S(x,y) = [0, 0, x, 0, y]&amp;lt;/math&amp;gt;, then:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1449118888142049421]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0]  &amp;amp; \xrightarrow{1}      &amp;amp; S(0,1) \\&lt;br /&gt;
  S(x, 0)      &amp;amp;  =                   &amp;amp; \text{halt} \\&lt;br /&gt;
  S(3k,   y+1) &amp;amp; \xrightarrow{14k+4}  &amp;amp; S(5k+1, y+1) \\&lt;br /&gt;
  S(3k+1, y+1) &amp;amp; \xrightarrow{14k+10} &amp;amp; S(5k+3, y+2) \\&lt;br /&gt;
  S(3k+2, y+1) &amp;amp; \xrightarrow{14k+12} &amp;amp; S(5k+4, y) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This pseudo-random walk iterates 275 times until it halts reaching a maximum y value of 14 at iteration 111:&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{ll}&lt;br /&gt;
 S(0,1) &amp;amp; \to S(1,1) \to S(3,2) \to S(6,2) \to S(11, 2) \to S(19, 1) \to S(33, 2) \to S(56, 2) \to S(94, 1) \\&lt;br /&gt;
        &amp;amp; \to S(158, 2) \to S(264, 1) \to S(441, 1) \to S(736, 1) \to S(1228, 2) \to S(2048, 3) \\&lt;br /&gt;
        &amp;amp; \vdots \\&lt;br /&gt;
        &amp;amp; \to S(4065328691604230522442358, 13) \\&lt;br /&gt;
        &amp;amp; \to S(6775547819340384204070598, 14) \\&lt;br /&gt;
        &amp;amp; \to S(11292579698900640340117664, 13) \\&lt;br /&gt;
        &amp;amp; \vdots \\&lt;br /&gt;
        &amp;amp; \to S(27930059557111373800280446055462487109112535227834136644, 2) \\&lt;br /&gt;
        &amp;amp; \to S(46550099261852289667134076759104145181854225379723561074, 1) \\&lt;br /&gt;
        &amp;amp; \to S(77583498769753816111890127931840241969757042299539268458, 2) \\&lt;br /&gt;
        &amp;amp; \to S(129305831282923026853150213219733736616261737165898780764, 1) \\&lt;br /&gt;
        &amp;amp; \to S(215509718804871711421917022032889561027102895276497967941, 1) \\&lt;br /&gt;
        &amp;amp; \to S(359182864674786185703195036721482601711838158794163279903, 2) \\&lt;br /&gt;
        &amp;amp; \vdots \\&lt;br /&gt;
        &amp;amp; \to S(5894430516013404355095519889620117404469367857588232386361874, 2) \\&lt;br /&gt;
        &amp;amp; \to S(9824050860022340591825866482700195674115613095980387310603124, 1) \\&lt;br /&gt;
        &amp;amp; \to S(16373418100037234319709777471166992790192688493300645517671874, 0)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
If it were a truly random walk, there would be a 5.9% chance that it takes at least 275 steps to reach 0. So this program is mildly lucky.&lt;br /&gt;
==== BBf(23) ====&lt;br /&gt;
The BBf(23) champion&lt;br /&gt;
&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
   -2 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     2 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt; follows an unbiased [[Collatz-like]] pseudo-random walk:&lt;br /&gt;
let &amp;lt;math&amp;gt;A(x,y)=[0,0,0,x,y]&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;[1,0,0,0,0] \to A(0,2)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(2x,y) \xrightarrow{12x+4} A(5x+1,y+1)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(2x+1,y) \xrightarrow{12x+10} A(5x+4,y-1)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(x,0) \to halt&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(0,2) \to A(1,3) \to A(4,2) \to A(11,3) \to A(29,2) \to A(74,1) \to A(186,2) \to A(466,3) \to A(1166,4) \to A(2916,5) \to A(7291,6) \to \dots&amp;lt;/math&amp;gt;&lt;br /&gt;
==== BBf(24) ====&lt;br /&gt;
The BBf(24) champion&lt;br /&gt;
&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
1 &amp;amp; -1 &amp;amp; -1 &amp;amp; 1 &amp;amp; 0 \\&lt;br /&gt;
-1 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 \\&lt;br /&gt;
0 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 1 \\&lt;br /&gt;
-1 &amp;amp; 2 &amp;amp; 0 &amp;amp; 2 &amp;amp; 0 \\&lt;br /&gt;
0 &amp;amp; 0 &amp;amp; 1 &amp;amp; -1 &amp;amp; 0 \\&lt;br /&gt;
0 &amp;amp; 1 &amp;amp; 1 &amp;amp; 0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt; follows an unbiased [[Collatz-like]] pseudo-random walk: let &amp;lt;math&amp;gt;A(x,y) = [0,0,0,x,y]&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;[1,0,0,0,0] \xrightarrow{3} A(2,2)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(x,0) \xrightarrow{x} halt&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(3x,y) \xrightarrow{9x+5} A(7x+3,y+1)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(3x+1,y) \xrightarrow{9x+6} A(7x+4,y-1)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(3x+2,y) \xrightarrow{9x+10} A(7x+7,y)&amp;lt;/math&amp;gt; if y&amp;gt;0&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(2,2) \to A(7,2) \to A(18,1) \to A(45,2) \to A(108,3) \to A(255,4) \to A(598,5) \to A(1397,4) \to A(3262,4) \to \dots&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
&lt;br /&gt;
=== Size 22: Fenrir ===&lt;br /&gt;
[[File:Fractran 22 Cryptid.webp|alt=The space-time diagram of Fenrir.|thumb|Partial space-time diagram of Fenrir (#29).]]&lt;br /&gt;
&amp;quot;Fenrir&amp;quot; is a family of 3 size 22 [[Cryptids]] discovered by Jason Yuen (@-d) and Claude Opus 4.6 on 22 Mar 2026. Out of 2003 holdouts of size 22, Claude Opus 4.6 used Lean to prove that 1997 holdouts were non-halting and 3 holdouts were halting; the remaining 3 holdouts are the Fenrir family.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1485415054475268179]&amp;lt;/sup&amp;gt; Discord user @ZTS439 shared [https://discord.com/channels/960643023006490684/1438019511155691521/1487251919444508723 some analysis] and a [https://discord.com/channels/960643023006490684/1438019511155691521/1487252789158613002 Python program] for it. Its name comes from [[wikipedia:Norse_mythology|Nordic mythology]]; [[wikipedia:Fenrir|Fenrir]] is the wolf that helps destroy the world during [[wikipedia:Ragnarök|Ragnarök]].&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Holdout number&lt;br /&gt;
!Holdout&lt;br /&gt;
!Vector Representation&lt;br /&gt;
|-&lt;br /&gt;
| 29/2003&lt;br /&gt;
| &amp;lt;code&amp;gt;[1/15, 27/77, 49/3, 10/49, 33/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     3 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    -1 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     2 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -2 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 41/2003&lt;br /&gt;
| &amp;lt;code&amp;gt;[1/15, 49/3, 27/77, 10/49, 33/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     2 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     3 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    -1 \\&lt;br /&gt;
    1 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -2 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 430/2003&lt;br /&gt;
| &amp;lt;code&amp;gt;[27/35, 1/33, 25/3, 22/25, 21/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;     3 &amp;amp;    -1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     2 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;     0 &amp;amp;    -2 &amp;amp;     0 &amp;amp;     1 \\&lt;br /&gt;
   -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
All 3 holdouts follow a biased random walk that somewhat resembles [[Hydra]]. Let &amp;lt;math&amp;gt;S(x,y) = [x, 0, 0, 2, y]&amp;lt;/math&amp;gt; (for 29/2003 and 41/2003) or &amp;lt;math&amp;gt;S(x,y) = [x, 0, 2, y, 0]&amp;lt;/math&amp;gt; (for 430/2003), then:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0] &amp;amp; \xrightarrow{2} &amp;amp; S(0,1) \\&lt;br /&gt;
  S(0, 2y)    &amp;amp; \xrightarrow{23y + 3}  &amp;amp; \text{halt} \\&lt;br /&gt;
  S(x, 2y)    &amp;amp; \xrightarrow{23y + 5} &amp;amp; S(x-1, 5y+2) \\&lt;br /&gt;
  S(x, 2y+1)  &amp;amp; \xrightarrow{23y + 13} &amp;amp; S(x+2, 5y)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The first few visited states are:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(0, 1) \to S(2, 0) \to S(1, 2) \to S(0, 7) \to S(2, 15) \to S(4, 35) \cdots&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Size 23: 11 Hydra-like Cryptids ===&lt;br /&gt;
&lt;br /&gt;
Define &amp;lt;math&amp;gt;Hydra(r_\mathrm{num}, r_\mathrm{den}, x_\mathrm{offset}, y_\mathrm{offset}, (x_\mathrm{init}, y_\mathrm{init}))&amp;lt;/math&amp;gt; to be the problem as follows:&lt;br /&gt;
&lt;br /&gt;
# The initial state is &amp;lt;math&amp;gt;(x_\mathrm{init}, y_\mathrm{init})&amp;lt;/math&amp;gt;.&lt;br /&gt;
# The iteration &amp;lt;math&amp;gt;(x, y) \mapsto (r_\mathrm{num} \times \lfloor x/r_\mathrm{den} \rfloor + x_\mathrm{offset}[x \bmod r_\mathrm{den}], y + y_\mathrm{offset}[x \bmod r_{den}])&amp;lt;/math&amp;gt; is repeated. Here, &amp;lt;math&amp;gt;x_\mathrm{offset}, y_\mathrm{offset}&amp;lt;/math&amp;gt; are 0-indexed.&lt;br /&gt;
# Are all the values of y non-negative?&lt;br /&gt;
&lt;br /&gt;
Furthermore, the Hydra-like problem is considered a [[Cryptids|Cryptid]] if it also satisfies:&lt;br /&gt;
&lt;br /&gt;
# &amp;lt;math&amp;gt;y_\mathrm{offset}&amp;lt;/math&amp;gt; contains a negative number, and the average is positive.&lt;br /&gt;
# &amp;lt;math&amp;gt;x \bmod r_\mathrm{den}&amp;lt;/math&amp;gt; is a pseudorandom sequence.&lt;br /&gt;
#There are no negative values of &amp;lt;math&amp;gt;y&amp;lt;/math&amp;gt; early on.&lt;br /&gt;
&lt;br /&gt;
For example, Fenrir is non-halting if and only if Hydra(5, 2, [2, 0], [-1, 2], (1, 0)). In this Hydra problem, the first few visited states are &amp;lt;math&amp;gt;(1, 0) \to (0, 2) \to (2, 1) \to (7, 0) \to (15, 2) \to (35, 4)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
There are 11 Hydra-like Cryptids of size exactly 23, listed in the table below. All 11 Cryptids are not correlated with each other. Fenrir is included in the table as a reference.&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Domain: Holdout Number&lt;br /&gt;
!Holdout&lt;br /&gt;
!Hydra problem&lt;br /&gt;
!Notes&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #11/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/135, 25/21, 33/5, 2/3, 7/11, 5/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(7, 4, [1, 3, 5, 6], [0, 1, 2, -1], (1, 0))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(22): #29/2003&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/15, 27/77, 49/3, 10/49, 33/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 2, [2, 0], [-1, 2], (1, 0))&lt;br /&gt;
|Fenrir&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #26/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/15, 49/3, 81/77, 10/49, 33/2]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(7, 2, [-1, 8], [3, -1], (1, 2))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #47/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/18, 4/15, 21/2, 121/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 3, [1, 3, 4], [1, 3, -1], (1, 1))&lt;br /&gt;
|If #47 doesn&#039;t halt then Frankenstein&#039;s Monster doesn&#039;t halt&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #77/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[1/54, 4/15, 21/2, 11/3, 5/7, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(7, 4, [0, 2, 4, 5], [0, 1, 2, -1], (1, 0))&lt;br /&gt;
|Same ratio 7/4 as #11&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #151/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[14/15, 1/12, 11/3, 63/2, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(8, 5, [1, 2, 4, 6, 7], [2, -1, 1, 3, 0], (0, 1))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #159/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[14/15, 1/6, 121/3, 63/2, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 3, [1, 2, 4], [3, -1, 1], (1, 3))&lt;br /&gt;
|Same ratio 5/3 as #47&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #207/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[2/15, 1/12, 441/2, 11/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(6, 5, [1, 3, 3, 5, 5], [1, 3, 0, 2, -1], (1, 1))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #218/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[2/15, 1/6, 441/2, 121/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(4, 3, [1, 2, 3], [3, 1, -1], (1, 3))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #317/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[4/15, 1/18, 63/2, 11/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 4, [1, 2, 3, 5], [1, 0, -1, 2], (1, 1))&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #319/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[4/15, 1/24, 21/2, 11/3, 5/7, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(5, 4, [0, 2, 4, 3], [0, 1, 2, -1], (1, 0))&lt;br /&gt;
|Same ratio 5/4 as #317&lt;br /&gt;
|-&lt;br /&gt;
|BBf(23): #323/694&lt;br /&gt;
|&amp;lt;code&amp;gt;[4/15, 1/6, 21/2, 1331/3, 5/7, 2/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
|Hydra(3, 2, [1, 2], [2, -1], (1, 2))&lt;br /&gt;
|If #323 doesn&#039;t halt then Antihydra-like Cryptid doesn&#039;t halt&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
As of August 2026, the 13 unofficial holdouts are as follows: Fenrir, 11 Hydra-like Cryptids of size 23, and #601 &amp;lt;code&amp;gt;[9/10, 1/42, 22/3, 49/2, 5/11, 3/7]&amp;lt;/code&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
==== Frankenstein&#039;s Monster ====&lt;br /&gt;
[[File:Frankenstein&#039;s Monster.webp|alt=Partial space-time diagram of Frankenstein&#039;s Monster.|thumb|Partial space-time diagram of Frankenstein&#039;s Monster.]]&lt;br /&gt;
&amp;quot;Frankenstein&#039;s Monster&amp;quot; is a size 23 [[Cryptid]]. It was created by tweaking a single instruction in the size 22 champion. This tweak switches it from a unbiased random walk to a biased one and thus makes halting probviously impossible. It is called Frankenstein&#039;s Monster since it was found by a combination of exhaustive search and hand design.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1449138938215141478]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;[1/12, 9/10, 14/3, 121/2, 5/7, 3/11]&amp;lt;/code&amp;gt; &amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     2 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Its behavior is extremely similar to the size 22 champion. Let &amp;lt;math&amp;gt;S(x,y) = [0, 0, x, 0, y]&amp;lt;/math&amp;gt;, then:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0]  &amp;amp; \xrightarrow{1}      &amp;amp; S(0,2) \\&lt;br /&gt;
  S(x, 0)      &amp;amp;  =                   &amp;amp; \text{halt} \\&lt;br /&gt;
  S(3k,   y+1) &amp;amp; \xrightarrow{14k+4}  &amp;amp; S(5k+1, y+2) \\&lt;br /&gt;
  S(3k+1, y+1) &amp;amp; \xrightarrow{14k+10} &amp;amp; S(5k+3, y+4) \\&lt;br /&gt;
  S(3k+2, y+1) &amp;amp; \xrightarrow{14k+12} &amp;amp; S(5k+4, y)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with the only difference that the &amp;lt;math&amp;gt;y&amp;lt;/math&amp;gt; values now change by &amp;lt;math&amp;gt;\{+1,+3,-1\}&amp;lt;/math&amp;gt; depending on the value of &amp;lt;math&amp;gt;x\bmod 3&amp;lt;/math&amp;gt; (instead of &amp;lt;math&amp;gt;\{0,+1,-1\}&amp;lt;/math&amp;gt; in the original size 22 program). The &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; values follow the exact same path as in the original size 22 champion, but the y values quickly grow linearly with the number of iterations (as expected by the random model):&lt;br /&gt;
          0: S(0, 1)  @ 1  (0.00s)&lt;br /&gt;
    100_000: S(10^22_185, 100171)  @ 10^22_186  (0.87s)&lt;br /&gt;
    200_000: S(10^44_370, 200187)  @ 10^44_371  (3.42s)&lt;br /&gt;
    300_000: S(10^66_555, 300759)  @ 10^66_556  (7.68s)&lt;br /&gt;
    400_000: S(10^88_740, 400451)  @ 10^88_741  (13.64s)&lt;br /&gt;
    500_000: S(10^110_925, 500421)  @ 10^110_925  (21.28s)&lt;br /&gt;
    600_000: S(10^133_109, 600351)  @ 10^133_110  (30.62s)&lt;br /&gt;
    700_000: S(10^155_294, 700319)  @ 10^155_295  (41.64s)&lt;br /&gt;
    800_000: S(10^177_479, 799911)  @ 10^177_480  (54.30s)&lt;br /&gt;
    900_000: S(10^199_664, 900259)  @ 10^199_665  (68.59s)&lt;br /&gt;
  1_000_000: S(10^221_849, 1000853)  @ 10^221_850  (84.51s)&lt;br /&gt;
 ...&lt;br /&gt;
  4_000_000: S(10^887_395, 4000201)  @ 10^887_396  (1474.02s)&lt;br /&gt;
 ...&lt;br /&gt;
 27_500_000: S(10^6_100_841, 27512703)  @ 10^6_100_842  (87616.45s)&lt;br /&gt;
&lt;br /&gt;
==== Antihydra-like Cryptid ====&lt;br /&gt;
This Cryptid is a size 23 [[Cryptid]]. This Cryptid was [https://discord.com/channels/960643023006490684/1438019511155691521/1449293536737361973 constructed by Maksandchael] by tweaking Frankenstein&#039;s Monster to make it as similar to [[Antihydra]] as possible. &amp;lt;code&amp;gt;[9/10, 1/6, 1331/2, 14/3, 5/7, 3/11]&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp;     2 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     3 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&amp;lt;pre&amp;gt;&lt;br /&gt;
H(a, b) = [0, 0, a-2, 0, b]&lt;br /&gt;
Start -&amp;gt; H(2, 3)&lt;br /&gt;
H(2a, b) -&amp;gt; H(3a, b+2)&lt;br /&gt;
H(2a+1, b+1) -&amp;gt; H(3a+1, b)&lt;br /&gt;
H(a,0) -&amp;gt; halt&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Size 25: Hydra ===&lt;br /&gt;
[[File:Hydra.webp|alt=Partial space-time diagram of Hydra.|thumb|300x300px|Partial space-time diagram of Hydra.]]&lt;br /&gt;
A size 25 program was produced and golfed by hand to simulate [[Hydra]] rules ([https://discord.com/channels/960643023006490684/1438019511155691521/1449829146040467681 Discord]):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;[363/14, 125/2, 22/21, 1/3, 7/11, 14/5]&amp;lt;/code&amp;gt;&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;&lt;br /&gt;
\begin{bmatrix}&lt;br /&gt;
   -1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     2 \\&lt;br /&gt;
   -1 &amp;amp;     0 &amp;amp;     3 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;    -1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     1 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 &amp;amp;    -1 \\&lt;br /&gt;
    1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;     1 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The intended interpretation is that if we let &amp;lt;math&amp;gt;S(h,w) = [1, 0, w, h-3, 0]&lt;br /&gt;
&amp;lt;/math&amp;gt; then it follows the following rules:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,\dots]  &amp;amp; =     &amp;amp; S(3, 0) \\&lt;br /&gt;
  S(2k,   0)   &amp;amp; \to^* &amp;amp; \text{halt} \\&lt;br /&gt;
  S(2k,   w+1) &amp;amp; \to^* &amp;amp; S(3k,   w) \\&lt;br /&gt;
  S(2k+1, w)   &amp;amp; \to^* &amp;amp; S(3k+1, w+2)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Size 48: BMO 6 (&amp;quot;Space Needle&amp;quot;) ===&lt;br /&gt;
[[File:Space Needle.webp|alt=Partial space-time diagram of Space Needle.|thumb|Partial space-time diagram of Space Needle.]]&lt;br /&gt;
A size 48 program was produced by hand to simulate [https://wiki.bbchallenge.org/wiki/1RB1LA_1LC0RE_1LF1LD_0RB0LA_1RC1RE_---0LD BMO 6] rules ([https://discord.com/channels/960643023006490684/1438019511155691521/1441137371046482071 Discord])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;[77/2, 2/99, 17/33, 13/11, 285/119, 17/19, 1375/51, 1/17, 3/5, 243/7, 10/13]&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
    -1 &amp;amp;    0 &amp;amp;     0 &amp;amp;     1 &amp;amp;     1 &amp;amp;     0 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    1 &amp;amp;    -2 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;    1 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     1 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    1 &amp;amp;     1 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    1 \\&lt;br /&gt;
    0 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;    1 &amp;amp;    -1 \\&lt;br /&gt;
    0 &amp;amp;    -1 &amp;amp;     3 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;    -1 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    1 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    0 &amp;amp;    5 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;    0 &amp;amp;    0 \\&lt;br /&gt;
    1 &amp;amp;    0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;    0 &amp;amp;    0&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;&amp;lt;pre&amp;gt;A(a, b) = B^a C^b E or B^(a-2) C^b D E&lt;br /&gt;
&lt;br /&gt;
Start: A(7, 1)&lt;br /&gt;
&lt;br /&gt;
A(1, b) --&amp;gt; halt&lt;br /&gt;
&lt;br /&gt;
A(2a, b) --&amp;gt; A(5a+b+2, 1)&lt;br /&gt;
&lt;br /&gt;
A(2a+1, b) --&amp;gt; A(b-1, b+c+3)&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other notable machines ==&lt;br /&gt;
&lt;br /&gt;
=== Size 24: Energy Vampire ===&lt;br /&gt;
The size 24 machine &amp;lt;code&amp;gt;[2/15, 1/6, 441/2, 11/3, 25/7, 6/11]&amp;lt;/code&amp;gt;, or &amp;lt;math&amp;gt;\begin{bmatrix}&lt;br /&gt;
1 &amp;amp; -1 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 \\&lt;br /&gt;
-1 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 0 \\&lt;br /&gt;
-1 &amp;amp; 2 &amp;amp; 0 &amp;amp; 2 &amp;amp; 0 \\&lt;br /&gt;
0 &amp;amp; -1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 1 \\&lt;br /&gt;
0 &amp;amp; 0 &amp;amp; 2 &amp;amp; -1 &amp;amp; 0 \\&lt;br /&gt;
1 &amp;amp; 1 &amp;amp; 0 &amp;amp; 0 &amp;amp; -1&lt;br /&gt;
\end{bmatrix}&amp;lt;/math&amp;gt;, discovered by Jason Yuen (@-d) and Claude Opus 5.5, follows a particularly lucky unbiased pseudo-random walk.&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;A(x,y) = [0, 0, 0, 2x, y]&amp;lt;/math&amp;gt;, then:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1563398072040427611]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,0,0,0]  &amp;amp; \xrightarrow{3}      &amp;amp; A(1, 2) \\&lt;br /&gt;
  A(x, 0)      &amp;amp;  \xrightarrow{2x} &amp;amp; [0, 0, 4x, 0, 0] \ (\text{halt}) \\&lt;br /&gt;
  A(3k,   y + 1) &amp;amp; \xrightarrow{30k + 2}  &amp;amp; S(8k, y) \\&lt;br /&gt;
  A(3k + 1, y + 1) &amp;amp; \xrightarrow{30k + 13} &amp;amp; S(8k + 3, y + 1) \\&lt;br /&gt;
  A(3k + 2, y + 1) &amp;amp; \xrightarrow{30k + 24} &amp;amp; S(8k + 6, y + 2) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This corresponds to the Hydra problem Hydra(8, 3, [0, 3, 6], [-1, 0, 1], (1, 1)).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1563346300139864074]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This machine iterates this pseudo-random walk over 2&amp;lt;sup&amp;gt;38&amp;lt;/sup&amp;gt; times;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1564736905344454677]&amp;lt;/sup&amp;gt; it should be probabilistically guaranteed to halt (assuming Collatz-like behavior is random). @-d is currently verifying a simulation that claims the machine halts after over 1.714 × 10&amp;lt;sup&amp;gt;210,914,744,116&amp;lt;/sup&amp;gt; steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1565647448452636672]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A(1,2) \to A(3,2) \to A(8,1) \to A(22,2) \to A(59,2) \to A(158,3) \to A(422,4) \to A(1126,5) \to A(3003,5) \to A(8008,4) \to \dots&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This machine is the [[Beaver Math Olympiad]]&#039;s 12th problem.&lt;br /&gt;
&lt;br /&gt;
=== Size 36: BMO1 ===&lt;br /&gt;
[[File:Ftran bmo1.png|alt=Partial space-time diagram of BMO 1.|thumb|Partial space-time diagram of BMO 1.]]&lt;br /&gt;
A size 36 program was produced by hand to simulate [[BMO1]] rules ([https://discord.com/channels/960643023006490684/1438019511155691521/1440018895212642424 Discord]):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;[153/55, 2/11, 26/35, 3/7, 11/17, 7/13, 25/6, 55/2, 14/3]&amp;lt;/code&amp;gt;&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;&lt;br /&gt;
\begin{bmatrix}&lt;br /&gt;
    0 &amp;amp;    2 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;    1 \\&lt;br /&gt;
    1 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;    0 \\&lt;br /&gt;
    1 &amp;amp;    0 &amp;amp;     -1 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 \\&lt;br /&gt;
   0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
   0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     -1 \\&lt;br /&gt;
    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;    1 &amp;amp;     0 &amp;amp;     -1 &amp;amp;     0 \\&lt;br /&gt;
    -1 &amp;amp;     -1 &amp;amp;     2 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    -1 &amp;amp;     0 &amp;amp;    1 &amp;amp;     0 &amp;amp;     1 &amp;amp;     0 &amp;amp;     0 \\&lt;br /&gt;
    1 &amp;amp;     -1 &amp;amp;     0 &amp;amp;     1 &amp;amp;    0 &amp;amp;     0 &amp;amp;     0&lt;br /&gt;
\end{bmatrix}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;A(a,b) = [a, b, 0, 0, 0, 0, 0]&amp;lt;/math&amp;gt;, then it follows the rules:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  [1,0,\dots] &amp;amp; \xrightarrow{4}&amp;amp; A(1, 2) \\&lt;br /&gt;
  A(a, b) &amp;amp; \xrightarrow{5b+4}&amp;amp; A(a-b, 4b+2) &amp;amp; \text{if } a &amp;gt; b \\&lt;br /&gt;
  A(a, b) &amp;amp; \xrightarrow{5a+2} &amp;amp; A(2a+1, b-a) &amp;amp; \text{if } a &amp;lt; b \\&lt;br /&gt;
  A(a, b) &amp;amp; \xrightarrow{a} &amp;amp; \text{Halt} &amp;amp; \text{if } a = b&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Functions]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Beeping_Busy_Beaver&amp;diff=10615</id>
		<title>Beeping Busy Beaver</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Beeping_Busy_Beaver&amp;diff=10615"/>
		<updated>2026-11-12T20:51:36Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Champions */ Add info about actually beep state&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The &#039;&#039;&#039;Beeping Busy Beaver&#039;&#039;&#039; (BBB) function is a variant of the [[Busy Beaver Functions|Busy Beaver function]] proposed by Scott Aaronson in his 2020 [[Busy Beaver Frontier]] survey.&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;Scott Aaronson. &amp;quot;The Busy Beaver Frontier&amp;quot;. https://www.scottaaronson.com/papers/bb.pdf&amp;lt;/ref&amp;gt; It is notable because it is uncomputable even if you have access to a halting oracle for Turing Machines. These can simulate problems in Π₂ and Σ₂ of the [[wikipedia:Arithmetic hierarchy|arithmetic hierarchy]], such as the [[wikipedia:Collatz conjecture|Collatz conjecture]] and [[wikipedia:Twin prime#Twin prime conjecture|twin prime conjecture]].&lt;br /&gt;
&lt;br /&gt;
== Definition ==&lt;br /&gt;
Consider a &#039;&#039;beeping Turing machine&#039;&#039;, which is a [[Turing machine]] that has a special state named &amp;quot;beep state&amp;quot;. Every time the TM enters the &amp;quot;beep state&amp;quot; it &#039;&#039;beeps&#039;&#039;. The machine may beep finitely many times (possibly zero) or infinitely many times. Nick Drozd coined the term [[Quasihalt|quasihalting]] to describe the event when a TM last beeps. A TM quasihalts if it beeps only a finite number of times.&amp;lt;ref&amp;gt;Nick Drozd. 2020. [https://nickdrozd.github.io/2020/08/13/beeping-busy-beavers.html Beeping Busy Beavers].&amp;lt;/ref&amp;gt; The Beeping Busy Beaver problem is analogous to the Busy Beaver problem, replacing halting with quasihalting. In other words, let &amp;lt;math&amp;gt;b(M)&amp;lt;/math&amp;gt; be the number of steps the machine M takes until it quasihalts (beeps for the last time) if it quasihalts (we will say &amp;lt;math&amp;gt;b(M) = \infty&amp;lt;/math&amp;gt; if the TM never stops beeping); set &amp;lt;math&amp;gt;b(M)=0&amp;lt;/math&amp;gt; if it never beeps. Then&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\operatorname{BBB}(n) := \max_{{M \in T(n)\ :\ b(M) &amp;lt; \infty}} b(M)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;T(n)&amp;lt;/math&amp;gt; is the set of Turing machines with &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; states and two symbols.&lt;br /&gt;
&lt;br /&gt;
Note that quasihalting does not require halting, so we can consider Turing machines which have no halt transitions. Thus the [[Tree Normal Form]] algorithm needs to be modified (to allow TMs with no halt transitions) when searching for BBB champions.&lt;br /&gt;
&lt;br /&gt;
Another way to define BBB is to have Turing machines have a special beep transition instead of an entire beep state. Both conventions are denoted BBB here; specify the convention when comparing state counts or last-beep times. For example, Charlie Reams&#039;s 18-state twin-prime machine uses the transition from state N reading 0, while [[User:GregoryMorse|GregoryMorse]]&#039;s 19-state machine uses beep state F.&amp;lt;ref&amp;gt;[https://github.com/calr3/tinycryptids/tree/main/twinprimes Reams&#039;s twin-prime machine]; [https://github.com/GregoryMorse/NP-complete/blob/main/twin/README.md GregoryMorse&#039;s twin-prime machine].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Growth rate ==&lt;br /&gt;
&lt;br /&gt;
It is easy to see that &amp;lt;math&amp;gt;\operatorname{BBB}(n) \ge \operatorname{BB}(n)&amp;lt;/math&amp;gt;, by letting the beep state be the state that is reached immediately before the halt state.&lt;br /&gt;
&lt;br /&gt;
In fact, BBB grows much faster than BB. BBB eventually dominates any computable function augmented with an oracle for computing BB. So, for example, there exists some N such that for all n &amp;gt; N:&lt;br /&gt;
&lt;br /&gt;
* &amp;lt;math&amp;gt;BBB(n) &amp;gt; BB(BB(n))&amp;lt;/math&amp;gt;&lt;br /&gt;
* &amp;lt;math&amp;gt;BBB(n) &amp;gt; BB^n(n)&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;BB^k&amp;lt;/math&amp;gt; represents k iterations of BB&lt;br /&gt;
* &amp;lt;math&amp;gt;BBB(n) &amp;gt; BB^{BB(n)}(n)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
etc.&lt;br /&gt;
&lt;br /&gt;
== Champions ==&lt;br /&gt;
This table considers beep states.&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Domain&lt;br /&gt;
!Max Steps&lt;br /&gt;
!Champions&lt;br /&gt;
!Beep&amp;amp;nbsp;State&lt;br /&gt;
!Notes&lt;br /&gt;
|-&lt;br /&gt;
|BBB(1)&lt;br /&gt;
|1&lt;br /&gt;
|{{TM|1RZ---|halt}}&lt;br /&gt;
|A&lt;br /&gt;
|Case analysis by Scott Aaronson.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BBB(2)&lt;br /&gt;
|6&lt;br /&gt;
|{{TM|1RB1LB_1LB1LA|non_halt}}&lt;br /&gt;
|A&lt;br /&gt;
|Case analysis by Scott Aaronson.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BBB(3)&lt;br /&gt;
|55&lt;br /&gt;
|{{TM|1RB0LB_1LA0RC_1LC1LA|non_halt}}&lt;br /&gt;
|B&lt;br /&gt;
|Claimed as a lower bound by Scott Aaronson, verified with exhaustive search by Nick Drozd.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&amp;lt;ref&amp;gt;Nick Drozd blog comment, 2021. https://scottaaronson.blog/?p=5661#comment-1900343&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BBB(4)&lt;br /&gt;
|32,779,478&lt;br /&gt;
|{{TM|1RB1LD_1RC1RB_1LC1LA_0RC0RD|non_halt}}&lt;br /&gt;
|D&lt;br /&gt;
|Proven in Coq.&amp;lt;ref name=&amp;quot;:Coq-BBB4&amp;quot;&amp;gt;John Carrino, &amp;quot;[https://github.com/carrino/Coq-BBB4 Coq-BBB4]&amp;quot;&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BBB(5)&lt;br /&gt;
|&amp;gt; 10&amp;lt;sup&amp;gt;14,006&amp;lt;/sup&amp;gt;&lt;br /&gt;
|{{TM|1RB1LE_0LC0LB_0LD1LC_1RD1RA_0RC0LA|non_halt}}&lt;br /&gt;
|C&lt;br /&gt;
|Best known, per Nick Drozd.&amp;lt;ref&amp;gt;Nick Drozd. https://scottaaronson.blog/?p=8088#comment-1981333&amp;lt;/ref&amp;gt; Probably &amp;gt;&amp;lt;math&amp;gt;10^{10^{10^5}}&amp;lt;/math&amp;gt; due to four [[probviously]] quasihalting [[Cryptids]].&amp;lt;ref&amp;gt;Shawn Ligocki. 2022. [https://www.sligocki.com/2022/04/03/mother-of-giants.html Mother of Giants].&amp;lt;/ref&amp;gt; &lt;br /&gt;
|-&lt;br /&gt;
|BBB(2,3)&lt;br /&gt;
|59&lt;br /&gt;
|{{TM|1RB2LB1LA_2LB2RA0RA|non_halt}}&lt;br /&gt;
|A&lt;br /&gt;
|Per Nick Drozd.&amp;lt;ref&amp;gt;Nick Drozd, &amp;quot;[https://nickdrozd.github.io/2025/03/24/bbb-3-3.html BBB(3,3) &amp;gt; 10↑↑6]&amp;quot;. Blog post. Accessed 15 August 2025.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BBB(3,3)&lt;br /&gt;
|&amp;gt; 10 ↑↑ 6.74&lt;br /&gt;
|{{TM|1RB0LB2LA_1LA0RC0LB_2RC2RB0LC|non_halt}}&lt;br /&gt;
|B&lt;br /&gt;
|Best known, per Nick Drozd.&amp;lt;ref name=&amp;quot;:Nick Drozd Tetrational Blank26&amp;quot;&amp;gt;Nick Drozd, &amp;quot;[https://nickdrozd.github.io/2026/09/01/tetrational-self-cleaning-turing-machine.html A Tetrational Self-Cleaning Turing Machine]&amp;quot;. Blog post. Accessed 17 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BBB(2,4)&lt;br /&gt;
|&amp;gt; &amp;lt;math&amp;gt;2 \times 10^{23}&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB2LA1RA1LB_0LB2RB3RB1LA|non_halt}}&lt;br /&gt;
|A&lt;br /&gt;
|Best known, per Nick Drozd.&amp;lt;ref&amp;gt;Nick Drozd. &amp;quot;[https://nickdrozd.github.io/2022/02/11/latest-beeping-busy-beaver-results.html Latest Beeping Busy Beaver Results]&amp;quot;. Accessed 15 August 2025.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
All known champions quasihalt by becoming [[Translated Cycler|Translated Cyclers]], a property which is known to be weaker than the general quasihalting condition.&lt;br /&gt;
&lt;br /&gt;
==Beeping Booping Busy Beavers==&lt;br /&gt;
A further extension devised by Bram Cohen is as follows: a Turing machine has two special transitions, a beep transition and a boop transition, both of which may repeat infinitely often. The machine &amp;quot;outputs&amp;quot; an integer sequence, indicated by the number of beeps between successive boops. If any such integer is repeated an infinite number of times, the machine is said to &#039;&#039;&#039;pseudoquasihalt&#039;&#039;&#039;. Now if we define &amp;lt;math&amp;gt;g(M)&amp;lt;/math&amp;gt; as the number of transitions for machine M to finish outputting that infinitely-repeated value for the first time (or ∞ if there is no such value), the Beeping Booping Busy Beaver number is:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\operatorname{BBBB}(n) := \max_{{M \in T(n)\ :\ g(M) &amp;lt; \infty}} g(M)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
These machines are equivalent to Turing machines with second-order oracles, and so their pseudoquasihalting behavior can describe sets in Π₃ and Σ₃ of the [[wikipedia:Arithmetic hierarchy|arithmetic hierarchy]].&amp;lt;ref&amp;gt;Bram Cohen. 2023. [https://bramcohen.com/p/beeping-booping-busy-beavers Beeping Booping Busy Beavers].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
There are multiple models to choose from, depending on whether one allows multiple beep transitions and multiple boop transitions, or only one of each, or only one boop transition while making every transition a beep transition. All of these models have the same computational strength and corresponding growth rate, but each has its own advantages. The first is the most general, including all machines from the other two, and in that sense it is more natural, but that makes the space of candidate machines to search through significantly larger. The second is the original definition and it is relatively simple. The third is equivalent to simply considering the amount of time between successive boops, instead of the number of beeps between successive boops, and has the smallest space of candidate machines. It is not yet decided which of these models (or perhaps a model different from all three) should be chosen for &amp;quot;the&amp;quot; BBBB function.&lt;br /&gt;
&lt;br /&gt;
=== BBBB champions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Domain&lt;br /&gt;
!Value&lt;br /&gt;
!Champions&lt;br /&gt;
!Notes&lt;br /&gt;
|-&lt;br /&gt;
|BBBB(1)&lt;br /&gt;
|2&lt;br /&gt;
|{{TM|0RA---|non_halt}} (beep: any, boop: A0)&lt;br /&gt;
|Confirmed.&amp;lt;ref&amp;gt;racheline, September 2025. [https://discord.com/channels/960643023006490684/1243312334907375676/1417839422191308871 Discord message]&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BBBB(2)&lt;br /&gt;
|18&lt;br /&gt;
|{{TM|0RB1LB_1LA1RB|non_halt}} (beep: A0, boop: A1)&lt;br /&gt;
|Confirmed by exhaustive search.&amp;lt;ref&amp;gt;Charlie Reams. October 2026. [https://discord.com/channels/960643023006490684/1243312334907375676/1565879387927224474 Discord message]&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BBBB(3)&lt;br /&gt;
|≥ 127&lt;br /&gt;
|{{TM|1RB1LB_0RC0LA_1LC0LA|non_halt}} (beep: A0, boop: B1)&lt;br /&gt;
|Holdouts: 935.&amp;lt;ref name=&amp;quot;calr3-bbbb&amp;quot;&amp;gt;Charlie Reams, GitHub https://github.com/calr3/bbbb&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BBBB(2, 3)&lt;br /&gt;
|≥ 187&lt;br /&gt;
|{{TM|2RB2LA1RA_1LB1LA0RB|non_halt}} (beep: B0, boop: B2)&lt;br /&gt;
|Holdouts: &amp;gt;2000.&amp;lt;ref name=&amp;quot;calr3-bbbb&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Higher-order Beavers==&lt;br /&gt;
For higher order functions, using https://katelyndoucette.com/articles/building-the-busy-beaver-ladder definition, we can get BBBBB(1) = 2 and BBBBB(2) ≥ 18.&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
[[category:Functions]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Tree_Normal_Form&amp;diff=10614</id>
		<title>Tree Normal Form</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Tree_Normal_Form&amp;diff=10614"/>
		<updated>2026-11-12T20:06:52Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Number of TNF TMs */ Mention what n and m are&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Tree Normal Form (TNF)&#039;&#039;&#039; is the unique standard [[Turing machine]] transition table representation for a class of TMs that has the same behaviour on the empty tape. TNF is also often used to describe the process for enumerating all TMs in Tree Normal Form. This process was first introduced by Allen Brady in his 1964 PhD dissertation&amp;lt;ref&amp;gt;Allen Brady. 1964. PhD dissertation. &amp;quot;[https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/zk51vk21c Solutions of restricted cases of the halting problem applied to the determination of particular values of a non-computable function]&amp;quot;&amp;lt;/ref&amp;gt; and thus it has been called &#039;&#039;&#039;Brady&#039;s algorithm&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
== Background ==&lt;br /&gt;
Radó&#039;s original definition of a Busy Beaver TM allows any choice of (write symbol, move direction, next state) for every (current state, read symbol) combination. For n-states, m-symbols that leads to &amp;lt;math&amp;gt;N(n,m) = (2m(n+1))^{mn}&amp;lt;/math&amp;gt; distinct TMs (Note: there are &amp;lt;math&amp;gt;n+1&amp;lt;/math&amp;gt; next states for the n run states and 1 halt state). But for the purposes of searching for Busy Beavers, these contain a lot of redundant TMs. Some notable redundancies are:&lt;br /&gt;
&lt;br /&gt;
# [[Permutation|Permutations]]: Any permutation of non-start states, non-blank symbols or directions leads to a functionally equivalent TM.&lt;br /&gt;
# Unused transitions: If the TM (when started on a blank tape) does not actually use all transitions, then the behavior of this TM is identical for all choices of those transitions.&lt;br /&gt;
# Halting transitions: Any of the 2m choices for halting transitions lead to the same runtime (and any of &amp;lt;math&amp;gt;2(m-1)&amp;lt;/math&amp;gt; lead to same sigma score).&lt;br /&gt;
# Number of halting transitions: Any TM without any halting transitions can (obviously) never halt, so they can be ignored for the purposes of solving the Busy Beaver problem.&lt;br /&gt;
&lt;br /&gt;
In order to (significantly) reduce the search space, TNF requires that the TM satisfy the following:&lt;br /&gt;
&lt;br /&gt;
# Canonical permutation: All states (and symbols) are used in order when run on a blank tape. The first move direction is Right.&lt;br /&gt;
# Undefined transitions: All unused transitions are marked as blank/undefined &amp;lt;code&amp;gt;---&amp;lt;/code&amp;gt;.&lt;br /&gt;
# Unique halting transition: All halting transitions are of the form &amp;lt;code&amp;gt;1RZ&amp;lt;/code&amp;gt;.&lt;br /&gt;
# Require halting transition: TMs must have at least one undefined (&amp;lt;code&amp;gt;---&amp;lt;/code&amp;gt;) or halting (&amp;lt;code&amp;gt;1RZ&amp;lt;/code&amp;gt;) transition.&lt;br /&gt;
&lt;br /&gt;
== TNF Enumeration ==&lt;br /&gt;
TNF enumeration is a process for enumerating all TMs in TNF by recursively expanding a &amp;quot;family tree&amp;quot; of machines:&lt;br /&gt;
&lt;br /&gt;
* Start with a completely undefined TM of the desired size, this is the root node. Ex &amp;lt;code&amp;gt;------_------&amp;lt;/code&amp;gt; for BB(2).&lt;br /&gt;
* For each unexplored node, run that TM on a blank tape until it reaches an undefined transition (or you give up searching).&lt;br /&gt;
* If you reach an undefined transition, then create children nodes from this node for all choices of transitions.&lt;br /&gt;
** One option for transition is always the single halting transition &amp;lt;code&amp;gt;1RZ&amp;lt;/code&amp;gt;.&lt;br /&gt;
** If there is at least one more undefined transition (besides this one being filled in now) then we also allow all combinations of transitions with the following restrictions:&lt;br /&gt;
*** The next state may be any previously visited state or the next unvisited state.&lt;br /&gt;
*** The write symbol may be any previously used symbol or the next unused symbol.&lt;br /&gt;
*** If we are expanding the first transition of the machine, the direction must be Right.&lt;br /&gt;
*Repeat this on every leaf node (which contains at least one undefined transition). &lt;br /&gt;
This enumeration is complete if every leaf node is either a halting TM or an infinite TM that never reaches its undefined transitions. Unfortunately, there is no programmatic way to ensure you are done because that would require solving the halting problem. Instead it is often helpful to think of TNF enumeration as an iterated process in which the tree is expanded as much as possible early on, but then iteratively refined over time as new leafs are proven to reach undefined transitions.&lt;br /&gt;
&lt;br /&gt;
== TNF-1RB ==&lt;br /&gt;
One common additional restriction is that the initial transition is &amp;lt;code&amp;gt;A0→1RB&amp;lt;/code&amp;gt;. This is mainly done to exclude &amp;lt;code&amp;gt;A0→0RB&amp;lt;/code&amp;gt; TMs. For any TM starting from &amp;lt;code&amp;gt;A0→0RB&amp;lt;/code&amp;gt;, the TM that starts in state B instead will have the same exact Σ score and run for exactly one step less. By iterating this process at most &amp;lt;math&amp;gt;n - 1&amp;lt;/math&amp;gt; times, any &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;-state &amp;lt;code&amp;gt;A0→0RB&amp;lt;/code&amp;gt; machine can be transformed into a corresponding &amp;lt;code&amp;gt;A0→1RB&amp;lt;/code&amp;gt; machine with the same Σ score and (at most) &amp;lt;math&amp;gt;n-1&amp;lt;/math&amp;gt; shorter runtime.&lt;br /&gt;
&lt;br /&gt;
Many early enumerations chose to use the &amp;lt;code&amp;gt;A0→1RB&amp;lt;/code&amp;gt; restriction because they were specifically searching for Σ. It can also be used when searching for the step champion, but requires some post-processing to check the near-champions for any state permutations that might lead to a few more steps.&lt;br /&gt;
&lt;br /&gt;
== Number of TNF TMs ==&lt;br /&gt;
The table below lists known TM counts for TNF, TNF-1RB alongside total counts of all TMs in each 2-symbol [[:Category:BB Domains|domain]].&lt;br /&gt;
&lt;br /&gt;
* # Total TMs is the function &amp;lt;math&amp;gt;N(n,m) = (2m(n+1))^{mn}&amp;lt;/math&amp;gt; of all n-state, m-symbol TMs with every combination of halting transition.&lt;br /&gt;
* # Simple Halt TMs is a slight simplification where the only allowed halt transition is &amp;lt;code&amp;gt;1RZ&amp;lt;/code&amp;gt;. There are &amp;lt;math&amp;gt;(2mn + 1)^{mn}&amp;lt;/math&amp;gt; Simple Halt n-state, m-symbol TMs.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: right;&amp;quot;&lt;br /&gt;
|+TNF TM counts vs Total TM counts&lt;br /&gt;
!&lt;br /&gt;
!# Total TMs ([[oeis:A052200|OEIS A052200]])&lt;br /&gt;
!# Simple Halt TMs&lt;br /&gt;
!# TNF TMs&lt;br /&gt;
!# TNF-1RB TMs&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2)]]&lt;br /&gt;
|20,736&lt;br /&gt;
|6,561&lt;br /&gt;
|61&lt;br /&gt;
|41&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3)]]&lt;br /&gt;
|16,777,216&lt;br /&gt;
|4,826,809&lt;br /&gt;
|5,417&lt;br /&gt;
|4,057&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4)]]&lt;br /&gt;
|25,600,000,000&lt;br /&gt;
|6,975,757,441&lt;br /&gt;
|858,909&lt;br /&gt;
|620,261&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(5)]]&lt;br /&gt;
|63,403,380,965,376&lt;br /&gt;
|16,679,880,978,201&lt;br /&gt;
|181,385,789&lt;br /&gt;
|126,891,605&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|232,218,265,089,212,416&lt;br /&gt;
|59,604,644,775,390,625&lt;br /&gt;
|&lt;br /&gt;
|~33,436,000,000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Other Models ==&lt;br /&gt;
Many other computational models, like lambda calculus or fractran may have TNF enumeration. It consists to enumerate only parts of programs that are executed so if the beginning of a program is nonhalting, the rest is not generated because it would still be nonhalting.&lt;br /&gt;
&lt;br /&gt;
== See Also ==&lt;br /&gt;
&lt;br /&gt;
* Something Something Programming, &amp;quot;[https://nickdrozd.github.io/2022/01/14/bradys-algorithm.html Brady&#039;s Algorithm for Program Generation]&amp;quot; (2022).&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF&amp;diff=10537</id>
		<title>1RB0RA 1LC1LF 1RD0LB 1RA1LE 1RZ0LC 1RG1LD 0RG0RF</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF&amp;diff=10537"/>
		<updated>2026-11-11T04:13:07Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Fix a few error details discovered by Poshify&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF}}&lt;br /&gt;
{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF|halt}} is a former [[BB(7)]] [[champion]], running for over &amp;lt;math&amp;gt;2 \uparrow^{11} 2 \uparrow^{11} 3&amp;lt;/math&amp;gt; steps before it halts. It was discovered by Pavel Kropitz on 10 May 2025 ([https://discord.com/channels/960643023006490684/1369339127652159509/1370678203395604562 Discord link]) and analyzed by Shawn Ligocki (here) on 13 May 2025.&lt;br /&gt;
&lt;br /&gt;
== Analysis by [[User:Sligocki|Shawn Ligocki]] ==&lt;br /&gt;
Consider general configurations matching the regex:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;0^\infty \; 11 \; (1 \; (01)^*)^* \; 0011100 \; \textrm{A}\textrm{&amp;gt;} \; 0^\infty&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Low level rules ===&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
              01 1 01^n 0011100 A&amp;gt; 00   --&amp;gt;                 1 01^n+2 0011100 A&amp;gt;&lt;br /&gt;
           01^3 11 01^n 0011100 A&amp;gt; 0^6  --&amp;gt;            1 01^n+5 1 01 0011100 A&amp;gt;&lt;br /&gt;
01^3 (1 01)^k+1 11 01^n 0011100 A&amp;gt; 0^6  --&amp;gt;  1 01^n+6 (1 01)^k 11 01 0011100 A&amp;gt;&lt;br /&gt;
 011 (1 01)^k   11 01^n 0011100 A&amp;gt; 0^2  --&amp;gt;  1 Z&amp;gt; 111 01^n+1 00 101^k+2&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Mid level rules ===&lt;br /&gt;
Let&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;&lt;br /&gt;
B(a; b, c, ..., z) = 0^\infty \; 111 \; (01)^{3z+1} \; 1 \; \cdots \; 1 (01)^{3c+1} \; 1 \; (01)^{3b+1} \; 1 \; (01)^0 \; 1 \; (01)^{3a+1} \; 0011100 \; \textrm{A}\textrm{&amp;gt;} \; 0^\infty&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and let &amp;lt;code&amp;gt;B(a; [x]*k, y, ...)&amp;lt;/code&amp;gt; = &amp;lt;math&amp;gt;B(a; \underbrace{x, \cdots, x}_k, y, ...)&amp;lt;/math&amp;gt; (In other words, &amp;lt;code&amp;gt;[x]*k&amp;lt;/code&amp;gt; represents k repeats of the value x in a config).&lt;br /&gt;
&lt;br /&gt;
then&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
B(a; b+1, ...) -&amp;gt; B(2a+4; b, ...)&lt;br /&gt;
B(a; [0]*k, 0, n+1, ...) -&amp;gt; B(0; [0]*k, a+2, n, ...)&lt;br /&gt;
B(a; [0]*k) -&amp;gt; Halt(3a + 2k + 10)&lt;br /&gt;
&lt;br /&gt;
Start at step 8574: B(4, [1]*12)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== High level rule ===&lt;br /&gt;
Let&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{l}&lt;br /&gt;
g_0(x)     &amp;amp; = &amp;amp; 2x + 4 \\&lt;br /&gt;
g_{k+1}(x) &amp;amp; = &amp;amp; g_k^{x+2}(0) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
then&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;&lt;br /&gt;
B(a; \underbrace{0, \cdots, 0}_k, n, ...) \to B(g_k^n(a); \underbrace{0, \cdots, 0}_k, 0, ...)&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Bound ===&lt;br /&gt;
Let&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{l}&lt;br /&gt;
a_0 &amp;amp; = &amp;amp; 4 \\&lt;br /&gt;
a_{k+1} &amp;amp; = &amp;amp; g_k(a_k) \\&lt;br /&gt;
\end{array}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
then&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;&lt;br /&gt;
B(a_0; \underbrace{1, \cdots, 1}_k)&lt;br /&gt;
    \to B(a_k, \underbrace{0, \cdots, 0}_k)&lt;br /&gt;
    \to \text{Halt}(3 a_k + 2 k + 9)&lt;br /&gt;
&amp;lt;/math&amp;gt;and&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;&lt;br /&gt;
\text{Start} \to B(a_0; \underbrace{1, \cdots, 1}_{12})&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and so this TM halts with a sigma score of &amp;lt;math&amp;gt; \sigma = 3 a_{12} + 34 &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Note that &amp;lt;math&amp;gt;g_k(x) = (2 \uparrow^k (x+4)) - 4&amp;lt;/math&amp;gt; and so for &amp;lt;math&amp;gt;k \ge 2&amp;lt;/math&amp;gt;,&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;a_{k+1}+4&amp;gt;2\uparrow^k 2 \uparrow^k 3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and so this TM halts with sigma score &amp;lt;math&amp;gt;\sigma &amp;gt; 2 \uparrow^{11} 2 \uparrow^{11} 3&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
This bound is pretty tight: &amp;lt;math&amp;gt;\sigma &amp;lt; 2 \uparrow^{11} 2 \uparrow^{11} 4 = 2 \uparrow^{12} 4 = 2 \uparrow^{13} 3 &amp;lt;/math&amp;gt;.&lt;br /&gt;
[[Category:BB(7)]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Champions&amp;diff=10532</id>
		<title>Champions</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Champions&amp;diff=10532"/>
		<updated>2026-11-10T21:03:28Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: &amp;quot;Champions&amp;quot; is not an &amp;quot;Individual Machine&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Busy Beaver &#039;&#039;&#039;Champions&#039;&#039;&#039; are the current record holding [[Turing machine|Turing machines]] which maximize a [[Busy Beaver function]]. In this article we focus specifically on the longest running TMs. Some have been proven to be the longest running of all (and so are the ultimate champion) while others are only current champions and may be usurped in the future. For smaller domains, Pascal Michel&#039;s website is the canonical source for [https://bbchallenge.org/~pascal.michel/bbc Busy Beaver champions] and the [https://bbchallenge.org/~pascal.michel/ha History of Previous Champions]. 1-state domains are omitted as [[BB(1,m)]] = 1 for m &amp;gt; 1.&lt;br /&gt;
&lt;br /&gt;
== Trivial Champions ==&lt;br /&gt;
[[BB(n,1)]] = n&lt;br /&gt;
&lt;br /&gt;
[[BB(1,m)]] = 1&lt;br /&gt;
&lt;br /&gt;
== 2-Symbol TMs ==&lt;br /&gt;
Rows are blank if no champion has been found which surpasses a smaller size problem. Also take note that the &amp;lt;math&amp;gt;f_{x}(n)&amp;lt;/math&amp;gt; used in the lower bounds represent the [[Fast-Growing Hierarchy]] while &amp;lt;math&amp;gt;\uparrow&amp;lt;/math&amp;gt; represents [[wikipedia:Knuth&#039;s_up-arrow_notation|Knuth&#039;s up-arrow notation]]; see [[measuring large numbers]] for more information. Machines below 6 states are listed in [[Tree Normal Form|TNF]] format, where machines which tie for champion are all listed. Note that most champions above 6 states are self-reported and have not been independently verified.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- For editors: If someone used an LLM to find TMs, please always attribute their name, because machine discoveries can&#039;t be attributed to LLMs only, according to laws. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;6&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1LB_1LA1RZ|halt}} {{TM|1RB0LB_1LA1RZ|halt}} {{TM|1RB1RZ_1LB1LA|halt}} {{TM|1RB1RZ_0LB1LA|halt}} {{TM|0RB1RZ_1LA1RB|halt}}&lt;br /&gt;
|[[Tibor Radó]]&lt;br /&gt;
|Direct Simulation&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;21&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1RZ_1LB0RC_1LC1LA|halt}}&lt;br /&gt;
|Proven by [[Shen Lin]]&lt;br /&gt;
|Direct Simulation&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;107&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1LB_1LA0LC_1RZ1LD_1RD0RA|halt}}&lt;br /&gt;
|Allen Brady&lt;br /&gt;
|Direct Simulation&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(5)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;47\,176\,870&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA|halt}}&lt;br /&gt;
|Heiner Marxen &amp;amp; Jürgen Buntrock in 1989&lt;br /&gt;
|Direct Simulation&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 8&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1RA_1RC1RZ_1LD0RF_1RA0LE_0LD1RC_1RA0RE|halt}}&lt;br /&gt;
|mxdys in 2025&lt;br /&gt;
|See mxdys&#039;s analysis on the TM page&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(7)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 3 \uparrow^{20} 3 &amp;gt; f_\omega(20)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB0RG_1RC1RB_0RD1RZ_0LE0LD_0LF1LE_1RA1LF_1LC0RB|halt}}&lt;br /&gt;
|Jeff Ketchersid and Gemini in 10/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB7/1RB0RG_1RC1RB_0RD---_0LE0LD_0LF1LE_1RA1LF_0LD0RB.md Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(8)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_\omega^3(12)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LH0LC_1RG1LD_0RG0RF_1RG1RZ|halt}}&lt;br /&gt;
|Jeff Ketchersid and Gemini in 10/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB8/1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LH0LC_1RG1LD_0RG0RF_1RG---.md Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(9)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_\omega^7(12)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_0LH0LC_1RG1LD_0RG0RF_0LI1RZ_1RI1RC|halt}}&lt;br /&gt;
|Jeff Ketchersid and Gemini in 10/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB9/1RB0RA_1LC1LF_1RD0LB_1RA1LE_0LH0LC_1RG1LD_0RG0RF_0LI---_1RI1RC.md Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(10)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}(2 \uparrow^{36} 3) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LI0LC_0RG1LD_1RH1LG_1LC0RG_0LJ0LI_1RZ0LC|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1557806386073702622 Jeff Ketchersid and Claude in 10/2026 (claimed)]&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB10 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(11)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}(f_\omega^2(5))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RG0LH_1RK1RC_0LD1LA_0RE1LD_0LI1RF_1RZ0RG_1RB1RG_1LA1LH_0LK0LJ_1LH1LI_1LJ1RE|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid and Gemini in 10/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB11 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(12)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+2}(f_{\omega+1}^2(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RG0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_1RZ0LL_0LH1LK|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid and Gemini in 10/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB12 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(13)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+2}^6(f_{\omega+1}^2(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RM0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_0LL0LL_0LH1LK_1RZ0LH|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in 10/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB13 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(14)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+3}(30)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_0RN1RF_1RM0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_0LL0LL_0LH1LK_0LK0LH_1LM1RZ|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in 11/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB14 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(15)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(13)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LH0LG_0LI1RC_0LD1LA_0RE1LD_0RH1RL_1RB1RF_1LA1LG_1RF0RO_1LJ1LI_0LK1LI_1RL1RE_0RL0RF_0LA0RN_0LA1RO_1RZ1RM|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in 11/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB15 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(16)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(f_\omega(14))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LG1LA_0LI1RC_0LD1LG_0RE1LD_0RM1RL_1RB1RF_1LH0LA_1RF0RN_1LJ1LI_0LK1LI_1RL1RE_0RL0RF_0LG0RN_0RP1RO_1RZ1RM_1LB1LI|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in 11/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB16 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(17)&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BB(18)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(f_\omega^9(35))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|0LB1LF_0RC1LB_0RD1RM_1LE0RN_1LF1LE_1LG0LE_1RH1RP_1RI1RH_0LJ1RA_1LK1LJ_0LL1LJ_1RM1RC_0RM0RH_1LE1RO_1RZ1RD_0LF0RQ_0LH1RR_0LF1RP|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in 11/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB18 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(19)&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BB(20)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(f_{\omega + 2}^2(f_{10}(2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LH0LG_0LI1RC_0LD1LA_0RE1LD_1RQ1RL_1RB1RF_1LA1LG_1RF1RM_1LJ1LI_0LK1LI_1RL1RE_0RL0RF_0LN1RM_0RF0LO_0RF1LP_0RF1LN_1LR1RQ_1RZ1LS_0LF1LT_0LF0LR|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jacobzheng in 2026&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB20 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(21)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2}^3(4 \uparrow\uparrow 341)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|0LI0LF_0RJ1RG_0RD1LC_1RH1RE_1LO0RH_1LA1LF_0LC1LA_1RB1RH_1RD0LF_1LP0RK_0LM1LL_0LL1LM_1LE1LN_0RQ0LM_0RP1LO_1LR0RH_1LF1RQ_1RZ0LS_1LH0LT_1LH1LU_0LE1LR|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1026577255754903572/1274471360206344213 Racheline in 2024]&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB21 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(25)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2}^5(4 \uparrow\uparrow 341)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|0LI0LF_0RJ1RG_0RD1LC_1RH1RE_1LO0RH_1LA1LF_0LC1LA_1RB1RH_1RD0LF_1LP0RK_0LM1LL_0LL1LM_1LE1LN_0RQ0LM_0RP1LO_1LR0RH_1LF1RQ_1RZ0LS_1LH0LT_1LH1LU_0LE1LV_0LH0LW_1LH0LX_1LH1LY_0LE1LR|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jeff Ketchersid, Claude and Gemini in 11/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB25 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(29)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^\omega}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB29/hydra29.md]&lt;br /&gt;
|mxdys in 10/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB29 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(31)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \uparrow \uparrow 4}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB31/hydra31.md]&lt;br /&gt;
|mxdys in 10/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB31 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(33)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \uparrow \uparrow 6}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/blob/main/BB33/hydra33.md]&lt;br /&gt;
|mxdys in 10/2026 (claimed)&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB33 Claimed analysis by Claude] never verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(48)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_1}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1567585091172040726]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1567585091172040726 roromachine14 and Gemini in 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(150)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{lim(BMS)}(10\uparrow\uparrow 15)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://morphett.info/turing/turing.html?c95a199c8e8a3dd56452f8b7e28fabbf too large to show]&lt;br /&gt;
|Patcail in 2025&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1026577255754903572/1328863966688182345&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(1015)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; D^{5}(99)&amp;lt;/math&amp;gt; = Loader&#039;s Number&lt;br /&gt;
|&lt;br /&gt;
|CatsAreFluffy in 2024&amp;lt;ref&amp;gt;https://github.com/CatsAreFluffy/metamath-turing-machines/commit/85948b04fc4aeb983ca6d63d6aee5ad6ef308bfe&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Conjectured ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Notes&lt;br /&gt;
|-&lt;br /&gt;
|BB(67)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; q^{81}(q(5)-2)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://wiki.bbchallenge.org/wiki/Talk:Champions]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1331570843829932063/1339669138510970881 racheline in 2025]&lt;br /&gt;
|&amp;lt;math&amp;gt;q(n)&amp;lt;/math&amp;gt; is derived from [https://en.wikipedia.org/wiki/Laver%20table Laver tables]. From [https://discord.com/channels/960643023006490684/960643023530762341/1525489299032641657 racheline]: &amp;quot;The known information about q(n) isn&#039;t enough to prove that this machine scores higher than the shown champions with fewer states, or that it scores lower than the shown champions with more states.&amp;quot;&lt;br /&gt;
If q(5) doesn&#039;t exist (this can only happen if [[Logical_independence|ZFC+I3 is inconsistent]]), then this machine doesn&#039;t halt. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 3-Symbol TMs ==&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,3)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;38&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB2LB1RZ_2LA2RB1LB|halt}}&lt;br /&gt;
|Allen Brady in 1988&lt;br /&gt;
|Direct Simulation&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,3)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{17}&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|0RB2LA1RA_1LA2RB1RC_1RZ1LB1LC|halt}}&lt;br /&gt;
|Terry &amp;amp; Shawn Ligocki in 2007&lt;br /&gt;
|[https://bbchallenge.org/~pascal.michel/beh#tm33h Analysis by Pascal Michel]&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,3)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10 \uparrow^4 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB1RD1LC_2LB1RB1LC_1RZ1LA1LD_0RB2RA2RD|halt}}&lt;br /&gt;
|Pavel Kropitz in 2024&lt;br /&gt;
|See Polygon&#039;s analysis on the TM page &lt;br /&gt;
|-&lt;br /&gt;
|BB(5,3)&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_\omega^2(10\uparrow\uparrow\uparrow 6)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1LE2LD2LC_2RB1RB1RA_2RB1LC0LC_1RB1LD2LD_2RD2LE2LF_1RZ---1LE|halt}}&lt;br /&gt;
|Jacobzheng in 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,3)&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}^4(f_\omega^3(14)) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|2LH1LE2RA_0LE2LE2RB_1RF1RC2RB_0RC0LD0RH_1RC2LE1LG_0LA0LD1RZ_1LD2RA2LG_2RD1LF1LG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(9,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+2}^3(f_{\omega+1}^2(f_\omega(14)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|2LI1LE2RA_0LE2LE2RB_1RF1RC2RB_0RC0LD2RA_1RC2LE1LG_0LA0LD1RH_1LD2RA2LG_1RZ2LA2LI_1RD1LI2LH|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(10,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(11)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA_2LE2LH2RB_1LI1RC2RB_0RC1RD0LG_0LF1LE1LE_1RG1RZ---_0RC1LH2RG_1RC2LH1LA_1RJ2LI2LB_0RF1LA0RI|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(11,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(46)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA_2LE2LH2RB_1LI1RC2RB_0RC1RD0LG_0LF1LE1LE_1RG1RZ---_0RC1LH2RG_1RC2LH1LA_1RJ2LI2LB_0RF2LK0RI_2RG2RK1LK|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(12,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(f_{\omega+2}^2(4))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA_2LE2LH2RB_1RK1RC2RB_0RC1RD0LG_0LF1LE1LE_1RG1RI0RL_0RC1LH2RG_1RC2LH1LA_0RI2RI2RJ_0LJ1RZ1LA_1LK0LL2LA_2LL0LE2LB|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(13,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}^3(f_{\omega+1}(f_\omega^2(5)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA_2LE2LH2RB_1RK1RC2RB_0RC1RD0LG_0LF1LE1LE_1RG1RI0LM_0RC1LH2RG_1RC2LH1LA_0RI2RI2RJ_0LJ1RZ1LA_1LK0LL2LB_2RG2RE2RL_1LL0RL0LK|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(36,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_0}(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/BB(36,3)&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(37,3)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_0}(373\,676\,378)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/BB(37,3)&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 4-Symbol TMs ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,4)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;3\,932\,964&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB2LA1RA1RA_1LB1LA3RB1RZ|halt}}&lt;br /&gt;
|Terry &amp;amp; Shawn Ligocki in 2005&lt;br /&gt;
|Pascal Michel, Heiner Marxen, Allen Brady&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,4)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|Pavel Kropitz in 2024&lt;br /&gt;
|[https://www.sligocki.com/2024/05/22/bb-3-4-a14.html Analysis by Shawn Ligocki]&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,4)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 2 \uparrow^{509} 3 &amp;gt; f_\omega(508)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|0LB3LB1RZ2RA_1LD3RB1LC2RA_3RB1LB3LC2RC_0RD2RC2LB0RA|halt}}&lt;br /&gt;
|[[User:Loader3229]] in 10/2026&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB44 Claimed analysis by MiniMax] Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(5,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_\omega^2(10\uparrow^4 10\uparrow\uparrow 65\,533)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD3LB---2RA_1LD3RB1LC2RA_3RB1LB3LC2RC_3RB---3LE3LD_------1LD1RZ|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jacobzheng in 2026&lt;br /&gt;
|[https://github.com/jeff87654/busy-beaver/tree/main/BB54 Claimed analysis by MiniMax] Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}(10\uparrow\uparrow 65\,533) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LF2RA3RB---_3RD2LB3RB1LC_2RA1LB3RC2LC_1LD2RE0LA1LD_1RZ0LE1LF---_2RA---2LF2LF|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Jacobzheng in 2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+3}(21)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|3RD1LE2RA1LF_0LE2LE2RB2RD_1RF1RC2RB0LB_0RC0LD3RC2RA_1RC2LE1LG2RF_0LA0LD3LG1RZ_1LD2RA2LG0RB|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+8}^2(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA---_2LE2LH2RB1LF_2LA1RC2RB---_0RC1RD0LG1RH_0LF1LE1LE3LB_1RG1RZ3RD3LF_0RC1LH2RG0LC_1RC2LH1LA2LB|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(9,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2}(18)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA3LG_1LI2LH2RB2RF_1LG1RC2RB3LG_0RC1RC1LD3RD_3RD1LE1LE3LE_1RZ3LD2LE3LE_1RG1LH2RG3LG_1RC2LH1LA1LE_0RC3LI1RI0RI|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(10,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2}(58)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA3LG_1RI2LH2RB2RF_1LG1RC2RB3LG_0RC1RC1LD3RD_3RD1LE1LE3LE_1RZ3LD2LE3LE_1RG1LH2RG3LG_1RC2LH1LA1LE_3LJ3RJ3LI2RI_3LD2RI3LI3RI|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(31,4)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_0}(373\,676\,378)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/BB(31,4)&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 5-Symbol TMs ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,5)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{10^{10^{3\,314\,360}}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3LA4RB0RB2LA_1LB2LA3LA1RA1RZ|halt}}&lt;br /&gt;
|Daniel Yuan in 2024&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1259770421046411285/1379877629288644722 mxdys in Rocq]&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,5)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_\omega(2 \uparrow^{15} 5) &amp;gt; f_\omega^2(15)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3LB4LC2RA4LB_2LC3RB1LC2RA1RZ_3RB1LB3LC2RC4LC|halt}}&lt;br /&gt;
|Racheline in 2024&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}(27\,041) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3LB4LC2RA4LB_2LC3RB1LC2RA4RD_3RB1LB3LC2RC4LC_2RC2RD1RZ4RB1LC|halt}}&lt;br /&gt;
|[[User:Loader3229]] in 10/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(5,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}(f_\omega^4(6))&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1LB3LB4LC2RA4LB_3LE3RB1LC2RA4RD_3RB1LB3LC2RC4LC_1RZ------4LD4LE_3RB------4LE3LC|halt}}&lt;br /&gt;
|[[User:Loader3229]] in 10/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+3}(11)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|2LE3LB4LC2RA4LB_4RA3RB1LC2RA4RD_3RB1LB3LC2RC4LC_1RZ3LF1LA4LD4LE_3RB---0RD4LE3LC_4LC------3LF3LF|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 10/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+3}^2(10)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|2LE3LB4LC2RA4LB_4RA3RB1LC2RA4RD_3RB1LB3LC2RC4LC_1RZ3LF1LG4LD4LE_3RB---1LE4LE3LC_4LC------3LF3LF_3LF------1LG1LG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 10/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2}(13)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LD2RG2LA3LG---_4LC2LH2RB2RF0RB_4LE1RC2RB3LG4RB_0RC1RC1LD3RD3LA_3RD1LE1LE3LE4RE_1RZ3LD2LE3LE4RD_1RG1LH2RG3LG3LF_1RC2LH1LA1LE---|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(19,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_0}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB2LA1RA2LB2LA_0LA2RB3RB4RA1LQ_1RZ1RC2LD------_0LK3RD2RD2RD4RD_------0RH1LS0RF_1LG1RF2RF---4RF_4LE1LG2LG---4LG_0LI1RH2RH---4RH_0RK0LJ------4RK_2LE1LJ2LJ---4LJ_4RP---0LE---0LK_2RQ---2LL---4LL_2LN---2RM3RM4RM_4RQ2RQ2LN3LN4LN_4LN---2RO3RO4RO_3LL1LP2LP1LQ4LP_1RC3RR1RM3LP0RO_3LL1RR2RR0RR4RR_1RC1LS2LS1LS4LS|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/BB(19,5)&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(94,5)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi_0(\Omega_2)}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User_blog:Wythagoras/Hydra_machines&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 6-Symbol TMs ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,6)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10 \uparrow\uparrow 10 \uparrow\uparrow 10^{10^{115}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3RB5RA1LB5LA2LB_2LA2RA4RB1RZ3LB2LA|halt}}&lt;br /&gt;
|Pavel Kropitz in 2023&lt;br /&gt;
|[https://www.sligocki.com/2023/05/20/bb-2-6-p3.html Analysis by Shawn Ligocki] &lt;br /&gt;
|-&lt;br /&gt;
|BB(3,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_\omega^3(15)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3LB4LC2RA4LB5LB_2LC3RB1LC2RA5LC1RZ_3RB1LB3LC2RC4LC5LC|halt}}&lt;br /&gt;
|[[User:Loader3229]] in 10/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+2}(29)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|5LD3LB5LC2RA4LB4LC_1RZ3RB1LC2RA3RD0LA_3RB1LB3LC2RC4LC1RA_3RB0LA2LC4LD4LC4LD|halt}}&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(5,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+3}(31)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1LE3LB2LA2RA4LB5RA_1RZ3RB1LC2RA3RD4RA_3RB1LB3LC2RC4LC2LB_3RB0LA5LE4LD4LC4LD_4LC5LC0RE5LE1RE2RE|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega \times 2}(89)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|4LF3LB1RZ2RA4LB---_2LC3RB1LD2RA3LF---_3RB1LB3LC2RC4LC0LE_3RB---3LC2RC---3RE_5RC3RE---4LC------_5RB0LF1RB1LF---5RB|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2}(110)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|5LG3LB---2RA4LB0LC_4LG3RB1LD2RA3LF5RB_3RB1LB3LC2RC4LC1LE_3RB3RE3LC2RC---3RD_5RB3RE0LE4LC3LG5LE_5RB5RB2LB1LF---5LF_5LF---0LG1LG---5LG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^2+1}(f_\omega(31))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|5LH3LB2LH2RA4LB1RZ_2RC3RB1LD2RA3LF5RB_3RB1LB3LC2RC4LC1LE_3RB3RE3LC2RC---3RD_5RB3RE1LE4LC3LG5LE_5RB5RB---1LF5LF5LF_5LF4RG1LB1LG2LG5LG_0LC---1LH1LH---5RG|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(61,6)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi_0(\Omega_2)}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User_blog:Wythagoras/Hydra_machines&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 7-Symbol TMs ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,7)]]&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 155&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA_2LA6RA4RB1RZ3LB6LA4RB|halt}}&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/960643023530762341/1563057558011252761 roromachine14 in 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(3,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}(117) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|6LC3LB6RA2RA4LB5LC5LA_1RZ3RB1LC2RA3RB4LC5RA_3RB1LB3LC2RC4LC1RA6LA|halt}}&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+3}(34)&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|5LC3LB6LA2RA4LB2LD3RB_1RZ3RB1LC2RA3RD2LC4LC_3RB1LB3LC2RC4LC1RA5LD_3RB5LD6LC4LD4LC4LD6LC|halt}}&lt;br /&gt;
|[[User:Loader3229]] in 11/2026&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(18,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_0}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB2LA1RA2LB2LA------_0LA2RB3RB4RA1LP------_0RZ1RC2LD------------_0LJ3RD2RD2RD4RD------_4LE1LE0RG1LR0RF2LE4LE_1LE1RF5RF---6RF------_0LH1RG2RG---4RG------_0RJ0LI------4RJ------_2LE1LI2LI---4LI------_4RO---0LE---0LJ------_2RP---2LK---4LK------_2LM---2RL3RL4RL------_4RP2RP2LM3LM4LM------_4LM---2RN3RN4RN------_3LK1LO2LO1LP4LO------_1RC3RQ1RL3LO0RN------_3LK1RQ2RQ0RQ4RQ------_1RC1LR2LR1LR4LR------|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/BB(18,7)&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(46,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi_0(\Omega_2)}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User_blog:Wythagoras/Hydra_machines&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|BB(134,7)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi_0(\Omega_\omega)}(2\,050)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|LittlePeng9+Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/Analysis_of_LittlePeng9%27s_work/Hydra_machines&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 8-Symbol TMs ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|BB(2,8)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 155&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA1RZ_2LA6RA4RB7RA3LB6LA4RB4RA|halt}}&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1084047886494470185/1563070360956698804 roromachine14 in 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(17,8)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\varepsilon_0}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;span style=&amp;quot;word-break:break-all&amp;quot;&amp;gt;{{TM|1RB2LA1RA2LB2LA---------_0LA2RB3RB4RA1LO---------_0RZ1RC2LD---------------_0LJ3RD2RD2RD4RD---------_4LE1LE0RG1LQ0RF2LE4LE---_1LE1RF5RF---6RF---------_0LH1RG2RG---4RG---------_0RJ0LI------4RJ---------_2LE1LI2LI---4LI---------_4RN---0LE---0LJ---------_2RO2RO2LK3LK4LK2LK4LK4RO_2LK---5RL3RL6RL---------_4LK---5RM3RM6RM---------_3LK1LN2LN1LO4LN---------_1RC3RP1RL3LN7RM---------_3LK1RP2RP0RP4RP---------_1RC1LQ2LQ1LQ4LQ---------|halt}}&amp;lt;/span&amp;gt;&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/BB(17,8)&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== 9-Symbol TMs ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Runtime&lt;br /&gt;
!Champions&lt;br /&gt;
!Discovered by&lt;br /&gt;
!Verification&lt;br /&gt;
|-&lt;br /&gt;
|BB(2,9)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 155&amp;lt;/math&amp;gt;&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA8RA1RZ_2LA6RA4RB7RA3LB6LA4RB4RA4RA|halt}}&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1084047886494470185/1563070360956698804 roromachine14 in 2026]&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|-&lt;br /&gt;
|colspan=&amp;quot;5&amp;quot;|...&lt;br /&gt;
|-&lt;br /&gt;
|BB(42,9)&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi_0(\Omega_2)}(1.7\cdot10^{352})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Wythagoras in 2014&amp;lt;ref&amp;gt;https://googology.fandom.com/wiki/User_blog:Wythagoras/Hydra_machines&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Not independently verified.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Zoology ==&lt;br /&gt;
There are many types of champions.&lt;br /&gt;
&lt;br /&gt;
Note: the scale here is not formally defined. It mostly serves to estimate the average values produced by a type of champions.&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Classification&lt;br /&gt;
!Description&lt;br /&gt;
!Examples&lt;br /&gt;
!Scale&lt;br /&gt;
|-&lt;br /&gt;
|Trivial&lt;br /&gt;
|The simplest champions that can exist. They mostly appear in some BB-adjacent functions like [[Fractran|BBf]] or [[CounterScript|BBCS]].&lt;br /&gt;
|&lt;br /&gt;
* {{TM|1RZ---|halt}}&lt;br /&gt;
* {{TM|0RA_0RZ|halt}}&lt;br /&gt;
* {{TM|0RA_0RB_0RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;O(n)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|Chaotic&lt;br /&gt;
|Have a chaotic behavior with repeating patterns that go back and forth.&lt;br /&gt;
|&lt;br /&gt;
* {{TM|1RB1LB_1LA1RZ|halt}}&lt;br /&gt;
* {{TM|1RB1RZ_1LB0RC_1LC1LA|halt}}&lt;br /&gt;
* {{TM|1RB1LB_1LA0LC_1RZ1LD_1RD0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;O(2^n)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|Countdown&lt;br /&gt;
|Compute a number then &amp;quot;count down&amp;quot; (usually while bouncing) until reaching 0. They are common in some BB-adjacent functions like [[Fractran|BBf]].&lt;br /&gt;
|&lt;br /&gt;
* {{TM|1RB2LB1RZ_2LA2RB1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;O(n^2)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|Collatz-like&lt;br /&gt;
|Compute a [[Collatz-like]] function. Repeatedly multiply and add a number depending of its modulo until reaching a number with a certain modulo.&lt;br /&gt;
|&lt;br /&gt;
* {{TM|1RB2LA1RA1RA_1LB1LA3RB1RZ|halt}}&lt;br /&gt;
* {{TM|1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;O(2^n)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|Random walk&lt;br /&gt;
|Compute a [[Collatz-like]] function with a random walk.&lt;br /&gt;
|&lt;br /&gt;
|&amp;lt;math&amp;gt;O(2^{2^n})&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|Tetrational&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&amp;lt;math&amp;gt;O(2 \uparrow\uparrow n)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|Ackermannian&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&amp;lt;math&amp;gt;O(2 \uparrow^n 3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
[[Category:Zoology]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=User:Autumn-Pan/Busy-Beaver-Resource-Guide&amp;diff=10513</id>
		<title>User:Autumn-Pan/Busy-Beaver-Resource-Guide</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=User:Autumn-Pan/Busy-Beaver-Resource-Guide&amp;diff=10513"/>
		<updated>2026-11-10T04:39:21Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Add Guides category&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!-- This is the sequel and overhaul to Further-Reading --&amp;gt;&lt;br /&gt;
This page collects reading materials and learning resources, ranging from beginner-friendly texts to more cutting-edge research. It is highly recommended to look through this page as a beginner, since introductory texts are curated here. Commentary and original documentation will also be provided. Every outside link, including citations, is chosen carefully to not only cite sources, but serve as links to outside resources. The primary purpose for this article is to summarize parts of Busy Beaver research, and to generously append links to outside resources and readings to act as a starting point for learners.&lt;br /&gt;
&lt;br /&gt;
== Getting Oriented ==&lt;br /&gt;
This is a collection of general background knowledge on the Busy Beaver challenge and essential information for all niches. All resources linked here are considered beginner level and require minimal background knowledge to understand.  &lt;br /&gt;
&lt;br /&gt;
=== What is a Turing Machine? ===&lt;br /&gt;
&lt;br /&gt;
==== Prerequisites: Minimal ====&lt;br /&gt;
In your time in the BBChallenge collaboration, the single most important object that you will encounter is the &#039;&#039;Turing machine&#039;&#039;; it is the focus of our study. To put it simply, a Turing machine (also abbreviated to &amp;quot;TM&amp;quot;), is a hypothetical computer which has been proven to be able to simulate any computer algorithm. Consider a sequence of infinitely many zeroes in both directions, we call this to tape. We also need a machine head which is capable of traversing along the tape, which can be thought of as an integer index. When we first run the machine, it reads the value directly under the head, and also starts in a specific internal state (we denote these states alphabetically, with the machine starting in state A), and will reference a set of rules given the state and read-value. The rule will then tell it to write a certain value to the tape under the head, move either left or right, and switch to a specific new state. There may also be instructions which tell the machine to stop running entirely, and the question of whether or not the machine can halt is a foundational one.&lt;br /&gt;
&lt;br /&gt;
==== Suggested Readings: ====&lt;br /&gt;
&lt;br /&gt;
* [https://www.sligocki.com/2022/10/09/standard-tm-format.html Blog Post on BBChallenge TM Formatting]&lt;br /&gt;
** We use a very specific notation for our TMs, this is crucial information&lt;br /&gt;
&lt;br /&gt;
=== Background ===&lt;br /&gt;
&#039;&#039;&#039; Prerequisites: Turing Machines &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
To begin our work with the Busy Beaver function, we must first understand what it is about. The Busy Beaver Function BB(n) measures the maximum runtime of an n-state, 2-symbol Turing machine. It is a famous example of an uncomputable function, meaning no general algorithm can compute arbitrary values of BB(n). The general methodology for computing values of BB(n) requires us to decide whether or not all n-state 2-symbol Turing machines halt in search for the one with the longest runtime. We call unsolved machines &#039;&#039;Holdouts&#039;&#039;, and we solve holdouts with a variety of methods. Automated computer programs called &#039;&#039;Deciders&#039;&#039;, manually solving holdouts, and simulating holdouts, have all been critical to this project.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Suggested Readings: &#039;&#039;&#039; &lt;br /&gt;
* [https://bbchallenge.org/story#the-busy-beaver-function-bb Official Story page for BBChallenge]&lt;br /&gt;
** This page was created while BB(5) was the main focus of BBChallenge, and is currently outdated. Nevertheless, it acts as a solid introduction to understanding this community.&lt;br /&gt;
* [https://www.quantamagazine.org/busy-beaver-hunters-reach-numbers-that-overwhelm-ordinary-math-20250822/ Quanta Magazine Blog about BB(n)]&lt;br /&gt;
** Writes about research efforts, and attempts to simplify some relevant concepts and explain them with analogies. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In addition to the official story, a number of YouTube videos have also been published on the Busy Beaver problem.[https://www.youtube.com/watch?v=CE8UhcyJS0I][https://www.youtube.com/watch?v=rmx3FBPzDuk]&lt;br /&gt;
&lt;br /&gt;
We study the Busy Beaver function because it is uncomputable [https://www.comap.com/blog/blog-2/item/what-does-uncomputable-mean-busy-beaver-problem]. That is, no algorithm can determine any given value of BB(n) in a finite number of steps. In fact, many formal systems that we use to study mathematics, like Peano arithmetic and Zermelo-Fraenkel set theory[https://arxiv.org/abs/1605.04343], fall short of being able to decide all values of BB(n).&lt;br /&gt;
* We&#039;re actually having ongoing discussions about its independence from Peano arithmetic, which is open to new contributors. [https://discord.com/channels/960643023006490684/1466652214247559198]&lt;br /&gt;
&lt;br /&gt;
=== First Steps ===&lt;br /&gt;
The majority of our discussions happen on our discord server [https://discord.gg/nJRPHFQwFQ]. Furthermore, we now have a subreddit which is also open to everyone [https://www.reddit.com/r/BBChallenge/]. If you have any specific questions, feel free to ask them in our &amp;quot;beginners&amp;quot; channel [https://discord.com/channels/960643023006490684/1448375857046360094]&lt;br /&gt;
&amp;lt;!-- The second video needs to be vetted]--&amp;gt;[[Category:Guides]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Measuring_large_numbers&amp;diff=10511</id>
		<title>Measuring large numbers</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Measuring_large_numbers&amp;diff=10511"/>
		<updated>2026-11-10T01:53:00Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Add Guides category (and remove from Stubs, it seems quite a full article)&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The busy beaver functions are known to grow faster than any computable function, as do many of their variants. Because of this, values of the function, or lower bounds on the function can be very, very large, so it is tempting to find ways of representing these numbers; this article will cover these methods.&lt;br /&gt;
&lt;br /&gt;
Paradoxically, although the Kolgomorov complexity of stating &amp;quot;The runtime of program X&amp;quot; to define the runtime of program X is typically very low, it is often not useful as it does not give us good information on the size of the number. Informally, more &amp;quot;natural&amp;quot; or &amp;quot;combinatorial&amp;quot; ways of measuring large numbers are desired which allow us to relatively compare the rough &amp;quot;ballparks&amp;quot; of the numbers&#039; scales. Tools like Knuth&#039;s up-arrow notation can help us achieve this, as well as more powerful methods such as [[Fast-Growing Hierarchy|fast-growing hierarchy]] or the diagonalization of an axiomatic foundation of mathematics.&lt;br /&gt;
&lt;br /&gt;
== Scientific notation ==&lt;br /&gt;
Scientific notation is one of the most common ways of representing large numbers; numbers written in standard scientific notation symbolically consist of a multiplicand (taking a value between 1 and the base, though is sometimes omitted), a base (commonly 10) and an exponent (usually an integer, though sometimes takes non-integer values if the multiplicand is omitted).&lt;br /&gt;
&lt;br /&gt;
For example, &amp;lt;math&amp;gt;8.68 \cdot 10^6&amp;lt;/math&amp;gt; represents the number 8,680,000, whereas &amp;lt;math&amp;gt;6.022 \cdot 10^{23}&amp;lt;/math&amp;gt; represents the number 602,200,000,000,000,000,000,000. These numbers are often approximations (to some number of digits) or lower/upper bounds on the precise integer.&lt;br /&gt;
&lt;br /&gt;
Non-integer exponents are also often used to approximate. For example, &amp;lt;math&amp;gt;10^{7.67}&amp;lt;/math&amp;gt; representing a lower bound for the number 46,773,515.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Certain busy beaver values can most conveniently be represented using scientific notation; they include:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(3,3) &amp;gt; 1.1912 \cdot 10^{17}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BBf}(23) &amp;gt; 4.3932 \cdot 10^{124}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(38) &amp;gt; 1.0017 \cdot 10^{19,729}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
When representing even larger numbers using scientific notation, the exponent itself may also be represented using scientific notation. For example:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(2,5) &amp;gt; 10^{10^{10^{3,314,360}}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Knuth&#039;s up-arrow notation ==&lt;br /&gt;
Knuth&#039;s up-arrow notation extends the sequence of recursive operators (i.e. addition, multiplication, exponentiation) to higher-order functions (e.g. tetration, pentation) which grow much more rapidly.&lt;br /&gt;
&lt;br /&gt;
Tetration, the operation following exponentiation in the sequence of &amp;quot;hyperoperators&amp;quot; is defined by:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;a \uparrow \uparrow b = \begin{cases}&lt;br /&gt;
    1, &amp;amp; \text{if } b = 0&lt;br /&gt;
    \\ a^{a \uparrow \uparrow (b - 1)}, &amp;amp; \text{otherwise.}&lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The lower bound for &amp;lt;math&amp;gt;S(2,5)&amp;lt;/math&amp;gt; can thus be more concisely (though more weakly) written as &amp;lt;math&amp;gt;S(2,5) &amp;gt; 10 \uparrow\uparrow 4&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Knuth&#039;s up-arrow notation generalizes this though the following formula (where an arrow with a superscript of n represents the operator indicated by n arrows):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;a \uparrow^{n} b =\begin{cases}&lt;br /&gt;
     a^b, &amp;amp; \text{if } n = 1,&lt;br /&gt;
     \\ 1, &amp;amp; \text{if } n &amp;gt; 1 \text{ and } b = 0,&lt;br /&gt;
     \\ a \uparrow^{n - 1} (a \uparrow^{n} (b - 1)), &amp;amp; \text{otherwise.}&lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Larger busy beaver values represented using Knuth&#039;s up-arrow notation include:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(2,6) &amp;gt; 10 \uparrow \uparrow \uparrow 3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(4,3) &amp;gt; 10 \uparrow \uparrow \uparrow \uparrow 4&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(3,4) &amp;gt; 2 \uparrow^{15} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(3,5) &amp;gt; 2 \uparrow^{2 \uparrow^{15} 3} 3&amp;lt;/math&amp;gt; &lt;br /&gt;
&lt;br /&gt;
[[Busy Beaver Challenge|bbchallenge]] uses a piecewise extension of tetration in order to write numbers of this scale more accurately:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;a \uparrow \uparrow b =\begin{cases}&lt;br /&gt;
     b + 1, &amp;amp; \text{if } -1 &amp;lt; b \leq 0,&lt;br /&gt;
     \\ a^{a \uparrow \uparrow (b - 1)}, &amp;amp; \text{otherwise.}&lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Note that when using this method, the function &amp;lt;math&amp;gt;10 \uparrow\uparrow x&amp;lt;/math&amp;gt;, and other functions similar to it, are not analytic functions; however, that requirement is unnecessary when using this method to represent large numbers. Additionally, methods of obtaining analytic hyperoperators are complex, typically involving Abel functions, Riemann mappings, or Jabotinsky matrices; this method forgoes this, allowing for the ease of calculation.&lt;br /&gt;
&lt;br /&gt;
In this format, the lower bound for &amp;lt;math&amp;gt;S(2,5)&amp;lt;/math&amp;gt; can be written more precisely as &amp;lt;math&amp;gt;S(2,5) &amp;gt; 10 \uparrow\uparrow 4.8142&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Graham&#039;s number]] (&amp;lt;math&amp;gt;g_{64}&amp;lt;/math&amp;gt;) is a famously large number that is defined using Knuth&#039;s up-arrow notation:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;g_n = \begin{cases}&lt;br /&gt;
    3 \uparrow \uparrow \uparrow \uparrow 3, &amp;amp; \text{if }n = 1&lt;br /&gt;
    \\ 3 \uparrow^{g_{n - 1}} 3, &amp;amp; \text{if } n &amp;gt; 1 &lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The Ackermann function &amp;lt;math&amp;gt;\operatorname{A}(n,n)&amp;lt;/math&amp;gt; grows at roughly the same rate as &amp;lt;math&amp;gt;2 \uparrow^{n} 3&amp;lt;/math&amp;gt;. It can be said to &amp;quot;diagonalize&amp;quot; across the hyperoperators, eventually dominating every single hyperoperator.&lt;br /&gt;
&lt;br /&gt;
== Fast-growing hierarchy ==&lt;br /&gt;
The [[fast-growing hierarchy]] uses function iteration and diagonalization across previous functions to extend far beyond the Ackermann function. Functions in the fast-growing hierarchy are written in the form &amp;lt;math&amp;gt;f_\alpha(n)&amp;lt;/math&amp;gt;, and are calculated according to three rules:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f_0(n) = n + 1&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f_{\alpha + 1}(n) = f_{\alpha}^n(n)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f_{\alpha}(n) = f_{\alpha[n]}(n)&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; is a limit ordinal (i.e. not a successor of any ordinal, nor zero.)&lt;br /&gt;
&lt;br /&gt;
Usually, an ordinal &amp;lt;math&amp;gt;\lambda&amp;lt;/math&amp;gt; is first chosen, and then &amp;lt;math&amp;gt;f_\alpha&amp;lt;/math&amp;gt; is defined via to the clauses above for all ordinals &amp;lt;math&amp;gt;\alpha &amp;lt; \lambda&amp;lt;/math&amp;gt;. This requires a system of fundamental sequences to be fixed first, where for each limit ordinal &amp;lt;math&amp;gt;\alpha &amp;lt; \lambda&amp;lt;/math&amp;gt; the fundamental sequence of &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; is a sequence of ordinals which has a supremum of &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
It is suspected that in this wiki, and in most other spaces that deal with googology, the fundamental sequences described by Maksudov (2017){{Citation needed}} are used to define the fast-growing hierarchy.&lt;br /&gt;
&lt;br /&gt;
In this manner, the value of &amp;lt;math&amp;gt;S(3,5)&amp;lt;/math&amp;gt; can be more concisely (though more weakly) written as &amp;lt;math&amp;gt;S(3,5) &amp;gt; f_\omega(2 \uparrow^{15} 3)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Other busy beaver values that necessitate the use of the fast-growing hierarchy include:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(49) &amp;gt; f_{\omega + 1}\left(\frac{2 \uparrow \uparrow 6}{2}\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{S}(51) &amp;gt; f_{\varepsilon_0 + 1}(8)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(100) &amp;gt; f_{\psi_0(\Omega_\omega) + 1}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Defining fundamental sequences: ordinal notations and ordinal collapsing functions ===&lt;br /&gt;
Individually defining fundamental sequences for a transfinite number of ordinals may be less than ideal; thus, to define the fast-growing hierarchy effectively, ordinal notations, which define a computable mapping between sequences of symbols and ordinals can be used to define fundamental sequences instead. TODO&amp;lt;!-- somewhere in this section should mention&lt;br /&gt;
cantor form&lt;br /&gt;
primitive sequence system or kirby paris hydra&lt;br /&gt;
buccholz ocf and/or extension to p0(Lambda)&lt;br /&gt;
after that, go, be free. live. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Comparing FGH and BB ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Ordinal α !! Least m that BB(m) confirmed &amp;gt;= f&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt;(2) !! Least m that BB(m) confirmed &amp;gt;= f&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt;(3) !! Least m that BB(m) confirmed &amp;gt;= f&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt;(10)&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega&amp;lt;/math&amp;gt; (Cantor normal form)|| 3 || 6 || 7&amp;lt;ref&amp;gt;See {{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF}}.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega+1&amp;lt;/math&amp;gt;|| 7 || 8 || 10&amp;lt;ref&amp;gt;Jeff Ketchersid, &amp;quot;[https://github.com/jeff87654/busy-beaver/blob/main/BB10/1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LI0LC_0RG1LD_1RH1LG_1LC0RG_0LJ0LI_1RZ0LC.md A 10-state machine at level f_(ω+1)]&amp;quot;. Github file, October 2026. Accessed 17 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega+2&amp;lt;/math&amp;gt;|| 10 || 12 || 12&amp;lt;ref&amp;gt;Jeff Ketchersid, &amp;quot;[https://github.com/jeff87654/busy-beaver/blob/main/BB12/1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RG0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_1RZ0LL_0LH1LK.md M12: a 12-state machine at level f_(ω+2)]&amp;quot;. Github file, October 2026. Accessed 27 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega\times 2&amp;lt;/math&amp;gt;|| 10 || 14 || 15&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega^2&amp;lt;/math&amp;gt;|| 10 || 20 || 21&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega^\omega&amp;lt;/math&amp;gt;|| 10 || 29 || 31&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega^\omega+1&amp;lt;/math&amp;gt;|| 31 || 31 || 31&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\varepsilon_0&amp;lt;/math&amp;gt; (Epsilon ordinals)|| 10 || 31 || 48&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1331570843829932063/1567585091172040726&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\varepsilon_1&amp;lt;/math&amp;gt;|| 48 || 48 ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\zeta_0&amp;lt;/math&amp;gt;|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\varphi(\omega , 0)&amp;lt;/math&amp;gt; (Veblen&#039;s phi function)|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\Omega_2)&amp;lt;/math&amp;gt; (Buchholz&#039;s psi function)|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\Omega_\omega)&amp;lt;/math&amp;gt;|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\varepsilon_{\Omega_\omega+1})&amp;lt;/math&amp;gt;|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\Omega_{\Omega_{\Omega_{...}}})&amp;lt;/math&amp;gt; (Extended Buchholz&#039;s psi function)|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;lim(BMS)&amp;lt;/math&amp;gt; (Bashicu matrix system)|| || || 150&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Theories ==&lt;br /&gt;
The proof-theoretic ordinal of a theory is defined as supremum of the order types of all ordinal notations that can be shown to be well-founded within the theory.&lt;br /&gt;
&lt;br /&gt;
Some examples of proof theoretical ordinals include &amp;lt;math&amp;gt;\operatorname{PTO}(Q) = \omega&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\operatorname{PTO}(PA) = \varepsilon_0&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;\operatorname{PTO}(\operatorname{KP}) = \psi_0(\varepsilon_{\Omega+1})&amp;lt;/math&amp;gt;. Here Q is [[wikipedia:Robinson_arithmetic|Robinson arithmetic]], PA is Peano Arithmetic, and KP is Kripke-Platek set theory. &lt;br /&gt;
&lt;br /&gt;
Determination of the proof theoretic ordinal of second order arithmetic has been claimed in two preprints, one of which is a work-in-progress,&amp;lt;ref&amp;gt;T. Arai, &amp;quot;[https://arxiv.org/abs/2311.12459 An ordinal analysis of &amp;lt;math&amp;gt;\Pi_n&amp;lt;/math&amp;gt;-Collection]&amp;quot; (2023). Accessed 8 October 2026.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;H. Towsner, &amp;quot;[https://arxiv.org/abs/2403.17922 Proofs that Modify Proofs]&amp;quot; (2024). Accessed 8 October 2026.&amp;lt;/ref&amp;gt; and is known to vastly exceed that of &amp;lt;math&amp;gt;\operatorname{KP}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
They can be used to compare the strength of different theories, as well as (by definition) an indicator as to which ordinal notations (or functions that are derived from ordinal notations) cannot be shown to be well-founded (or total) in a theory.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A notable example of a theory which is directly used to create fast growing functions is the Calculus of Constructions (CoC), which has a proof-theoretic ordinal greater than that of any nth order arithmetic (&amp;lt;math&amp;gt;Z_n&amp;lt;/math&amp;gt;); well-formed statements in CoC can also be easily detected, and are strongly normalizing (TODO: explain what that means in this context).&lt;br /&gt;
&lt;br /&gt;
CoC yields the fast growing function &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; (defined by Ralph Loader in 2001 to create the eponymous Loader&#039;s number = &amp;lt;math&amp;gt;D^5(99)&amp;lt;/math&amp;gt;), which computes something similar to (but larger than) &amp;quot;The largest number \(x\) such that there is a &amp;lt;math&amp;gt;\Sigma^0_1&amp;lt;/math&amp;gt; formula &amp;lt;math&amp;gt;\phi(x)&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;\phi(x)&amp;lt;/math&amp;gt; is true and &amp;lt;math&amp;gt;\exists x\phi(x)&amp;lt;/math&amp;gt; is provable in CoC with a proof of length \(\leq \log_2 n\)&amp;quot;.&amp;lt;ref&amp;gt;R. Loader, &amp;quot;[https://raw.githubusercontent.com/rcls/busy/master/README.txt busy]&amp;quot;. GitHub repository (2003). Accessed 7 October 2026.&amp;lt;/ref&amp;gt; &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; outgrows all recursive functions provably total in &amp;lt;math&amp;gt;Z_\omega&amp;lt;/math&amp;gt;; the growth rate of &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; is sometimes informally written as &amp;lt;math&amp;gt;f_{\operatorname{PTO}(Z_\omega)}(n)&amp;lt;/math&amp;gt;, though no fundamental sequence has yet been defined for all ordinals under &amp;lt;math&amp;gt;\operatorname{PTO}(Z_\omega)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
The simplicity of CoC and &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; has been utilized to show the following bounds for certain busy beaver values:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(1797) &amp;gt; D^5(99)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{S}(1015) &amp;gt; D^5(99)&amp;lt;/math&amp;gt;&amp;lt;ref&amp;gt;CatsAreFluffy, &amp;quot;[https://github.com/CatsAreFluffy/metamath-turing-machines/commit/85948b04fc4aeb983ca6d63d6aee5ad6ef308bfe metamath-turing-machines]&amp;quot;. GitHub commit (September 2024). Accessed 7 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An even stronger but simpler function, &amp;lt;math&amp;gt;q(n)&amp;lt;/math&amp;gt;, has been derived from the structure of [[wikipedia:Rank-into-rank_cardinal|&amp;lt;math&amp;gt;\operatorname{I3}&amp;lt;/math&amp;gt;]] elementary embeddings, though it is unknown if this function can be shown to be total in &amp;lt;math&amp;gt;\operatorname{ZFC}&amp;lt;/math&amp;gt; alone, and whether it grows faster than the aforementioned &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt;. It is used in the following (conjectured) bounds:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(201) &amp;gt; q(5)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{S}(67) &amp;gt; q^{81}(q(5) - 2)&amp;lt;/math&amp;gt;&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1331570843829932063/1339669138510970881&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;racheline, &amp;quot;[https://wiki.bbchallenge.org/wiki/Talk:Champions Larger Champions]&amp;quot;. bbchallenge wiki talk post edit (February 2025). Accessed 7 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Resources ==&lt;br /&gt;
The Googology wiki hosts good information on methods of describing large numbers or large upper bounds for numbers.&lt;br /&gt;
&lt;br /&gt;
* https://googology.miraheze.org/wiki/Main_Page&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
[[Category:Guides]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Category:Guides&amp;diff=10510</id>
		<title>Category:Guides</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Category:Guides&amp;diff=10510"/>
		<updated>2026-11-10T01:52:00Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Created page with &amp;quot;Articles that are more narrative guide than encyclopedic content.&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Articles that are more narrative guide than encyclopedic content.&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Introduction_to_the_Busy_Beaver_Function&amp;diff=10509</id>
		<title>Introduction to the Busy Beaver Function</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Introduction_to_the_Busy_Beaver_Function&amp;diff=10509"/>
		<updated>2026-11-10T01:51:15Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Add Guides category&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The following is an informal explanation of what the [[Busy Beaver function]] means and how it is determined.&lt;br /&gt;
&lt;br /&gt;
The values of the Busy Beaver function are a result of playing the &#039;&#039;&#039;Busy Beaver game&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
Premise of the game:&lt;br /&gt;
&lt;br /&gt;
Imagine you have a robot on an infinite 1-dimensional tape full of zeros. Your friend challenges you to create a program that will allow the robot to turn those zeros into as many ones as possible.&lt;br /&gt;
&lt;br /&gt;
You think about it for a moment, and you have a genius idea. This is your program:&lt;br /&gt;
&lt;br /&gt;
* [State A]&lt;br /&gt;
** If I see 0: Turn it into a 1, Move to the Right, Stay on State A&lt;br /&gt;
** If I see 1: N/A&lt;br /&gt;
&lt;br /&gt;
Your robot turns a zero into a one, and then moves to the right. Your robot will then see another zero. This will occur infinitely often, creating an infinite number of ones! You win, right?&lt;br /&gt;
&lt;br /&gt;
Well, not quite. The busy beaver game forbids a program to have an infinite runtime (what use is a computer program that never ends?). In the busy beaver game, the robot must eventually halt.&lt;br /&gt;
&lt;br /&gt;
Ok, you think. Here is a program that can create arbitrarily many ones and then halt:&lt;br /&gt;
&lt;br /&gt;
* [State A]&lt;br /&gt;
** If I see 0: Turn it into a 1, Move to the Right, Go to State B&lt;br /&gt;
** If I see 1: N/A&lt;br /&gt;
* [State B]&lt;br /&gt;
** If I see 0: Turn it into a 1, Move to the Right, Go to State C&lt;br /&gt;
** If I see 1: N/A&lt;br /&gt;
* [State C]&lt;br /&gt;
** If I see 0: Turn it into a 1, Move to the Right, Go to State D&lt;br /&gt;
** If I see 1: N/A&lt;br /&gt;
* [State D]&lt;br /&gt;
** If I see 0: Turn it into a 1, Move to the Right, Go to State E&lt;br /&gt;
** If I see 1: N/A&lt;br /&gt;
* [State E]&lt;br /&gt;
** If I see 0: Turn it into a 1, Move to the Right, Go to State F&lt;br /&gt;
** If I see 1: N/A&lt;br /&gt;
* [State F]&lt;br /&gt;
** If I see 0: Turn it into a 1, Move to the Right, Go to State HALT&lt;br /&gt;
** If I see 1: N/A&lt;br /&gt;
&lt;br /&gt;
A robot running this program will create 6 ones before halting. But you can add as many states as you like, and the program will create that many ones. So you&#039;ve beaten the busy beaver game—you just need an extremely large number of states.&lt;br /&gt;
&lt;br /&gt;
For this reason, the busy beaver game sets a limit on the number of states your program can use. If we set the limit to 2 states, you can make the following program. I strongly suggest you get a paper and pencil and run this program manually. This will allow you to get a feel for how busy beaver programs work. (Note: the robot will always start on a tape full of zeros and on state A)&lt;br /&gt;
&lt;br /&gt;
* [State A]&lt;br /&gt;
** If I see 0: Turn it into a 1, Move to the Right, Go to State B&lt;br /&gt;
** If I see 1: Keep it a 1, Move to the Left, Go to State B&lt;br /&gt;
* [State B]&lt;br /&gt;
** If I see 0: Turn it into a 1, Move to the Left, Go to State A&lt;br /&gt;
** If I see 1: Keep it a 1, Move to the Right, Go to State HALT&lt;br /&gt;
&lt;br /&gt;
These individual points can be called the machines instructions. These instructions can also be given names according to which state they are in and which symbol is seen, for example: The instruction of state A which is used when a 0 is seen can be called A0. Alternatively, an instruction can also be called a transition. The content of a transition is usually given in the following form: symbol that is written, direction to move in and state to transition to. The halting state is commonly referred to as either H or Z. The transition which leads to the halting state is called the halting transition.&lt;br /&gt;
&lt;br /&gt;
Another way to show a programs transitions is in a transition table:&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot; style=&amp;quot;margin-left: auto; margin-right: auto;&amp;quot;&lt;br /&gt;
! !!0!!1&lt;br /&gt;
|-&lt;br /&gt;
!A&lt;br /&gt;
|1RB&lt;br /&gt;
|1LB&lt;br /&gt;
|-&lt;br /&gt;
!B&lt;br /&gt;
|1LA&lt;br /&gt;
|1RH&lt;br /&gt;
|}&lt;br /&gt;
The number above each column is the symbol which is seen while the letter next to each row is the state which sees that symbol.&lt;br /&gt;
&lt;br /&gt;
Another way to represent a program is the &#039;&#039;&#039;standard format&#039;&#039;&#039;, where the machines transitions are ordered based on which state they are in, beginning with state A. Different states are connected with underscores. Within a state, the transitions are ordered according to which symbol they are triggered by, beginning with 0.&lt;br /&gt;
&lt;br /&gt;
The program mentioned above would be 1RB1LB_1LA1RH in standard format.&lt;br /&gt;
&lt;br /&gt;
If you ran this program, you will see that the robot reaches the halt state on step 6, and it creates 4 ones in the process. And it turns out that this program is the best you can do with 2 states. Therefore, the busy beaver value for 2 states is 4 ones and 6 steps. In other words:&lt;br /&gt;
&lt;br /&gt;
* BB_Σ(2) = 4&lt;br /&gt;
* BB_S(2) = 6&lt;br /&gt;
[[Category:Guides]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BusyBeaverWiki:About&amp;diff=10504</id>
		<title>BusyBeaverWiki:About</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BusyBeaverWiki:About&amp;diff=10504"/>
		<updated>2026-11-09T23:22:19Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Tentative no AI content policy&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This wiki collects research, results and explanations about the Busy Beaver function and related models of computation.&lt;br /&gt;
&lt;br /&gt;
== AI Policy ==&lt;br /&gt;
We are currently in the process of developing an AI policy for our community that encourages productive contributions and avoid spam. For now the current policy is:&lt;br /&gt;
* The text of this wiki should be written by humans only: Please do not use AI to write or make significant additions to articles.&lt;br /&gt;
* AI may be used to format tables or other technical tasks or to edit human contributions, but should not be used to generate content.&lt;br /&gt;
* This restriction does not apply to User namespace pages, feel free to use AI there with attribution.&lt;br /&gt;
* Images produced using AI are also allowed with attribution.&lt;br /&gt;
* All AI produced content should be indicated as such with some text attribution.&lt;br /&gt;
* AI agents should not directly modify anything on this wiki.&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=TMBR:_July_2026&amp;diff=10424</id>
		<title>TMBR: July 2026</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=TMBR:_July_2026&amp;diff=10424"/>
		<updated>2026-11-08T21:15:37Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* General */ Add back in carrino&amp;#039;s BBB(4) progress&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{TMBRnav|June 2026|August 2026}}&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== General ==&lt;br /&gt;
&lt;br /&gt;
*Verification of BB(5) = 47,176,870 in Lean:&lt;br /&gt;
** On July 14, Marcelo Fornet used Claude AI to translate the proof of BB(5) = 47,176,870 to Lean, save for two machines: Skelet #1, and Skelet #17.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1218877181321678928/1526559214187581540]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 16, the non-halting proof for Skelet #17 was translated to Lean.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1218877181321678928/1527249976411947078]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 25, the non-halting proof for Skelet #1 was translated to Lean, &#039;&#039;&#039;thus completing the proof of BB(5) = 47,176,870 in Lean.&#039;&#039;&#039;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1218877181321678928/1530515342772666429]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*@carrino used Claude to begin work on proving the value of [[BBB]](4) and formalizing the result in Rocq. On July 31, they were down to less than 40 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1532864742983602366]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== BB Adjacent ==&lt;br /&gt;
&lt;br /&gt;
* [[SKI Calculus]]:&lt;br /&gt;
** Δ⁵ discovered several new champions for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(12),&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7894]&amp;lt;/sup&amp;gt;, Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(14),&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7968]&amp;lt;/sup&amp;gt; Ξ₀(12), Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(15),&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7996]&amp;lt;/sup&amp;gt; and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(16).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8083]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 27, Δ⁵ discovered a new pentational champion for Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(7) and new hexational champions for Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(8) and Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(9).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8050]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Δ⁵ discovered a new pentational champion for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(22), and new hexational champions for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(23), Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(24), and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(25).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8087]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 28, Δ⁵ discovered a new pentational champion for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(17).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8100]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[CounterScript]]:&lt;br /&gt;
** On July 16, Azerty discovered a logical leap in a claimed equivalence,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1527291163823050803]&amp;lt;/sup&amp;gt; prompting another re-enumeration of BBCS(11), leaving the same 1 holdout.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1527291256198402179]&amp;lt;/sup&amp;gt; This holdout was previously proven non-halting by sheep on May 17,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1554807350811168868]&amp;lt;/sup&amp;gt; racheline on July 8,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1524403079867535440]&amp;lt;/sup&amp;gt; and Tobias B on July 11.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1525470062515978252]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[General Recursive Function]]:&lt;br /&gt;
** On July 16, Shawn Ligocki reduced the size 16 M(PRF) holdout list to 15 and proved those remaining 15 non-halting by hand, proving that the max value is 6.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1527407138102841446]&amp;lt;/sup&amp;gt; He shared what appears to be the [[General Recursive Function#Hardest Size 13 (Triangular Divisibility)|hardest size 15 program]] which depends on logic for divisibility of triangular numbers.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1527405134857113650]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[Lambda Calculus]]:&lt;br /&gt;
** On July 20, [https://discord.com/channels/960643023006490684/1355653587824283678/1528855324881326181 BBλ(40) was solved], showing that BBλ(40) ≈ 10↑↑↑16. BBλ(40) is the first solved domain in any non-trivial BB variant to reach pentational values.&lt;br /&gt;
&lt;br /&gt;
* [[Post Tag System]]&lt;br /&gt;
** On July 21, Shawn Ligocki introduced the Busy Beaver function for Post Tag Systems, BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;(n),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1528865423393820672]&amp;lt;/sup&amp;gt; and provided champions for BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;(n) for sizes 7 to 11.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1528865627270549605]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki shared holdout lists for tag systems with sizes less than 12.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1529221470453108848]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 22, Shawn Ligocki proved the values of BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;(n) for sizes 1 to 6, and shared a set of 9 holdouts with sizes less than 9.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1529336029356494868]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 24, sheep discovered a supposedly &amp;quot;halting&amp;quot; tag system of size 11, with a mechanism similar to cryptids.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1530083642628374669]&amp;lt;/sup&amp;gt; However, after a careful simulation by Shawn Ligocki,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1530084069864640685]&amp;lt;/sup&amp;gt; it was realized that the system was an actual cryptid,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1530085758764056627]&amp;lt;/sup&amp;gt; showing BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;(11) is hard.&lt;br /&gt;
&lt;br /&gt;
* [[Wang Tiles]]&lt;br /&gt;
** On July 22, AlephSquirrel introduced the Busy Beaver function for Wang Tiles, BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(n), and proved the values of BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(1) and BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(2).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1529586687926210691]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, mathmasterzach established the lower bound BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(n) ≥ n.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1529615913509454105]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 23, sheep rediscovered literature&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1529742572090556437]&amp;lt;/sup&amp;gt; from Emmanuel Jeandel and Michael Rao that implies BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(10) ≥ 212, and is decidable.&amp;lt;sup&amp;gt;[https://arxiv.org/abs/1506.06492]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 24, AlephSquirrel proved BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(3) = 3.&lt;br /&gt;
** On July 25, AlephSquirrel proved BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(4) = 4.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1530697443820437645]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, AlephSquirrel found a new BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(5) champion.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1530722442761474218]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 26, Shawn Ligocki noted that the behavior of the BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(5) champion could be extended to establish the lower bound BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(n) ≥ 2n - 4.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1530747348366528604]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Holdouts ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+BB Holdout Reduction by Domain&lt;br /&gt;
!Domain&lt;br /&gt;
!Previous Holdout Count&lt;br /&gt;
!New Holdout Count&lt;br /&gt;
!Holdout Reduction&lt;br /&gt;
!% Reduction&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|1,094&lt;br /&gt;
|1,064&lt;br /&gt;
|30&lt;br /&gt;
|2.74%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,3)]]&lt;br /&gt;
|4,784,443&lt;br /&gt;
|4,747,566&lt;br /&gt;
|36,877&lt;br /&gt;
|0.77%&lt;br /&gt;
|}&lt;br /&gt;
* [[BB(6)]]&lt;br /&gt;
** On July 1, mxdys solved 4 holdouts in rocq.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1522010493529751604][https://discord.com/channels/960643023006490684/1239205785913790465/1522011143164657816]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 2, mxdys solved another holdout in rocq.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1522209150699044904]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 3, mxdys [https://discord.com/channels/960643023006490684/1239205785913790465/1522617640554860574 solved another holdout] in rocq with the help of an LLM.&lt;br /&gt;
** On July 28, prurq [https://discord.com/channels/960643023006490684/1239205785913790465/1531564686238027976 found a TM to halt]. This was [https://discord.com/channels/960643023006490684/1239205785913790465/1532416648533901503 verified by mxdys] in rocq two days later together with another machine.&lt;br /&gt;
** On the same day, mxdys [https://discord.com/channels/960643023006490684/1239205785913790465/1531681818439319604 released] a new holdouts list of &#039;&#039;&#039;1,064&#039;&#039;&#039; machines up to equivalence, a &#039;&#039;&#039;2.74%&#039;&#039;&#039; reduction compared to the previous holdouts list.&lt;br /&gt;
* [[BB(4,3)]]&lt;br /&gt;
** Andrew Ducharme reduced the number of holdouts from 4,784,443 to &#039;&#039;&#039;4,747,566&#039;&#039;&#039;, a &#039;&#039;&#039;0.77%&#039;&#039;&#039; reduction.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1522168741922607164][https://discord.com/channels/960643023006490684/1084047886494470185/1530496818155229294]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,5)]]&lt;br /&gt;
** On July 30, prurq simulated a holdout to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1532442006759018599]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(2,7)]]&lt;br /&gt;
**Terry Ligocki enumerated 180K more subtasks, increasing the number of holdouts to &#039;&#039;&#039;2,185,010,519&#039;&#039;&#039;. A total of 700K subtasks out of the 1 million subtasks (or &#039;&#039;&#039;70%&#039;&#039;&#039;) have been enumerated.&lt;br /&gt;
&lt;br /&gt;
[[Category:This Month in Beaver Research|2026-07]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=TMBR:_July_2026&amp;diff=10423</id>
		<title>TMBR: July 2026</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=TMBR:_July_2026&amp;diff=10423"/>
		<updated>2026-11-08T21:11:37Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* BB Adjacent */ Edit down some of the BB Adjacent section&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{TMBRnav|June 2026|August 2026}}&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== General ==&lt;br /&gt;
&lt;br /&gt;
*Verification of BB(5) = 47,176,870 in Lean:&lt;br /&gt;
** On July 14, Marcelo Fornet used Claude AI to translate the proof of BB(5) = 47,176,870 to Lean, save for two machines: Skelet #1, and Skelet #17.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1218877181321678928/1526559214187581540]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 16, the non-halting proof for Skelet #17 was translated to Lean.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1218877181321678928/1527249976411947078]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 25, the non-halting proof for Skelet #1 was translated to Lean, &#039;&#039;&#039;thus completing the proof of BB(5) = 47,176,870 in Lean.&#039;&#039;&#039;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1218877181321678928/1530515342772666429]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== BB Adjacent ==&lt;br /&gt;
&lt;br /&gt;
* [[SKI Calculus]]:&lt;br /&gt;
** Δ⁵ discovered several new champions for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(12),&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7894]&amp;lt;/sup&amp;gt;, Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(14),&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7968]&amp;lt;/sup&amp;gt; Ξ₀(12), Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(15),&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7996]&amp;lt;/sup&amp;gt; and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(16).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8083]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 27, Δ⁵ discovered a new pentational champion for Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(7) and new hexational champions for Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(8) and Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(9).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8050]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Δ⁵ discovered a new pentational champion for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(22), and new hexational champions for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(23), Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(24), and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(25).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8087]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 28, Δ⁵ discovered a new pentational champion for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(17).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8100]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[CounterScript]]:&lt;br /&gt;
** On July 16, Azerty discovered a logical leap in a claimed equivalence,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1527291163823050803]&amp;lt;/sup&amp;gt; prompting another re-enumeration of BBCS(11), leaving the same 1 holdout.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1527291256198402179]&amp;lt;/sup&amp;gt; This holdout was previously proven non-halting by sheep on May 17,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1554807350811168868]&amp;lt;/sup&amp;gt; racheline on July 8,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1524403079867535440]&amp;lt;/sup&amp;gt; and Tobias B on July 11.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1525470062515978252]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[General Recursive Function]]:&lt;br /&gt;
** On July 16, Shawn Ligocki reduced the size 16 M(PRF) holdout list to 15 and proved those remaining 15 non-halting by hand, proving that the max value is 6.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1527407138102841446]&amp;lt;/sup&amp;gt; He shared what appears to be the [[General Recursive Function#Hardest Size 13 (Triangular Divisibility)|hardest size 15 program]] which depends on logic for divisibility of triangular numbers.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1527405134857113650]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[Lambda Calculus]]:&lt;br /&gt;
** On July 20, [https://discord.com/channels/960643023006490684/1355653587824283678/1528855324881326181 BBλ(40) was solved], showing that BBλ(40) ≈ 10↑↑↑16. BBλ(40) is the first solved domain in any non-trivial BB variant to reach pentational values.&lt;br /&gt;
&lt;br /&gt;
* [[Post Tag System]]&lt;br /&gt;
** On July 21, Shawn Ligocki introduced the Busy Beaver function for Post Tag Systems, BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;(n),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1528865423393820672]&amp;lt;/sup&amp;gt; and provided champions for BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;(n) for sizes 7 to 11.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1528865627270549605]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki shared holdout lists for tag systems with sizes less than 12.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1529221470453108848]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 22, Shawn Ligocki proved the values of BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;(n) for sizes 1 to 6, and shared a set of 9 holdouts with sizes less than 9.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1529336029356494868]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 24, sheep discovered a supposedly &amp;quot;halting&amp;quot; tag system of size 11, with a mechanism similar to cryptids.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1530083642628374669]&amp;lt;/sup&amp;gt; However, after a careful simulation by Shawn Ligocki,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1530084069864640685]&amp;lt;/sup&amp;gt; it was realized that the system was an actual cryptid,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1530085758764056627]&amp;lt;/sup&amp;gt; showing BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;(11) is hard.&lt;br /&gt;
&lt;br /&gt;
* [[Wang Tiles]]&lt;br /&gt;
** On July 22, AlephSquirrel introduced the Busy Beaver function for Wang Tiles, BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(n), and proved the values of BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(1) and BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(2).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1529586687926210691]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, mathmasterzach established the lower bound BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(n) ≥ n.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1529615913509454105]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 23, sheep rediscovered literature&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1529742572090556437]&amp;lt;/sup&amp;gt; from Emmanuel Jeandel and Michael Rao that implies BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(10) ≥ 212, and is decidable.&amp;lt;sup&amp;gt;[https://arxiv.org/abs/1506.06492]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 24, AlephSquirrel proved BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(3) = 3.&lt;br /&gt;
** On July 25, AlephSquirrel proved BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(4) = 4.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1530697443820437645]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, AlephSquirrel found a new BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(5) champion.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1530722442761474218]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 26, Shawn Ligocki noted that the behavior of the BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(5) champion could be extended to establish the lower bound BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(n) ≥ 2n - 4.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1530747348366528604]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Holdouts ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+BB Holdout Reduction by Domain&lt;br /&gt;
!Domain&lt;br /&gt;
!Previous Holdout Count&lt;br /&gt;
!New Holdout Count&lt;br /&gt;
!Holdout Reduction&lt;br /&gt;
!% Reduction&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|1,094&lt;br /&gt;
|1,064&lt;br /&gt;
|30&lt;br /&gt;
|2.74%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,3)]]&lt;br /&gt;
|4,784,443&lt;br /&gt;
|4,747,566&lt;br /&gt;
|36,877&lt;br /&gt;
|0.77%&lt;br /&gt;
|}&lt;br /&gt;
* [[BB(6)]]&lt;br /&gt;
** On July 1, mxdys solved 4 holdouts in rocq.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1522010493529751604][https://discord.com/channels/960643023006490684/1239205785913790465/1522011143164657816]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 2, mxdys solved another holdout in rocq.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1522209150699044904]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 3, mxdys [https://discord.com/channels/960643023006490684/1239205785913790465/1522617640554860574 solved another holdout] in rocq with the help of an LLM.&lt;br /&gt;
** On July 28, prurq [https://discord.com/channels/960643023006490684/1239205785913790465/1531564686238027976 found a TM to halt]. This was [https://discord.com/channels/960643023006490684/1239205785913790465/1532416648533901503 verified by mxdys] in rocq two days later together with another machine.&lt;br /&gt;
** On the same day, mxdys [https://discord.com/channels/960643023006490684/1239205785913790465/1531681818439319604 released] a new holdouts list of &#039;&#039;&#039;1,064&#039;&#039;&#039; machines up to equivalence, a &#039;&#039;&#039;2.74%&#039;&#039;&#039; reduction compared to the previous holdouts list.&lt;br /&gt;
* [[BB(4,3)]]&lt;br /&gt;
** Andrew Ducharme reduced the number of holdouts from 4,784,443 to &#039;&#039;&#039;4,747,566&#039;&#039;&#039;, a &#039;&#039;&#039;0.77%&#039;&#039;&#039; reduction.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1522168741922607164][https://discord.com/channels/960643023006490684/1084047886494470185/1530496818155229294]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,5)]]&lt;br /&gt;
** On July 30, prurq simulated a holdout to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1532442006759018599]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(2,7)]]&lt;br /&gt;
**Terry Ligocki enumerated 180K more subtasks, increasing the number of holdouts to &#039;&#039;&#039;2,185,010,519&#039;&#039;&#039;. A total of 700K subtasks out of the 1 million subtasks (or &#039;&#039;&#039;70%&#039;&#039;&#039;) have been enumerated.&lt;br /&gt;
&lt;br /&gt;
[[Category:This Month in Beaver Research|2026-07]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=TMBR:_July_2026&amp;diff=10422</id>
		<title>TMBR: July 2026</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=TMBR:_July_2026&amp;diff=10422"/>
		<updated>2026-11-08T20:58:57Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Remove BBB(4) proof progress which I think belongs together in the big Aug announcement&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{TMBRnav|June 2026|August 2026}}&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== General ==&lt;br /&gt;
&lt;br /&gt;
*Verification of BB(5) = 47,176,870 in Lean:&lt;br /&gt;
** On July 14, Marcelo Fornet used Claude AI to translate the proof of BB(5) = 47,176,870 to Lean, save for two machines: Skelet #1, and Skelet #17.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1218877181321678928/1526559214187581540]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 16, the non-halting proof for Skelet #17 was translated to Lean.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1218877181321678928/1527249976411947078]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 25, the non-halting proof for Skelet #1 was translated to Lean, &#039;&#039;&#039;thus completing the proof of BB(5) = 47,176,870 in Lean.&#039;&#039;&#039;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1218877181321678928/1530515342772666429]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== BB Adjacent ==&lt;br /&gt;
&lt;br /&gt;
* [[SKI Calculus]]:&lt;br /&gt;
** On July 3, Δ⁵ discovered a new champion for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(12).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7894]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 10, Δ⁵ discovered new champions for Ξ₀(12) and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(14).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7968]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 19, Δ⁵ discovered new tetrational champions for Ξ₀(12), Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(15), Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(16), and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(17).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7996]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 27, Δ⁵ discovered a new pentational champion for Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(7) and new hexational champions for Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(8) and Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(9).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8050]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Δ⁵ tweaked the Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(16) champion, improving the bound by roughly 33%.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8083]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Δ⁵ discovered a new pentational champion for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(22), and new hexational champions for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(23), Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(24), and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(25).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8087]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 28, Δ⁵ discovered a new pentational champion for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(17).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8100]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[CounterScript]]:&lt;br /&gt;
** On July 16, Azerty discovered a logical leap in a claimed equivalence,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1527291163823050803]&amp;lt;/sup&amp;gt; prompting another re-enumeration of BBCS(11), leaving the same 1 holdout.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1527291256198402179]&amp;lt;/sup&amp;gt; This holdout was previously proven non-halting by sheep on May 17,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1554807350811168868]&amp;lt;/sup&amp;gt; racheline on July 8,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1524403079867535440]&amp;lt;/sup&amp;gt; and Tobias B on July 11.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1525470062515978252]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[General Recursive Function]]:&lt;br /&gt;
** On July 16, Shawn Ligocki found a size 13 version of a notable size 16 non-halting function which tested the divisibility of tetrahedral numbers.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1527405134857113650]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki proved that the largest number attained by a halting function of the form M(PRF) of size 13 is 6.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1527407138102841446][https://wiki.bbchallenge.org/w/index.php?title=General_Recursive_Function&amp;amp;oldid=8033]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[Lambda Calculus]]:&lt;br /&gt;
** On July 20, [https://discord.com/channels/960643023006490684/1355653587824283678/1528855324881326181 BBλ(40) was solved], showing that BBλ(40) ≈ 10↑↑↑16. BBλ(40) is the first solved domain in any non-trivial BB variant to reach pentational values.&lt;br /&gt;
&lt;br /&gt;
* [[Post Tag System]]&lt;br /&gt;
** On July 21, Shawn Ligocki introduced the Busy Beaver function for Post Tag Systems, BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;(n),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1528865423393820672]&amp;lt;/sup&amp;gt; and provided champions for BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;(n) for sizes 7 to 11.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1528865627270549605]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki shared holdout lists for tag systems with sizes less than 12.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1529221470453108848]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 22, Shawn Ligocki proved the values of BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;(n) for sizes 1 to 6, and shared a set of 9 holdouts with sizes less than 9.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1529336029356494868]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 24, sheep discovered a supposedly &amp;quot;halting&amp;quot; tag system of size 11, with a mechanism similar to cryptids.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1530083642628374669]&amp;lt;/sup&amp;gt; However, after a careful simulation by Shawn Ligocki,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1530084069864640685]&amp;lt;/sup&amp;gt; it was realized that the system was an actual cryptid,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1530085758764056627]&amp;lt;/sup&amp;gt; showing BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;(11) is hard.&lt;br /&gt;
&lt;br /&gt;
* [[Wang Tiles]]&lt;br /&gt;
** On July 22, AlephSquirrel introduced the Busy Beaver function for Wang Tiles, BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(n), and proved the values of BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(1) and BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(2).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1529586687926210691]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, mathmasterzach established the lower bound BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(n) ≥ n.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1529615913509454105]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 23, sheep rediscovered literature&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1529742572090556437]&amp;lt;/sup&amp;gt; from Emmanuel Jeandel and Michael Rao that implies BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(10) ≥ 212, and is decidable.&amp;lt;sup&amp;gt;[https://arxiv.org/abs/1506.06492]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 24, AlephSquirrel proved BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(3) = 3.&lt;br /&gt;
** On July 25, AlephSquirrel proved BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(4) = 4.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1530697443820437645]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, AlephSquirrel found a new BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(5) champion.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1530722442761474218]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 26, Shawn Ligocki noted that the behavior of the BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(5) champion could be extended to establish the lower bound BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(n) ≥ 2n - 4.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1530747348366528604]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Holdouts ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+BB Holdout Reduction by Domain&lt;br /&gt;
!Domain&lt;br /&gt;
!Previous Holdout Count&lt;br /&gt;
!New Holdout Count&lt;br /&gt;
!Holdout Reduction&lt;br /&gt;
!% Reduction&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|1,094&lt;br /&gt;
|1,064&lt;br /&gt;
|30&lt;br /&gt;
|2.74%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,3)]]&lt;br /&gt;
|4,784,443&lt;br /&gt;
|4,747,566&lt;br /&gt;
|36,877&lt;br /&gt;
|0.77%&lt;br /&gt;
|}&lt;br /&gt;
* [[BB(6)]]&lt;br /&gt;
** On July 1, mxdys solved 4 holdouts in rocq.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1522010493529751604][https://discord.com/channels/960643023006490684/1239205785913790465/1522011143164657816]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 2, mxdys solved another holdout in rocq.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1522209150699044904]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On July 3, mxdys [https://discord.com/channels/960643023006490684/1239205785913790465/1522617640554860574 solved another holdout] in rocq with the help of an LLM.&lt;br /&gt;
** On July 28, prurq [https://discord.com/channels/960643023006490684/1239205785913790465/1531564686238027976 found a TM to halt]. This was [https://discord.com/channels/960643023006490684/1239205785913790465/1532416648533901503 verified by mxdys] in rocq two days later together with another machine.&lt;br /&gt;
** On the same day, mxdys [https://discord.com/channels/960643023006490684/1239205785913790465/1531681818439319604 released] a new holdouts list of &#039;&#039;&#039;1,064&#039;&#039;&#039; machines up to equivalence, a &#039;&#039;&#039;2.74%&#039;&#039;&#039; reduction compared to the previous holdouts list.&lt;br /&gt;
* [[BB(4,3)]]&lt;br /&gt;
** Andrew Ducharme reduced the number of holdouts from 4,784,443 to &#039;&#039;&#039;4,747,566&#039;&#039;&#039;, a &#039;&#039;&#039;0.77%&#039;&#039;&#039; reduction.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1522168741922607164][https://discord.com/channels/960643023006490684/1084047886494470185/1530496818155229294]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,5)]]&lt;br /&gt;
** On July 30, prurq simulated a holdout to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1532442006759018599]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(2,7)]]&lt;br /&gt;
**Terry Ligocki enumerated 180K more subtasks, increasing the number of holdouts to &#039;&#039;&#039;2,185,010,519&#039;&#039;&#039;. A total of 700K subtasks out of the 1 million subtasks (or &#039;&#039;&#039;70%&#039;&#039;&#039;) have been enumerated.&lt;br /&gt;
&lt;br /&gt;
[[Category:This Month in Beaver Research|2026-07]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=TMBR:_June_2026&amp;diff=10420</id>
		<title>TMBR: June 2026</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=TMBR:_June_2026&amp;diff=10420"/>
		<updated>2026-11-08T20:05:46Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Move Misc -&amp;gt; General to top, tidy up GRF and add a small lede&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{TMBRnav|May 2026|July 2026}}&lt;br /&gt;
&lt;br /&gt;
[[:Category:This Month in Beaver Research|This Month in Beaver Research]] for June 2026. This month, Tristan presented the BB(5) paper at the ACM Symposium on Theory of Computing (STOC), [[BB(7)]] holdouts were reduced 11%, and several new champions were found across BB Adjacent models including [[BBλ]](39) solved.&lt;br /&gt;
== Talks ==&lt;br /&gt;
&lt;br /&gt;
* On 24 June, Tristan Stérin presented the [https://arxiv.org/abs/2509.12337 BB(5) paper] at STOC 2026 in Salt Lake City, USA.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1151558585344593950/1519344431801827339]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Papers ==&lt;br /&gt;
*William Gasarch. 2026. &#039;&#039;Relationships Between the Busy Beaver Function and Mathematics I: What is the Smallest n such that BB(n) &amp;gt; ...?&#039;&#039; SIGACT News 57, 2 (June 2026), 22–35. https://doi.org/10.1145/3819804.3819808&lt;br /&gt;
&lt;br /&gt;
== General ==&lt;br /&gt;
* On 19 June, Marcelo Fornet shared a Lean formalization proving the BB(4) value.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1218877181321678928/1517441864226181120]&amp;lt;/sup&amp;gt; They are working on extending it to BB(5).&lt;br /&gt;
&lt;br /&gt;
== BB Adjacent ==&lt;br /&gt;
[[Lambda Calculus|Busy Beaver for Lambda Calculus]]:&lt;br /&gt;
* [https://discord.com/channels/960643023006490684/1355653587824283678/1514278149049811058 BBλ(39) was solved] on 10 June, showing that BBλ(39) = 5 × 3&amp;lt;sup&amp;gt;3&amp;lt;sup&amp;gt;3&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;+ 6.&lt;br /&gt;
* Work began on BBλ(40), which was reduced to 2 holdouts&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1517706496606081127]&amp;lt;/sup&amp;gt; and BBλ(41), which was reduced to 93 holdouts.&lt;br /&gt;
* A list of BBλ(42) holdouts was also added to the [https://docs.google.com/spreadsheets/d/1jZ6TK9m3xmXUlC69727T-8WwvhALcsp8FrK6DzgThtw/edit?gid=1544675322#gid=1544675322 BBλ-spreadsheet].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1517130491512492083]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[SKI Calculus]]:&lt;br /&gt;
* New champions were discovered for Ξ₀(10), Ξ₀(13), Ξ₀(14), Ξ₀(15), Ξ₀(16), Ξ₀(17), Ξ₀(18) and Ξ₀(19).&lt;br /&gt;
* New [[SKI Calculus#SK calculus|SK calculus]] champions were discovered for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(18) and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(26), showing Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(26) to be larger than Graham&#039;s number.&lt;br /&gt;
* New [[SKI Calculus#BCKW system|BCKW system]] champions were discovered for Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(7), Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(8) and Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(9).&lt;br /&gt;
[[CounterScript]]:&lt;br /&gt;
* On 12 June, sheep constructed a size 85 champion with score 2&amp;lt;sup&amp;gt;q(5)}&amp;lt;/sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1514987825127358615]&amp;lt;/sup&amp;gt;, where q is a fast growing function arising from [https://en.wikipedia.org/wiki/Laver_table Laver tables]. A day later, sheep showed that BBCS(89 + k) ≥ 2&amp;lt;sup&amp;gt;P&amp;lt;sup&amp;gt;k&amp;lt;/sup&amp;gt;(0)&amp;lt;/sup&amp;gt; where P(x) = q(x + 1).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1515330464683004044]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 15 June, [[User:Sligocki|Shawn Ligocki]] discovered new champions for BBCS(13)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1515955533641809950]&amp;lt;/sup&amp;gt; and BBCS(14).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1515954591445815459]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 20 June, sheep discovered two new champions ([https://discord.com/channels/960643023006490684/1484108791636033659/1517854233020338216 first], [https://discord.com/channels/960643023006490684/1484108791636033659/1517857681086611457 second]) for BBCS(19) in quick succession, as well as new champions for BBCS(24) and BBCS(25).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1517888154722504985]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 29 June, Azerty discovered multiple new bugs in the BBCS enumerator in quick succession,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1521169450101903540]&amp;lt;/sup&amp;gt; prompting a re-ennumeration of BBCS(11), leaving 51 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1521169450101903540]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 30 June, Azerty discovered more bugs in the BBCS enumerator,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1521541279698387155]&amp;lt;/sup&amp;gt; prompting another re-ennumeration of BBCS(11), leaving 51 holdouts again.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1521541279698387155]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[Fractran]]:&lt;br /&gt;
* On 1 June, [[User:Sligocki|Shawn Ligocki]] discovered a new BBf(23) champion which runs for over 4.393 × 10&amp;lt;sup&amp;gt;124&amp;lt;/sup&amp;gt; steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1510769318978129970]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* BBf(23) holdouts were reduced by 27.20% from 29,250 to 21,295.&lt;br /&gt;
[[Register machine|Register Machines]]:&lt;br /&gt;
* @-d discovered new champions for MBB(8) and MBB(9).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1514082985664712824]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* MBB(6) = 49 was proven.&lt;br /&gt;
[[General Recursive Function|General Recursive Functions]]:&lt;br /&gt;
* On 23 June, [[User:Sligocki|Shawn Ligocki]] enumerated all PRF&#039;s of size 23&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1518981870254297138]&amp;lt;/sup&amp;gt; and discovered a new champion PRF of size 23 with score &amp;lt;math&amp;gt;&amp;gt; 10^{10^{130}}&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1519059600081555467]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 26 June, Shawn Ligocki discovered a new champion showing BBµ(17) ≥  58,471.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1521327240732737536]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Branching Beaver]]:&lt;br /&gt;
&lt;br /&gt;
* Shawn Ligocki introduced the Branching Beaver (BrB(n,m)) function which is a variation of the Busy Beaver function, but where the tape is a graph where every node has 3 neighbors.&lt;br /&gt;
* Shawn computed exact values BrB(1) = 3 and BrB(2) = 10 and champions BrB(3) ≥ 52, BrB(4) ≥ 4636,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1515457952104845485]&amp;lt;/sup&amp;gt; BrB(2,3) ≥ 68, BrB(2,4) ≥ 332372. Enumeration sizes of BrB TMs is larger than for traditional BB TMs, so solving these values is expected to by harder than solving traditional BB.&lt;br /&gt;
&lt;br /&gt;
== Holdouts ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+BB Holdout Reduction by Domain&lt;br /&gt;
!Domain&lt;br /&gt;
!Previous Holdout Count&lt;br /&gt;
!New Holdout Count&lt;br /&gt;
!Holdout Reduction&lt;br /&gt;
!% Reduction&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|1,104&lt;br /&gt;
|1,094&lt;br /&gt;
|10&lt;br /&gt;
|0.91%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(7)]]&lt;br /&gt;
|17,823,260&lt;br /&gt;
|15,743,264&lt;br /&gt;
|2,079,996&lt;br /&gt;
|11.67%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,3)]]&lt;br /&gt;
|5,127,263&lt;br /&gt;
|4,784,443&lt;br /&gt;
|342,820&lt;br /&gt;
|6.69%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,6)]]&lt;br /&gt;
|413,513&lt;br /&gt;
|412,086&lt;br /&gt;
|1,427&lt;br /&gt;
|0.35%&lt;br /&gt;
|}&lt;br /&gt;
*[[BB(6)]]&lt;br /&gt;
**mxdys solved four TMs with FAR.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1512100325673271407][https://discord.com/channels/960643023006490684/1239205785913790465/1512309665244123239][https://discord.com/channels/960643023006490684/1239205785913790465/1513904347422134374][https://discord.com/channels/960643023006490684/1239205785913790465/1516821341678866523]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**prurq solved another four TMs with FAR.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1513898370606039080][https://discord.com/channels/960643023006490684/1239205785913790465/1515998682053345320][https://discord.com/channels/960643023006490684/1239205785913790465/1516787722537140345]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** A TM was [https://discord.com/channels/960643023006490684/1239205785913790465/1515209217106251827 shown to be non-halting] by hipparcos, which was later [https://discord.com/channels/960643023006490684/1239205785913790465/1516464297407021086 confirmed in Rocq] by mxdys.&lt;br /&gt;
** On 21 June, Peacemaker II [https://discord.com/channels/960643023006490684/1239205785913790465/1518173416870510652 solved another TM] by running FAR with high parameters.&lt;br /&gt;
** On 29 June, hipparcos [https://discord.com/channels/960643023006490684/1521145274142036069/1521145274142036069 showed another TM] to be non-halting. This was verified in rocq by mxdys the same day.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1521199140220964954]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** mxdys [https://discord.com/channels/960643023006490684/1239205785913790465/1521203430046171146 released] a new holdouts list of &#039;&#039;&#039;1,094&#039;&#039;&#039; machines up to equivalence, this is a &#039;&#039;&#039;0.91%&#039;&#039;&#039; reduction compared to the previous holdouts list.&lt;br /&gt;
*[[BB(7)]]&lt;br /&gt;
**Using new GPU-based direct simulation, David SG reduced the number of remaining holdouts from 17,823,260 to &#039;&#039;&#039;16,949,557&#039;&#039;&#039;, a &#039;&#039;&#039;4.90%&#039;&#039;&#039; reduction.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1512553945837605016]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**Andrew Ducharme further reduced the amount of holdouts by &#039;&#039;&#039;7.12%&#039;&#039;&#039; to &#039;&#039;&#039;15,743,264&#039;&#039;&#039; by running mxdys&#039;s FAR decider with various parameters.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1516364912375627816]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(4,3)]]&lt;br /&gt;
**Andrew Ducharme reduced the number of holdouts from 5,127,263 to &#039;&#039;&#039;4,784,443&#039;&#039;&#039;, a &#039;&#039;&#039;6.69%&#039;&#039;&#039; reduction, using FAR.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1518549639228424252][https://discord.com/channels/960643023006490684/1084047886494470185/1519630042643169360][https://discord.com/channels/960643023006490684/1084047886494470185/1520871028988055623]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(2,6)]]&lt;br /&gt;
**Andrew Ducharme reduced the number of holdouts from 413,513 to &#039;&#039;&#039;412,086&#039;&#039;&#039;, a &#039;&#039;&#039;0.35%&#039;&#039;&#039; reduction.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1512386039933698128]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(2,7)]]&lt;br /&gt;
**Terry Ligocki enumerated 170K more subtasks, increasing the number of holdouts to &#039;&#039;&#039;1,623,113,079&#039;&#039;&#039;. A total of 520K subtasks out of the 1 million subtasks (or &#039;&#039;&#039;52%&#039;&#039;&#039;) have been enumerated.&lt;br /&gt;
&lt;br /&gt;
[[Category:This Month in Beaver Research|2026-06]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=TMBR:_June_2026&amp;diff=10417</id>
		<title>TMBR: June 2026</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=TMBR:_June_2026&amp;diff=10417"/>
		<updated>2026-11-08T18:56:42Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Update Gasarch citation&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{TMBRnav|May 2026|July 2026}}&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Talks ==&lt;br /&gt;
&lt;br /&gt;
* On 24 June, Tristan Stérin presented the [https://arxiv.org/abs/2509.12337 BB(5) paper] at STOC 2026 in Salt Lake City, USA.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1151558585344593950/1519344431801827339]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Papers ==&lt;br /&gt;
*William Gasarch. 2026. &#039;&#039;Relationships Between the Busy Beaver Function and Mathematics I: What is the Smallest n such that BB(n) &amp;gt; ...?&#039;&#039; SIGACT News 57, 2 (June 2026), 22–35. https://doi.org/10.1145/3819804.3819808&lt;br /&gt;
&lt;br /&gt;
== BB Adjacent ==&lt;br /&gt;
[[Lambda Calculus|Busy Beaver for Lambda Calculus]]:&lt;br /&gt;
* [https://discord.com/channels/960643023006490684/1355653587824283678/1514278149049811058 BBλ(39) was solved] on 10 June, showing that BBλ(39) = 5 × 3&amp;lt;sup&amp;gt;3&amp;lt;sup&amp;gt;3&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;+ 6.&lt;br /&gt;
* Work began on BBλ(40), which was reduced to 2 holdouts&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1517706496606081127]&amp;lt;/sup&amp;gt; and BBλ(41), which was reduced to 93 holdouts.&lt;br /&gt;
* A list of BBλ(42) holdouts was also added to the [https://docs.google.com/spreadsheets/d/1jZ6TK9m3xmXUlC69727T-8WwvhALcsp8FrK6DzgThtw/edit?gid=1544675322#gid=1544675322 BBλ-spreadsheet].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1517130491512492083]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[SKI Calculus]]:&lt;br /&gt;
* New champions were discovered for Ξ₀(10), Ξ₀(13), Ξ₀(14), Ξ₀(15), Ξ₀(16), Ξ₀(17), Ξ₀(18) and Ξ₀(19).&lt;br /&gt;
* New [[SKI Calculus#SK calculus|SK calculus]] champions were discovered for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(18) and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(26), showing Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(26) to be larger than Graham&#039;s number.&lt;br /&gt;
* New [[SKI Calculus#BCKW system|BCKW system]] champions were discovered for Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(7), Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(8) and Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(9).&lt;br /&gt;
[[CounterScript]]:&lt;br /&gt;
* On 12 June, sheep constructed a size 85 champion with score 2&amp;lt;sup&amp;gt;q(5)}&amp;lt;/sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1514987825127358615]&amp;lt;/sup&amp;gt;, where q is a fast growing function arising from [https://en.wikipedia.org/wiki/Laver_table Laver tables]. A day later, sheep showed that BBCS(89 + k) ≥ 2&amp;lt;sup&amp;gt;P&amp;lt;sup&amp;gt;k&amp;lt;/sup&amp;gt;(0)&amp;lt;/sup&amp;gt; where P(x) = q(x + 1).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1515330464683004044]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 15 June, [[User:Sligocki|Shawn Ligocki]] discovered new champions for BBCS(13)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1515955533641809950]&amp;lt;/sup&amp;gt; and BBCS(14).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1515954591445815459]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 20 June, sheep discovered two new champions ([https://discord.com/channels/960643023006490684/1484108791636033659/1517854233020338216 first], [https://discord.com/channels/960643023006490684/1484108791636033659/1517857681086611457 second]) for BBCS(19) in quick succession, as well as new champions for BBCS(24) and BBCS(25).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1517888154722504985]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 29 June, Azerty discovered multiple new bugs in the BBCS enumerator in quick succession,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1521169450101903540]&amp;lt;/sup&amp;gt; prompting a re-ennumeration of BBCS(11), leaving 51 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1521169450101903540]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 30 June, Azerty discovered more bugs in the BBCS enumerator,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1521541279698387155]&amp;lt;/sup&amp;gt; prompting another re-ennumeration of BBCS(11), leaving 51 holdouts again.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1521541279698387155]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[Fractran]]:&lt;br /&gt;
* On 1 June, [[User:Sligocki|Shawn Ligocki]] discovered a new BBf(23) champion which runs for over 4.393 × 10&amp;lt;sup&amp;gt;124&amp;lt;/sup&amp;gt; steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1510769318978129970]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* BBf(23) holdouts were reduced by 27.20% from 29,250 to 21,295.&lt;br /&gt;
[[Register machine|Register Machines]]:&lt;br /&gt;
* @-d discovered new champions for MBB(8) and MBB(9).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1514082985664712824]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* MBB(6) = 49 was proven.&lt;br /&gt;
[[General Recursive Function|General Recursive Functions]]:&lt;br /&gt;
* [[User:Sligocki|Shawn Ligocki]] enumerated all PRF&#039;s of size 23.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1518981870254297138]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 24 June Shawn Ligocki discovered a new champion PRF of size 23.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1519059600081555467]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 25 June Shawn Ligocki [https://discord.com/channels/960643023006490684/1447627603698647303/1519579483617755316 discovered a new BBµ(19) champion].&lt;br /&gt;
* On 26 June Shawn Ligocki discovered two new BBµ(17) champions in quick succession.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1521270196193464521][https://discord.com/channels/960643023006490684/1447627603698647303/1521327240732737536]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Branching Beaver]]:&lt;br /&gt;
&lt;br /&gt;
* Shawn Ligocki introduced the Branching Beaver (BrB(n,m)) function which is a variation of the Busy Beaver function, but where the tape is a graph where every node has 3 neighbors.&lt;br /&gt;
* Shawn computed exact values BrB(1) = 3 and BrB(2) = 10 and champions BrB(3) ≥ 52, BrB(4) ≥ 4636,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1515457952104845485]&amp;lt;/sup&amp;gt; BrB(2,3) ≥ 68, BrB(2,4) ≥ 332372. Enumeration sizes of BrB TMs is larger than for traditional BB TMs, so solving these values is expected to by harder than solving traditional BB.&lt;br /&gt;
&lt;br /&gt;
== Misc ==&lt;br /&gt;
* On 19 June, Marcelo Fornet shared a Lean formalization proving the BB(4) value.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1218877181321678928/1517441864226181120]&amp;lt;/sup&amp;gt; They are working on extending it to BB(5).&lt;br /&gt;
* Discord user Jack set up a big number competition inspired by the [https://googology.miraheze.org/wiki/Bignum_Bakeoff Bignum Bakeoff].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1511117192681230517]&amp;lt;/sup&amp;gt; While a few entries were made&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1511756831754813551]&amp;lt;/sup&amp;gt;, the contest quickly lost traction and was abandoned.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1412433481803497542/1557189852498235404]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Holdouts ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+BB Holdout Reduction by Domain&lt;br /&gt;
!Domain&lt;br /&gt;
!Previous Holdout Count&lt;br /&gt;
!New Holdout Count&lt;br /&gt;
!Holdout Reduction&lt;br /&gt;
!% Reduction&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|1,104&lt;br /&gt;
|1,094&lt;br /&gt;
|10&lt;br /&gt;
|0.91%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(7)]]&lt;br /&gt;
|17,823,260&lt;br /&gt;
|15,743,264&lt;br /&gt;
|2,079,996&lt;br /&gt;
|11.67%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,3)]]&lt;br /&gt;
|5,127,263&lt;br /&gt;
|4,784,443&lt;br /&gt;
|342,820&lt;br /&gt;
|6.69%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,6)]]&lt;br /&gt;
|413,513&lt;br /&gt;
|412,086&lt;br /&gt;
|1,427&lt;br /&gt;
|0.35%&lt;br /&gt;
|}&lt;br /&gt;
*[[BB(6)]]&lt;br /&gt;
**mxdys solved four TMs with FAR.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1512100325673271407][https://discord.com/channels/960643023006490684/1239205785913790465/1512309665244123239][https://discord.com/channels/960643023006490684/1239205785913790465/1513904347422134374][https://discord.com/channels/960643023006490684/1239205785913790465/1516821341678866523]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**prurq solved another four TMs with FAR.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1513898370606039080][https://discord.com/channels/960643023006490684/1239205785913790465/1515998682053345320][https://discord.com/channels/960643023006490684/1239205785913790465/1516787722537140345]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** A TM was [https://discord.com/channels/960643023006490684/1239205785913790465/1515209217106251827 shown to be non-halting] by hipparcos, which was later [https://discord.com/channels/960643023006490684/1239205785913790465/1516464297407021086 confirmed in Rocq] by mxdys.&lt;br /&gt;
** On 21 June, Peacemaker II [https://discord.com/channels/960643023006490684/1239205785913790465/1518173416870510652 solved another TM] by running FAR with high parameters.&lt;br /&gt;
** On 29 June, hipparcos [https://discord.com/channels/960643023006490684/1521145274142036069/1521145274142036069 showed another TM] to be non-halting. This was verified in rocq by mxdys the same day.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1521199140220964954]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** mxdys [https://discord.com/channels/960643023006490684/1239205785913790465/1521203430046171146 released] a new holdouts list of &#039;&#039;&#039;1,094&#039;&#039;&#039; machines up to equivalence, this is a &#039;&#039;&#039;0.91%&#039;&#039;&#039; reduction compared to the previous holdouts list.&lt;br /&gt;
*[[BB(7)]]&lt;br /&gt;
**Using new GPU-based direct simulation, David SG reduced the number of remaining holdouts from 17,823,260 to &#039;&#039;&#039;16,949,557&#039;&#039;&#039;, a &#039;&#039;&#039;4.90%&#039;&#039;&#039; reduction.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1512553945837605016]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**Andrew Ducharme further reduced the amount of holdouts by &#039;&#039;&#039;7.12%&#039;&#039;&#039; to &#039;&#039;&#039;15,743,264&#039;&#039;&#039; by running mxdys&#039;s FAR decider with various parameters.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1516364912375627816]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(4,3)]]&lt;br /&gt;
**Andrew Ducharme reduced the number of holdouts from 5,127,263 to &#039;&#039;&#039;4,784,443&#039;&#039;&#039;, a &#039;&#039;&#039;6.69%&#039;&#039;&#039; reduction, using FAR.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1518549639228424252][https://discord.com/channels/960643023006490684/1084047886494470185/1519630042643169360][https://discord.com/channels/960643023006490684/1084047886494470185/1520871028988055623]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(2,6)]]&lt;br /&gt;
**Andrew Ducharme reduced the number of holdouts from 413,513 to &#039;&#039;&#039;412,086&#039;&#039;&#039;, a &#039;&#039;&#039;0.35%&#039;&#039;&#039; reduction.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1512386039933698128]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(2,7)]]&lt;br /&gt;
**Terry Ligocki enumerated 170K more subtasks, increasing the number of holdouts to &#039;&#039;&#039;1,623,113,079&#039;&#039;&#039;. A total of 520K subtasks out of the 1 million subtasks (or &#039;&#039;&#039;52%&#039;&#039;&#039;) have been enumerated.&lt;br /&gt;
&lt;br /&gt;
[[Category:This Month in Beaver Research|2026-06]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=TMBR:_September_2026&amp;diff=10416</id>
		<title>TMBR: September 2026</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=TMBR:_September_2026&amp;diff=10416"/>
		<updated>2026-11-08T18:56:17Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Add Gasarch column #2&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{TMBRnav|August 2026|October 2026}}&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
This month in Beaver Research: This month saw a clear up-tick in solved BB(6) machines. A large factor in this was the increasing use of AI solvers.&lt;br /&gt;
&lt;br /&gt;
== Media ==&lt;br /&gt;
&lt;br /&gt;
* September 1, 2026. Nick Drozd. [https://nickdrozd.github.io/2026/09/01/tetrational-self-cleaning-turing-machine.html A Tetrational Self-Cleaning Turing Machine].&lt;br /&gt;
* William Gasarch. 2026. &#039;&#039;Relationships Between the Busy Beaver Function and Mathematics II:Small Turing Machines and Open Problems&#039;&#039;. SIGACT News 57, 3 (September 2026), 25–50. https://doi.org/10.1145/3848065.3848068&lt;br /&gt;
&lt;br /&gt;
== Champions ==&lt;br /&gt;
&lt;br /&gt;
* On September 1, nickdrozd discovered a new [[BLB|BLB(3,3)]] champion which runs for over 10 ↑↑ 6.54 steps before blanking the tape.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770474897080380/1544448259437895680]&amp;lt;/sup&amp;gt; Note that this is not a new [[BBB|BBB(3,3)]] champion.&lt;br /&gt;
* On September 9, @-d discovered a new [[BBf|BBf(24)]] champion which runs for over 9.000 × 10&amp;lt;sup&amp;gt;14,448&amp;lt;/sup&amp;gt; steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1547182811713380383]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== BB Adjacent ==&lt;br /&gt;
&lt;br /&gt;
* [[Cyclic Tag]]&lt;br /&gt;
** On September 1, Azerty enumerated all BBCT programs up to size 14, proving the values of BBCT(n) for n &amp;lt; 7.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1542262029430292501/1544315541383155784]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 2, sheep discovered new champions for BBCT(11),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1542262029430292501/1544351459846529134]&amp;lt;/sup&amp;gt; BBCT(13),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1542262029430292501/1544368872973664337]&amp;lt;/sup&amp;gt; and BBCT(14).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1542262029430292501/1544633416064962611]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 5, Azerty proved BBCT(7) = 13.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1542262029430292501/1545914357777571951]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Cellular Automata Busy Beaver&lt;br /&gt;
** On September 1, Azerty introduced an extension to mxdys&#039;s BB1dCA(n) function, called BBCA(n),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1544449379027525692/1544449379027525692]&amp;lt;/sup&amp;gt; and discovered a champion for BBCA(3).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1544449379027525692/1544450495769350165]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 2, Azerty discovered champions for BBCA(2), BBCA(3), BBCA(4), BBCA(2,3), and BBCA(2,4).&amp;lt;sup&amp;gt;[https://github.com/AzertyWasTaken/Busy-Beaver/commit/9b9fdf5719899c3b99c88a3c20cfaf4e210212ce#diff-6592f17ae2c30022dac537f021e42737edeff658a96c47ca285e2c301b8e1415]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 20, Azerty discovered new champions for BBCA(4), BBCA(3,3), and BBCA(2,4), and proved BBCA(2,3) = 4.&amp;lt;sup&amp;gt;[https://github.com/AzertyWasTaken/Busy-Beaver/commit/b9f2fa8eeaa40c3cdede7b39d4f9785185eaf10a#diff-6592f17ae2c30022dac537f021e42737edeff658a96c47ca285e2c301b8e1415]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[General Recursive Function]]&lt;br /&gt;
** On September 5, after Shawn Ligocki renewed interest in a certain chaotic BBµ(16) holdout last month, sheep devised a method to accelerate the simulation of the holdout.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1545730338725171250]&amp;lt;/sup&amp;gt; This allowed her to confirm that, if the holdout returned a value, it would be larger than 3.124 × 10&amp;lt;sup&amp;gt;16&amp;lt;/sup&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1260977480316092527/1546531543290224701]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 7, the aforementioned method was ported to Rust by @ZTS439, allowing them to extend the bound to 4.999 × 10&amp;lt;sup&amp;gt;17&amp;lt;/sup&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1546666535911821413]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* PLUSMINUS&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1546687220390567948]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 8, @Jack introduced PLUSMINUS, a new esoteric language.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1546687220390567948]&amp;lt;/sup&amp;gt; Though its completeness is unknown, this language is not expected to be Turing-complete.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1546687246231666688]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 9, @mathmasterzach discovered champion PLUSMINUS strings for sizes 9,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1547051560972845178]&amp;lt;/sup&amp;gt; 11,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1547050522425561209]&amp;lt;/sup&amp;gt; 12,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1547054625134477342]&amp;lt;/sup&amp;gt;, 15, and 16.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1547296154105159722/1547336527334613092]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, @Furious discovered champion PLUSMINUS strings for sizes 1 to 8&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1547258179589775523]&amp;lt;/sup&amp;gt; and size 10-14.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1547296154105159722/1547300240019816589]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, racheline provided an estimate for the halting times of programs under a simplified model of PLUSMINUS.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1547306730487283832]&amp;lt;/sup&amp;gt; This suggests that PLUSMINUS may be near the edge of Turing-completeness.&lt;br /&gt;
** On September 10, @Furious converted the rules of PLUSMINUS into a piecewise mathematical function.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1547296154105159722/1547678473429065831]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 11, @Jack discovered champion PLUSMINUS strings for sizes 20, 23, 32, 36, and 40.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1547296154105159722/1548057628503179335]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[Post Tag System]] (alternate definition)&lt;br /&gt;
** On September 12, Azerty introduced an alternate formulation of the Busy Beaver function for Post Tag Systems, where a system in the BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;*(m, n) domain may continue running even if it reduces to less than m symbols;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1547326637488738314/1548436378050625629]&amp;lt;/sup&amp;gt; in this formulation, the BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;(11) [[Cryptid]] &amp;lt;code&amp;gt;11111_20_1&amp;lt;/code&amp;gt; is non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1547326637488738314/1548483710909812889]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 16, Azerty enumerated all 2-tag systems with size less than or equal to 9&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1547326637488738314/1549745884596797580]&amp;lt;/sup&amp;gt;, and proved the values of BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;*(n) for sizes 1 to 5.&lt;br /&gt;
** On the same day, sheep discovered a new BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;*(9) champion.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1547326637488738314/1549811809081626755]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 30, sheep discovered a 2-tag size 11 Cryptid, showing BB&amp;lt;sub&amp;gt;PT&amp;lt;/sub&amp;gt;*(11) is hard;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1547326637488738314/1554759504560656415]&amp;lt;/sup&amp;gt; Azerty expects there to be smaller Cryptids,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1547326637488738314/1554818815093907468]&amp;lt;/sup&amp;gt; likely referring to systems with their tape length history similar to a biased random walk.&lt;br /&gt;
* [[Fractran]]&lt;br /&gt;
** On September 13, @-d completed enumeration of BBf(24), leaving an initial 6,733,785 holdouts, which were reduced to 231,432 holdouts, or 10,838 holdouts if ai-created deciders are used.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1548561426262790144]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [https://github.com/AzertyWasTaken/Busy-Beaver/tree/main/Ordered%Rewrite%20System Ordered Rewrite System]&lt;br /&gt;
** On September 16, @andrewthebonfire and Azerty introduced the Busy Beaver function on Ordered rewrite systems,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1549603291791360051][https://discord.com/channels/960643023006490684/1243312334907375676/1549678817470058516][https://discord.com/channels/960643023006490684/1243312334907375676/1549767379490447501]&amp;lt;/sup&amp;gt; with Azerty later finding BBOR(n) champions for sizes 1 to 8, and proving the values of BBOR(n) for sizes 1 to 4.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1549853449015795764]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 17, @andrewthebonfire provided a method to convert Turing machines into ordered rewrite systems.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1550137065969287220]&amp;lt;/sup&amp;gt; He also showed that ordered rewrite systems with a binary alphabet (i.e. two symbols) are still Turing-complete.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1550139787456020560]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 30, sheep discovered a size 17 Cryptid, showing BBOR(17) is hard.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1554501166388351179]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[Register machine|Register Machine]]&lt;br /&gt;
** On September 18, @mineralli discovered a new MBB(9) champion.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1550599643031670875]&amp;lt;/sup&amp;gt; sheep then discovered four new champions for MBB(9) in the four following days.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1550932034040635585][https://discord.com/channels/960643023006490684/1243312334907375676/1551127274244411494][https://discord.com/channels/960643023006490684/1243312334907375676/1551194371435790418][https://discord.com/channels/960643023006490684/1243312334907375676/1551985291198210071]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, @elgan65536 discovered a new MBB(8,2) champion.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1550504258401599609]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 23, sheep discovered champions for MBB(11)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1552283247889612861]&amp;lt;/sup&amp;gt; and MBB(12).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1552284085781667851]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 25, sheep discovered an MBB(10) champion,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1552360261900435537]&amp;lt;/sup&amp;gt; which was shown to halt in around 10&amp;lt;sup&amp;gt;2,629,437&amp;lt;/sup&amp;gt; steps by Shawn Ligocki.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1552690832006447186]&amp;lt;/sup&amp;gt; This champion prompted a rework of Ligocki&#039;s hydra-like rule accelerator.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1553109975528902729]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 29, @mineralli discovered a 5-register, 19-state machine which halts iff the Erdős ternary conjecture is false.&lt;br /&gt;
** On the same day, sheep discovered a 7-register, 28-state machine beating [[Graham&#039;s number]].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1554558141964886190]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 30, @mineralli discovered a new MBB(11,2) champion,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1554893821857501236]&amp;lt;/sup&amp;gt; improved upon by sheep.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1554913439695249570]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Pebble Automaton|Pebble Eating]]&lt;br /&gt;
** On September 30, sheep discovered an 86 pebble Cryptid, showing peBBle(86) is hard.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1554751849742082102]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Holdouts ==&lt;br /&gt;
* [[BB(6)]]&lt;br /&gt;
** By September 4, mxdys solved all 16 Counter Class 1 TMs.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1545487019218698290]&lt;br /&gt;
** On September 4, Discord user fifi_49513 claimed to have proven a TM non-halting. &amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1545543031468462150/1545543031468462150]&amp;lt;/sup&amp;gt; This machine was later confirmed non-halting in Rocq on September 5 by mxdys. &amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1545543031468462150/1545682001481175095]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 8, mxdys released a new holdouts list of &#039;&#039;&#039;964&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1546881471556620339]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 14, an independent computation by Seiji extended the [[Space Needle]] trajectory to &#039;&#039;&#039;100,000,000&#039;&#039;&#039; terms: no power of 2 was ever encountered, and the most factors of 2 any term had was &#039;&#039;&#039;25&#039;&#039;&#039; (first occurring at n = 23,145,881; the previously documented state was &amp;gt;17,000,000 terms with max 24). The full final value (94,125,050 bits) is published with SHA-256 anchors, together with 400 checkpoints cross-verified by two independent implementations, and exact macro step-count laws of the machine (L0–L4; L1 and L3 formally proven). &amp;lt;sup&amp;gt;[https://github.com/oohzaim1-afk/space-needle-100M]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 16, mxdys released another holdouts list of &#039;&#039;&#039;855&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1549771931677364264]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 24, mxdys released another holdouts list of &#039;&#039;&#039;815&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1552681541401059350]&amp;lt;/sup&amp;gt; The newly solved holdouts include:&lt;br /&gt;
*** [[BMO|BMO9]] &lt;br /&gt;
*** Two shift-overflow bell counters &lt;br /&gt;
*** 31 shift-overflow mixed-digits counters with similar behavior &lt;br /&gt;
*** two new translated cyclers (also shift-overflow mixed-digits counters) with high period &lt;br /&gt;
*** two other shift-overflow counters&lt;br /&gt;
**On September 24, Discord user q64 simulated a TM to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1552399839269224498]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**The halting status of {{TM|1RB1LA_1RC1RE_1LD0RB_1LA0LC_0RF0RD_0RB---}} was formalized without new axioms by avoiding the use of Baker–Wüstholz theorem.&lt;br /&gt;
**On September 30, mxdys released another holdouts list of &#039;&#039;&#039;797&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1554765260735512616]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(2,5)]]&lt;br /&gt;
**On September 8, mxdys released a new holdouts list of &#039;&#039;&#039;60&#039;&#039;&#039; machines.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1546880921318326282]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**On September 25 and 26, prurq claimed to have used Aristotle AI and GPT6 to solve 21 of the 60 remaining holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1552990521650319453][https://discord.com/channels/960643023006490684/1259770421046411285/1553433274762919997 &amp;lt;nowiki&amp;gt;[67]&amp;lt;/nowiki&amp;gt;]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,7)]]&lt;br /&gt;
** Terry Ligocki enumerated 30K more subtasks, increasing the number of holdouts to &#039;&#039;&#039;3,062,427,379&#039;&#039;&#039;. A total of 980K subtasks out of the 1 million subtasks (or &#039;&#039;&#039;98%&#039;&#039;&#039;) have been enumerated.&lt;br /&gt;
&lt;br /&gt;
== Misc ==&lt;br /&gt;
* On September 2, RobinCodes began work on updating the BB(6) holdout [https://docs.google.com/spreadsheets/d/1mMp8bAcTFT91j7azn72liX8NSTwc2E_ozKnOGTfRCfw/edit?pli=1&amp;amp;gid=1330361301#gid=1330361301 spreadsheet].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1544742905850236978]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On September 5, [[User:XnoobSpeakable|XnoobSpeakable]] began an opt-in archival project of the bbchallenge Discord server.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1545742987710038088]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On September 23, Joseph M. Shunia published a preprint presenting a 120-state, 2-symbol TM that halts iff Riemann hypothesis is false.&amp;lt;sup&amp;gt;[https://arxiv.org/abs/2609.30306]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On September 22, Twitter user @_Mira___Mira_, claimed to have used GPT-6 Astra to discover a 387-state, 2-symbol TM whose halting status is [[Independence from ZFC|independent of ZFC]].&amp;lt;sup&amp;gt;[https://twitter.com/_Mira___Mira_/status/2102108613028560993]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 24, they claimed to have reduced this to a 314-state ZFC-independent TM, and claimed to have found a 289-state, 2-symbol PA-independent TM.&amp;lt;sup&amp;gt;[https://twitter.com/_Mira___Mira_/status/2102796188265439626]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On September 30, they claimed to have reduced these to a 256-state ZFC-independent TM , and a 238-state PA-independent TM, after a series of improvements. A Metamath formalization is in progress.&amp;lt;sup&amp;gt;[https://twitter.com/_Mira___Mira_/status/2105184649098268774]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On September 28, Twitter user @_Mira___Mira_ discovered a fractal related to the Antihydra conjecture.&amp;lt;sup&amp;gt;[https://twitter.com/_Mira___Mira_/status/2104539527117513127]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:This Month in Beaver Research|2026-09]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=TMBR:_August_2026&amp;diff=10415</id>
		<title>TMBR: August 2026</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=TMBR:_August_2026&amp;diff=10415"/>
		<updated>2026-11-08T18:37:11Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Edit down several sections that I think went into a bit too much detail. Especially the Fractran section which I think can be summarized a bit more suscinctly&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{TMBRnav|July 2026|September 2026}}&lt;br /&gt;
[[File:Sligocki BBB 4 equals 32779478.png|thumb|757x757px|BBB(4) = 32,779,478 was proven this month by @carrino using Claude AI. The first 71 steps of the champion, {{TM|1RB1LD_1RC1RB_1LC1LA_0RC0RD|halt}}, are depicted in this spacetime diagram, using Shawn Ligocki&#039;s [https://github.com/sligocki/busy-beaver/blob/main/Code/Visual_Simulator Visual Simulator]. (Credit: [https://www.sligocki.com/2021/07/17/bb-collatz.html Shawn Ligocki])]][[:Category:This Month in Beaver Research|This Month in Beaver Research]] for August 2026.&lt;br /&gt;
&lt;br /&gt;
This month saw us finally cross the long-awaited milestone of less than &#039;&#039;&#039;1,000 holdouts&#039;&#039;&#039; in [[BB(6)]], after a flurry of simulations, as well as proofs from users both new and old, resulting in &#039;&#039;65&#039;&#039; holdouts being solved this month. mxdys has also added the 9th and 10th problems to the [[Beaver Math Olympiad]]. [[BB(4,3)]] recorded small but substantial reductions in holdouts, while Terry Ligocki&#039;s enumeration of [[BB(2,7)]] slowly but surely reaches the 85% mark.&lt;br /&gt;
&lt;br /&gt;
This month was also quite a busy one for BB-adjacent functions. Most notably, for [[Beeping Busy Beaver]] functions, &#039;&#039;&#039;BBB(4) = 32,779,478&#039;&#039;&#039;, proven by @carrino! &#039;&#039;&#039;BBλ(41) = 5 × 3&amp;lt;sup&amp;gt;3&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt; + 6&#039;&#039;&#039; has also been proven this month, and BBf(23) has been almost completely solved, save for 12 Cryptids and 1 oddball machine. creeperman7002 has been working in the field of [[Terminating Turmite|Terminating Turmites]], finding a machine that demonstrates TT(3,3) &amp;gt; 2.27 × 10&amp;lt;sup&amp;gt;248&amp;lt;/sup&amp;gt;, while reducing the domain to under 20,000 holdouts. Δ⁵ has also been incrementally finding new large champions for the [[SKI Calculus#Champions|SKI]] and [[SKI Calculus#SK calculus|SK]] calculi, and the [[SKI Calculus#BCKW system|BCKW system]], notably finding 6 new &#039;&#039;hexational&#039;&#039;-level champions in the calculi! &lt;br /&gt;
&lt;br /&gt;
The Busy Beaver functions for [[Pebble Automaton|Pebble Automata]] and [[Cyclic Tag]] have been introduced; [[Collatz-like]] behavior has already been detected amongst small pebble automata, but no Cryptids have been found as of yet, unlike in cyclic tag, where a size 36 Cryptid has been found. [[Diophantine Equation|Diophantine Equations]] have also received some research this month through attempts to find Cryptids and new champions, many of which are related to the [[wikipedia:Sums_of_three_cubes|sums of three cubes]] problem. A new family of champions has also been found for the Busy Beaver function for [[Wang Tiles]], and Shawn Ligocki has recently revived discussion about a small but chaotic and possible Cryptid [[General Recursive Function]]. A primality test and a program that computes the Fibonacci numbers have also been created in [[CounterScript]].&lt;br /&gt;
&lt;br /&gt;
There has also been extensive discussion on what should classify a machine or a program as a [[Cryptid]], due to the wide range of &#039;&#039;potential&#039;&#039; Cryptids in BB(6) (most notably [[BMO1]]) and how virtually all of the known machines or programs classified as Cryptids rely, at least in part, on [[Collatz-like#Why is Collatz randomness mysterious?|Collatz-like randomness]]; a new definition of Cryptid may even include solved machines with behaviors reminiscent of diabolically hard but solved problems, such as Fermat&#039;s Last Theorem.&lt;br /&gt;
&lt;br /&gt;
== General ==&lt;br /&gt;
&lt;br /&gt;
* On August 2, @carrino, using Claude AI solved the last [[BBB]](4) 290 holdouts remaining in the Coq proof, meaning &#039;&#039;&#039;BBB(4) is solved!&#039;&#039;&#039;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1533342110005334046]&amp;lt;/sup&amp;gt; Specifically, @carrino [https://github.com/carrino/Coq-BBB4 proved] that &#039;&#039;&#039;BBB(4) = 32,779,478&#039;&#039;&#039;, the champion being {{TM|1RB1LC_1RD1RB_0RD0RC_1LD1LA|halt}}, discovered by Nick Drozd in July 2021, which [[Quasihalt|quasihalts]] by turning into a period 1 [[translated cycler]] after 32,779,478 steps.&amp;lt;sup&amp;gt;[https://nickdrozd.github.io/2021/07/11/self-cleaning-turing-machine.html]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== BB Adjacent ==&lt;br /&gt;
&lt;br /&gt;
* [[Fractran]]&lt;br /&gt;
** On August 1, @-d used Opus 4.8 to write two deciders, potentially reducing the number of BBf(23) holdouts from 21,233 to 694&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1532980960281366548]&amp;lt;/sup&amp;gt; and then decide 602 of those individually. As a result of additional equivalences and implications proven, the unofficial holdouts list for BBf(23) was reduced to 21.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1532984416434126848]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 4, @-d and Opus had further reduced the holdout list to 13 of which 12 follow Hydra-like biased pseudorandom walks and are thus [[Cryptids]].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1534417541265363087]&amp;lt;/sup&amp;gt; The remaining holdout (#601) was analyzed by Shawn Ligocki and had a sort of mixture of Collatz-like and [[BMO1]]-like behavior.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1533155623137710270]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 22, @-d enumerated 20% of BBf(24) (the complete enumeration is expected to take 6 times longer than that of BBf(23).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1538703088263761992]&amp;lt;/sup&amp;gt;), discovering a new champion which runs for over 4.804 × 10&amp;lt;sup&amp;gt;1,184&amp;lt;/sup&amp;gt; steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1540831684071530637]&amp;lt;/sup&amp;gt; Shawn Ligocki discovered another champion among that set which runs for over 9.263 × 10&amp;lt;sup&amp;gt;9,595&amp;lt;/sup&amp;gt; steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1540835303202492467]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Terminating Turmite|Terminating Turmites]]&lt;br /&gt;
** On August 2, Discord user creeperman7002 discovered a new step and score champion for TT(3,3), &amp;lt;code&amp;gt;1PB2PA0PC_2TB1PC2PB_2PB1PZ0PA&amp;lt;/code&amp;gt;, running for 715,764,479 steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1533503518906912778]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 8, Discord user creeperman7002 discovered a new step champion for TT(3,3), &amp;lt;code&amp;gt;1PB0TC1PA_2PC1PZ2PA_2TC0PA2PC&amp;lt;/code&amp;gt;, running for over 2.27 × 10&amp;lt;sup&amp;gt;248&amp;lt;/sup&amp;gt; steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1535305073259974728]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 11, Discord user creeperman7002 released a TT(3,3) holdouts list consisting of 19,368 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1536748429089448036]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[SKI Calculus]]&lt;br /&gt;
** On August 6, Δ⁵ discovered a new champion for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(16).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8184]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Δ⁵ discovered a new champion for Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(6).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8185]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 14, Δ⁵ discovered another new champion for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(16).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8235]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 20, Δ⁵ discovered new hexational champions for Ξ₀(17), Ξ₀(18), and Ξ₀(19) in the SKI calculus, and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(23), Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(24), and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(25) in the SK calculus.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8345]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Δ⁵ discovered another new champion for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(25).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=8347]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Lambda Calculus]]&lt;br /&gt;
** On August 7, &#039;&#039;&#039;BBλ(41) was solved!&#039;&#039;&#039;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1535401128164982865]&amp;lt;/sup&amp;gt; We now know that &#039;&#039;&#039;BBλ(41) = 5 × 3&amp;lt;sup&amp;gt;3&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt; + 6&#039;&#039;&#039; after solving 237 holdouts, thanks to the help of 2014MELO03, cppdecksucker, mxdys, and others.&amp;lt;sup&amp;gt;[https://docs.google.com/spreadsheets/d/1jZ6TK9m3xmXUlC69727T-8WwvhALcsp8FrK6DzgThtw/edit?gid=1605140783#gid=1605140783]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** As a result, the bet between Sam and cppdecksucker (which began in April&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1492986885302390834]&amp;lt;/sup&amp;gt;) has also concluded; cppdecksucker, who lost the bet on whether there would be any Cryptids shorter than 42 bits, has donated 50 NZD to the Mermaids charity.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1535811720742834256]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[File:AlephSquirrel PE 9 Bounded By 63,577.png|thumb|AlephSquirrel has found a new champion for peBBle(9), which runs for 63,577 steps, by modifying mathmasterzach&#039;s 323 step 9-pebble automaton. The first 200 steps of this champion are displayed here using AlephSquirrel&#039;s [https://www.uiua.org/pad?src=0_20_0-dev_1__eJxNkTFrAkEQhfv9FUtsFJHsHQZSihapkohXSKph8AY9srmTdS_BdLlCcEFMlUKuSCAhTcCUgqSx9V_MLwmnmDjdfPAeb940EzRhNwrtQPLkWXpKicCise1kJOUO1cVVYGlYrHvgKyVaiU7MP2pq7N1Ch0K4Nhj3CW5I6-QBLgxRDK0xxtDUKUE7NUNNcIl9ii1CdxBZEp1UU2DNwetEKVA-KA_qCrw6eD4oBWc-nHsnQrDLFLu8XGuoCrsVT18bcGSwm5JsoxmRxDiUOBxSHMoojmyEWippkgfBs5xn0zK7uQcKfHbZNq9tvtnN2a1Oq5U_J1mSLdS9VKMlGVgcy3vUKY0ET9ab5aEo_looniybf1XWOHsqwn2uCwNDhfqQYGTRkuDZR_m0ytM3nqyLDJulx7Mpvy8KmZtXjiovySC62yUQ_PLDWVbf5uzm8ugFR1Pa8-hxfz7FGk2fxC_nlrju simulator], with colors corresponding to the numbers of pebbles in a single cell. (Credit: [https://discord.com/channels/960643023006490684/1535695107448381591/1540746719711592468 AlephSquirrel])|506x506px]]&lt;br /&gt;
* [[Pebble Automaton]]&lt;br /&gt;
** On August 8, AlephSquirrel introduced the Busy Beaver function for Pebble Automata, peBBle(n), proving the values of peBBle(n) for sizes 1 to 3.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1362008236118511758/1535670546564517962]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, sheep discovered an infinite family of automata, including the champion for peBBle(4), showing peBBle(n) ≥ &amp;lt;math&amp;gt;\frac{n(n-1)}{2}&amp;lt;/math&amp;gt;. &amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1362008236118511758/1535689051783561276]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 9, AlephSquirrel discovered a new champion for peBBle(5).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1536023084975525999]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 10, Deccy discovered a new champion for peBBle(6)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1536522647620288543]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 11, Deccy discovered a new champion for peBBle(7).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1536590281355558973]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 13, mathmasterzach discovered 3 new peBBle(8) champions in quick succession,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1537519181350576211][https://discord.com/channels/960643023006490684/1535695107448381591/1537522881435803648][https://discord.com/channels/960643023006490684/1535695107448381591/1537528571394793563]&amp;lt;/sup&amp;gt; and the previous peBBle(9) champion, which runs for 323 steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1537542232780050553]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 16, AlephSquirrel proved the peBBle(4) champion to be optimal.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1538717455562711070]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 17, AlephSquirrel tweaked the peBBle(9) champion, creating a new automaton which runs for 63,577 steps, a new bound for peBBle(9).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1539048792400203796]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Diophantine Equation]]&lt;br /&gt;
** On August 12, Shawn Ligocki discovered new bounds for BBdio(n) for heights 40, 48, 57, and 66, based on work done in the [[wikipedia:Sums_of_three_cubes|sums of three cubes]] problem.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Diophantine_Equation&amp;amp;diff=next&amp;amp;oldid=8225][https://discord.com/channels/960643023006490684/1461768250575687897/1536964575403188274]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki suggested calling the equation &amp;lt;math&amp;gt;x^3 + y^3 + z^3 = 114&amp;lt;/math&amp;gt;, and similar equations from the sums of three cubes problem, Cryptids,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1461768250575687897/1536965442931785808][https://wiki.bbchallenge.org/w/index.php?title=Diophantine_Equation&amp;amp;diff=next&amp;amp;oldid=8228]&amp;lt;/sup&amp;gt; though their classification was later changed to that of [[User:RobinCodes/Machines at the Edge|energy vampire]],&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Diophantine_Equation&amp;amp;diff=next&amp;amp;oldid=8229]&amp;lt;/sup&amp;gt; following an objection by sheep;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1260977480316092527/1536968875864752128][https://discord.com/channels/960643023006490684/1461768250575687897/1536971493886394440]&amp;lt;/sup&amp;gt; she suggested calling them &amp;quot;energy vampired [sic]&amp;quot;,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1260977480316092527/1536970056473518122]&amp;lt;/sup&amp;gt; as these equations are expected to be solvable in practice, though they may be computationally hard to find solutions for.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1260977480316092527/1536968991036416021]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 14, Shawn Ligocki [https://arxiv.org/abs/2108.08705 rediscovered] [https://arxiv.org/abs/2108.08705 papers] (and a [https://mathoverflow.net/questions/400714/can-you-solve-the-listed-smallest-open-diophantine-equations# post] on StackExchange) from Bogdan Grechuk that imply BBdio(29) &amp;gt; 10&amp;lt;sup&amp;gt;6&amp;lt;/sup&amp;gt;,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1461768250575687897/1537856884617519217]&amp;lt;/sup&amp;gt; and that BBdio(31) is decidable.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1461768250575687897/1537851026600890389]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 23, star discovered the height 78 equation &amp;lt;math&amp;gt;a^4 + b^4 - c^4 + 30 = 0&amp;lt;/math&amp;gt;, which is expected to not have any solutions, but may be very difficult to prove.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1461768250575687897/1540801391117860904]&amp;lt;/sup&amp;gt;. She also discovered the height 135 equation &amp;lt;math&amp;gt;w^5 + x^5 + y^5 + z^5 - 7 = 0&amp;lt;/math&amp;gt;,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1461768250575687897/1540783109858005112]&amp;lt;/sup&amp;gt; which may be difficult to prove unsatisfiable, in much the same way that the sums of three cubes problem is hard.&lt;br /&gt;
* [[CounterScript]]&lt;br /&gt;
** On August 13, Azerty made a size 16 program which returns the nth Fibonacci number.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1537402069441445950]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 15, sheep made a size 35 program that tests the primality of a number.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1538208545437253682]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 21, Shawn Ligocki completed the simulation of BBCS(14) out to 10,000 steps (using their own way of counting steps), finding no machines that improve the existing bound of BBCS(14) ≥ 129.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1540211861033721896]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 24, sheep discovered a set of Collatz-like programs,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1541383920627482704]&amp;lt;/sup&amp;gt; some of which simulate random unbiased walks.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1541387004326060032][https://discord.com/channels/960643023006490684/1484108791636033659/1541390451536302111][https://discord.com/channels/960643023006490684/1484108791636033659/1541394136769368088]&amp;lt;/sup&amp;gt; However, they are not champions, due to the existence of smaller tetrational and pentational machines.&lt;br /&gt;
** On the same day, Shawn Ligocki released a personal BBCS(12) holdouts list consisting of 13,580 holdouts, used for direct simulation.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1541441005323288698]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[File:BusyBeaverWangTiles CurrentChampion 9.png|thumb|A new champion for BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(9) can be obtained from a generalization of sheep&#039;s BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(7) champion, found this month. This new champion is a set of 9 tiles, which can tile any n×n square up to n = 17, and no larger; in this image of the maximal 17×17 square patch, created using sheep&#039;s [https://www.desmos.com/calculator/i7oehithgg tile viewer], tiling rules are denoted by colors, similar to other depictions of Wang tiles. (Credit: [https://discord.com/channels/960643023006490684/1529586687926210691/1537894960882516108 sheep])|258x258px]]&lt;br /&gt;
&lt;br /&gt;
* [[Wang Tiles]]&lt;br /&gt;
** On August 14, sheep discovered a new BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(7) champion.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1537845339661279312]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Azerty made a statement implying the lower bound BB&amp;lt;sub&amp;gt;WT&amp;lt;/sub&amp;gt;(n) ≥ 3n - 10.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1529586687926210691/1537848435695288340]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [[Cyclic Tag]]&lt;br /&gt;
** On August 26, Azerty introduced the Busy Beaver function for Cyclic Tag Systems, BBCT(n),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1542262029430292501/1542262029430292501]&amp;lt;/sup&amp;gt; proving the values of BBCT(n) for sizes 1 to 4, and providing lower bounds for BBCT(n) for sizes 1 to 12.&amp;lt;sup&amp;gt;[https://github.com/AzertyWasTaken/Busy-Beaver/commit/061aa4e673fae7075acace31d7bdfe84335be6a2#diff-a177a3ffe5c6adf57915af06385abc1ba1859c949520c226b076c022be4f4941]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, sheep rediscovered literature that provided lower bounds for BBCT(n) for sizes 1 to 9.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1542262029430292501/1542516475313528912]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 30, sheep discovered a size 36 Cryptid, showing BBCT(36) is hard.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1542262029430292501/1543586754777452636]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[General Recursive Function]]&lt;br /&gt;
** On August 27, Shawn Ligocki renewed interest in a size 16 chaotic (possibly Cryptid) GRF previously discovered in May,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542357048128184431]&amp;lt;/sup&amp;gt; during a discussion on what behaviors should be required to classify a Cryptid.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1540837601458782368]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Holdouts ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&#039;&#039;&#039;BB Holdout Reduction by Domain&#039;&#039;&#039;&lt;br /&gt;
!Domain&lt;br /&gt;
!New Holdout Count&lt;br /&gt;
!Previous Holdout Count&lt;br /&gt;
!Holdout Reduction&lt;br /&gt;
!% Reduction&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|999&lt;br /&gt;
|1,064&lt;br /&gt;
|65&lt;br /&gt;
|6.11%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,3)]]&lt;br /&gt;
|4,720,332&lt;br /&gt;
|4,747,566&lt;br /&gt;
|27,234&lt;br /&gt;
|0.57%&lt;br /&gt;
|}&lt;br /&gt;
[[File:TMBR August prurq 2.63e304 step halter 1RB0LB 0RC1RF 1LD1RE 0LA0RB 0RD0LD 0LE---.png|thumb|466x466px|prurq simulated an impressive 4 BB(6) holdouts to halting this month; one of the machines simulated,  {{TM|1RB0LB_0RC1RF_1LD1RE_0LA0RB_0RD0LD_0LE---|halt}}, is shown here in mxdys&#039;s general [https://ccz181078.github.io/TM/LongAcc/index.html accelerated simulator] using [[Longitudinal Analysis|longitudinal analysis]], which prurq used to confirm the result. (Image source: [https://discord.com/channels/960643023006490684/1239205785913790465/1533889409332674763 prurq])]]&lt;br /&gt;
* [[BB(6)]]&lt;br /&gt;
** On August 1, mxdys added BMO9 ({{TM|1RB1LA_1RC0RD_1LA---_1RE1RD_1LF0LA_---0LE|halt}}) and BMO10 ({{TM|1RB0LB_0RC0LD_1LD1RE_0LA0RF_0RD1RF_0RC---|halt}}) to the [[Beaver Math Olympiad]].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1533036863118508215][https://discord.com/channels/960643023006490684/1239205785913790465/1533044040403124336]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** BMO9 simulates a behavior (shared by 10 other holdouts&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1397544528612823101]&amp;lt;/sup&amp;gt;) similar to that of a stack,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1397544528612823101]&amp;lt;/sup&amp;gt; whereas BMO10, a shift-overflow counter, also displays a behavior that resembles that of a one-dimensional cellular automaton.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1533044040403124336]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 3, prurq simulated three machines to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1533572940459675791][https://discord.com/channels/960643023006490684/1239205785913790465/1533837709452251227][https://discord.com/channels/960643023006490684/1239205785913790465/1533889409332674763]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 4, q64 [https://github.com/Quantum64/busycoq/blob/BB6/verify/1RB1RE_1LC1LF_1LD1LC_1RA0LB_---0RF_0RD1RF.v proved] another machine halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1534370964350042263]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 15, Discord user jacobrschwartz [https://github.com/JacobRSchwartz-AI/bb6-holdouts proved] another machine halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1538044554286993418]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, mxdys released a new holdouts list of &#039;&#039;&#039;1,016&#039;&#039;&#039; machines up to equivalence,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1538109685033607198]&amp;lt;/sup&amp;gt; this is a &#039;&#039;&#039;4.51%&#039;&#039;&#039; reduction compared to the previous holdouts lists.&lt;br /&gt;
** On the same day, mxdys, using an LLM, produced proofs deciding 20 machines (the entirety of Counter Class 1, and 4 [[Dekaheptoid|Dekaheptoids]]); 2 of these proofs (both belonging to Dekaheptoids) have been confirmed, whereas the other 18 proofs are under review.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1538130536168693804]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** mxdys also says that the LLM has produced 32 other Rocq proofs, and has helped them find configurations in existing deciders that settle 10 other holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1538130536168693804]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 24, Discord user flintt_6 informally [https://github.com/golirt1/bb6-shift-overflow-analysis proved] another machine halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1541418968806334515]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, mxdys released a list of machines that are easy to accelerate using the UBRRBA decider, consisting of 86 machines.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1541486462330085496]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 25, prurq simulated another machine to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1541911355278495845]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 26, q64 [https://github.com/Quantum64/busycoq/blob/BB6/verify/1RB1RF_1RC1RB_1LD0RA_1LA1LE_---0LF_0LC1LF.v proved] another machine halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1542210565404098652]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 29, mxdys released another holdouts list of &#039;&#039;&#039;1,003&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1543436534831906926]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On August 31, mxdys released another holdouts list of &#039;&#039;&#039;999&#039;&#039;&#039; machines up to equivalence,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1543878992195620884]&amp;lt;/sup&amp;gt; breaking the 1,000 holdout barrier.&lt;br /&gt;
* [[BB(4,3)]]&lt;br /&gt;
** Andrew Ducharme reduced the number of holdouts from 4,747,566 to &#039;&#039;&#039;4,720,332&#039;&#039;&#039; (a 0.57% reduction) via the mxdys FAR decider.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1537224012185210910]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(2,7)]]&lt;br /&gt;
**Terry Ligocki enumerated 150K more subtasks, increasing the number of holdouts to &#039;&#039;&#039;2,651,060,579&#039;&#039;&#039;. A total of 850K subtasks out of the 1 million subtasks (or &#039;&#039;&#039;85%&#039;&#039;&#039;) have been enumerated.&lt;br /&gt;
&lt;br /&gt;
== Misc ==&lt;br /&gt;
&lt;br /&gt;
* On August 22, person89 began a discussion on what behaviors should be required to classify a machine, or another program, as a Cryptid.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1540652592340668427]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** This may be relevant to the classification of [[BMO1]], which is currently not considered a Cryptid,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1540837601458782368]&amp;lt;/sup&amp;gt; despite it sharing many aspects with mathematically hard problems.&lt;br /&gt;
** person89 has also suggested that machines or programs that would have relied on the validity of [[wikipedia:Fermat&#039;s_Last_Theorem|Fermat&#039;s Last Theorem]] (prior to Andrew Wiles&#039;s proof in 1994&amp;lt;sup&amp;gt;[https://www.jstor.org/stable/2118559]&amp;lt;/sup&amp;gt;) should be considered Cryptids in some sense, despite the problem being settled,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1541527287508377720]&amp;lt;/sup&amp;gt; due to the length, complexity, and technicality of the proof.&lt;br /&gt;
** Shawn Ligocki observed that the only programs that have been widely accepted as Cryptids are those that rely on Collatz-like randomness (e.g. [[Antihydra]], [[Lucy&#039;s Moonlight]]).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542200200091664505]&amp;lt;/sup&amp;gt; They also brought up recent discussion about [[Diophantine Equation|Diophantine Equations]]&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542201592504131725]&amp;lt;/sup&amp;gt; about whether the smallest holdout equations can be considered Cryptids by virtue of being simple, open problems in number theory;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1461768250575687897/1538993715417194647]&amp;lt;/sup&amp;gt; they believe otherwise, as not much effort has been put into deciding these holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542201927205527553]&amp;lt;/sup&amp;gt; (See also: discussion about whether &amp;lt;math&amp;gt;x^3 + y^3 + z^3 = 114&amp;lt;/math&amp;gt; and other unsolved sums of three cubes problems are Cryptids). They also suggest that Cryptid-ness could instead considered as a spectrum, rather than a black-or-white category,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542202781669265540]&amp;lt;/sup&amp;gt; such as considering Fermat&#039;s Last Theorem as an easier type of Cryptid.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542202330794168340]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** It has been suggested that a program&#039;s Cryptid status should be determined by the complexity of its underlying behavior/problem, and whether it can be related to any mathematically hard problem.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1541528126360658011][https://discord.com/channels/960643023006490684/960643023530762341/1542199641507102731]&amp;lt;/sup&amp;gt; Shawn Ligocki remarks that the main reason why other hard machines (e.g. Skelet 1, Skelet 17) should not be considered Cryptids is due to the lack of a simple restating of their halting requirements or a connection to a mathematically hard problem.&lt;br /&gt;
** [[Piecewise Affine Function|PAFs (Piecewise Affine Functions)]] and [[Collatz-like]] behaviors were noted to have a sharp increase in difficulty between currently solvable and unsolvable examples,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542351497415622656]&amp;lt;/sup&amp;gt; though star suggests that even 2-dimensional 2-regional PAFs have examples of medium-difficulty problems, and that they are likely [[Turing-complete]].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542352467373719572]&amp;lt;/sup&amp;gt; She also notes how Collatz-like behavior seems to be common amongst the smallest holdouts across different BB-adjacent functions (e.g. Turing machines, Fractrans programs),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542354627616571453]&amp;lt;/sup&amp;gt; though there are likely some exceptions, such as the BBµ(16) chaotic function and the BB(3,3) holdout {{TM|1RB2LC1RC_2LC---2RB_2LA0LB0RA|halt}}, as pointed out by Shawn Ligocki and LegionMammal978 respectively.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542357048128184431][https://discord.com/channels/960643023006490684/960643023530762341/1542381196473016321]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On August 26, XnoobSpeakable began a discussion on archiving Discord messages which are used as sources on this wiki.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542211543876239420]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** Katelyn Doucette comments that not only does an archive provide the comfort of not losing valuable information should messages be taken down, it also provides an easier way to search through messages, contrasting Discord&#039;s suboptimal search feature.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542298368762450032]&amp;lt;/sup&amp;gt; She also provided a tool for mass archiving Discord messages without breaking its Terms of Service.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542298997509587037]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** cosmo notes that an indiscriminate public archive of the server had previously been suggested&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1249351319756607619/1251205840162258994]&amp;lt;/sup&amp;gt; and rejected&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1249351319756607619/1251208747561254933]&amp;lt;/sup&amp;gt; by members, as it would have changed how they would have interacted with others.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542219382762115142]&amp;lt;/sup&amp;gt; However, they do still keep a private, up-to-date archive of the whole server.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1542354140288647258]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:This Month in Beaver Research|2026-08]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=TMBR:_May_2026&amp;diff=10413</id>
		<title>TMBR: May 2026</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=TMBR:_May_2026&amp;diff=10413"/>
		<updated>2026-11-08T18:10:20Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Move Misc section -&amp;gt; General at top since it has a few notable topics that were being dwarfed by the giant BB Adjacent section&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{TMBRnav|April 2026|June 2026}}&lt;br /&gt;
&lt;br /&gt;
[[:Category:This Month in Beaver Research|This Month in Beaver Research]] for May 2026. There have been notable reductions in the [[BB(4,3)]] and [[BB(2,6)]] [[holdout]] counts achieved with mxdys&#039;s new inductive decider for history linear TMs. David SG began running GPU deciders on [[BB(7)]] and Andrew Ducharme solved a [[BB(2,5)]] holdout using FAR. New discoveries were made for [[SKI Calculus]] and [[General Recursive Function|General Recursive Functions]] and multiple values were found to exceed [[Graham&#039;s number]], these include: BBµ(93), Ξ₀(20), Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(12) and BBCS(64). The month ended with the complete enumeration of [[Fractran|BBf(23)]].&lt;br /&gt;
&lt;br /&gt;
== General ==&lt;br /&gt;
&lt;br /&gt;
* mxdys made [https://github.com/ccz181078/busycoq/blob/BB6/verify/Inductive_inf.v his inductive decider] for [[History linear|history-linear]] machines compilable into an executable file.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960655108578881597/1501260508051800318]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* GPU deciders: The original discussion of this starts with a [https://discord.com/channels/960643023006490684/960643023530762343/1507544052185301092 discord post], where David SG announced some work he was doing with GPU deciders. Subsequently, they shared a [https://github.com/David5768/David-BB7-GPU-Deciders Github repo], and contributed some new simulation results for BB(6) TMs. Most notably however, GPU variants of [[NGram CPS]], [[Quick_Sim]] and a [[Translated Cycler]] decider were used to decide BB(7) holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1509526456823185579]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* LegionMammal shared exploration they have made into searching for alternative &amp;quot;Axiom of Infinity&amp;quot; like statements and which ones imply which others, which could eventually be useful for creating [[Logical independence|axiomatically undecidable]] machines.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1488636445148184729]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== BB Adjacent ==&lt;br /&gt;
[[General Recursive Function|General Recursive Functions]]:&lt;br /&gt;
&lt;br /&gt;
* Some new champions were found:&lt;br /&gt;
** BBµ(16) ≥ 47, found by Shawn on 5 May: &amp;lt;code&amp;gt;M(C(R(S, R(P(2,1), R(P(3,2), C(R(S, P(3,1)), P(5,3), P(5,2))))), P(1,1), S))&amp;lt;/code&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1501347538287067267]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** BBµ(17) ≥ 2090, found by Shawn on 8 May: &amp;lt;code&amp;gt;M(C(R(P(1,1),R(P(2,1),R(R(R(S,C(S,P(3,2))),P(4,1)),P(5,2)))),P(1,1),S))&amp;lt;/code&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1502314241766588468]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** BBµ(93) ≥ [[Graham&#039;s number]], designed by racheline on 19 May using a binary encoding of weak goodstein sequences.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1506245738978480198][https://discord.com/channels/960643023006490684/1447627603698647303/1506295959049474068]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* Some new cryptids were hand-built:&lt;br /&gt;
** Size 56, by Shawn on 2 May (simulating 5x+1 problem starting at 7).&amp;lt;sup&amp;gt;[https://github.com/sligocki/etc/blob/main/gen_rec/mgrf/collatz.mgrf]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** Size 49, by aparker, star and Shawn on 3 May (simulating [[wikipedia:Brocard&#039;s_problem|Brocard&#039;s problem]]).&amp;lt;sup&amp;gt;[https://github.com/sligocki/etc/blob/main/gen_rec/mgrf/brocard.mgrf]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* The first non-trivial divergent GRF was found (size 15). It halts iff there exists some n ≥ 1 such that n+3 divides &amp;lt;math&amp;gt;Tetr(n) = \frac{n(n+1)(n+2)}{6}&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1500584497542987776]&amp;lt;/sup&amp;gt; aparker&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1500587569514283098]&amp;lt;/sup&amp;gt; and star&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1500595210919346337]&amp;lt;/sup&amp;gt; proved that there is no such n.&lt;br /&gt;
* On 5 May, Shawn implemented a size 133 GRF that non-trivially halts iff there is a counter-example to Fermat&#039;s Last Theorem: [https://github.com/sligocki/etc/blob/main/gen_rec/mgrf/fermat.mgrf fermat.mgrf].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1501235408913305663]&amp;lt;/sup&amp;gt; Note that since Fermat&#039;s Last Theorem is true, this GRF does not halt; however, this GRF is still of interest due to the sheer complexity and length of the proof of the theorem.&lt;br /&gt;
* On 6 May, Shawn found a chaotic (potentially Cryptid) size 16 GRF: &amp;lt;code&amp;gt;M(C(R(S, R(C(S, P(2,1)), C(R(P(1,1), P(3,1)), P(4,2), P(4,1)))), P(1,1), S))&amp;lt;/code&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1501444301245382707]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* All M(PRF) GRFs were decided up to size 12 with max score 5.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1508151420258484354]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* All PRFs were decided up to size 22 with max score &amp;lt;math&amp;gt;\approx 2^{2^{230}}&amp;lt;/math&amp;gt;. All except 11 were decided by direct simulation, but 11 overflowed u64 and needed to be evaluated by more clever programs.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1447627603698647303/1508151420258484354]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[SKI Calculus]]:&lt;br /&gt;
* On 7 May, Δ⁵ discovered some tetrational (size 15) and pentational (size 19) terms in the SKI calculus,&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=prev&amp;amp;oldid=7455]&amp;lt;/sup&amp;gt; and some small champions for [[SKI Calculus#SK calculus|Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(n)]] for sizes 9 to 15.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7455]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* By 7 May, an unknown person (probably tromp) translated 2014MELO03&#039;s lambda calculus champion to SKI calculus, proving the bound Ξ₀(25) &amp;gt; [[Graham&#039;s number]]&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7461]&amp;lt;/sup&amp;gt; (falsely attributed to 2014MELO03).&lt;br /&gt;
* On 15 May, Δ⁵ proved the bound Ξ₀(22) &amp;gt; [[Graham&#039;s number]].&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7521]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 19 May, Δ⁵ proved Ξ₀(6) = 17 and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(6) = 10.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7543]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 22 May, Δ⁵ discovered smaller tetrational (size 13) and pentational (size 17) terms in the SKI calculus, and 50_ft_locker proved the bound Ξ₀(20) &amp;gt; [[Graham&#039;s number]].&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7583]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 23 May, Boone discovered new Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(n) champions for sizes 7 to 12&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7600]&amp;lt;/sup&amp;gt; (and Ξ₀(n) champions for sizes 7 to 10&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7613]&amp;lt;/sup&amp;gt;), as well as a Ξ₀(11) champion 2 days later.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7614]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 25 May, Azerty introduced the Busy Beaver function for the BCKW system.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7633]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 26 May, Δ⁵ discovered some tetrational (size 7) and Ackeramnn-growth (size 11) terms in the [[SKI Calculus#BCKW system|BCKW system]], and proved the bound Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(12) &amp;gt; [[Graham&#039;s number]].&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7639]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 29 May, Δ⁵ discovered an infinite family of terms in the SKI calculus with normal form growth rate f&amp;lt;sub&amp;gt;ω⋅2&amp;lt;/sub&amp;gt;(n).&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=7700]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[CounterScript]]:&lt;br /&gt;
* On 1 May, discord user sheep discovered a BBCS(65) champion beating [[Graham&#039;s number]].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1499727568763617381]&amp;lt;/sup&amp;gt; On 3 May, sheep improved this champion [https://discord.com/channels/960643023006490684/1484108791636033659/1509179336136327310 to size 64].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1500384646922240084]&amp;lt;sup&amp;gt;&lt;br /&gt;
* On 6 May, sheep discovered a new champion for BBCS(21)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1501545706601578527]&amp;lt;/sup&amp;gt; and on 11 May a new champion for BBCS(25).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1503294458861719574]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On 13 May, sheep proved CounterScript Turing-complete via a translation from Boolfuck to Counterscript.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1504113618231492628]&amp;lt;/sup&amp;gt; 2 days later, she showed that CounterScript restricted to 3 registers was also Turing-complete.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1484108791636033659/1504770973684203581]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[Fractran]]:&lt;br /&gt;
* On 28 May, @-d began enumerating BBf(23).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1509348792330358965]&amp;lt;/sup&amp;gt; The enumeration was completed by 31 May, leaving an initial 790,335 holdouts, which where reduced to 29,250 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1510749997392724190]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
*&lt;br /&gt;
&lt;br /&gt;
== Holdouts ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+BB Holdout Reduction by Domain&lt;br /&gt;
!Domain&lt;br /&gt;
!Previous Holdout Count&lt;br /&gt;
!New Holdout Count&lt;br /&gt;
!Holdout Reduction&lt;br /&gt;
!% Reduction&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,3)]]&lt;br /&gt;
|5,641,006&lt;br /&gt;
|5,127,263&lt;br /&gt;
|513,743&lt;br /&gt;
|9.11%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,4)]]&lt;br /&gt;
|12,049,358&lt;br /&gt;
|11,362,197&lt;br /&gt;
|687,161&lt;br /&gt;
|5.70%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,5)]]&lt;br /&gt;
|66&lt;br /&gt;
|65&lt;br /&gt;
|1&lt;br /&gt;
|1.52%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,6)]]&lt;br /&gt;
|536,112&lt;br /&gt;
|413,513&lt;br /&gt;
|122,599&lt;br /&gt;
|22.87%&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
*[[BB(2,5)]]&lt;br /&gt;
**[https://discord.com/channels/960643023006490684/1259770421046411285/1510322250769760376 Andrew Ducharme found a FAR solution for a machine], which previously had an informal nonhalting argument. On June 1st, [https://discord.com/channels/960643023006490684/1259770421046411285/1510867717194911874 mxdys provided the Rocq proof], reducing the Rocq-holdout count to &#039;&#039;&#039;65&#039;&#039;&#039;.&lt;br /&gt;
*[[BB(4,3)]]&lt;br /&gt;
**Andrew Ducharme reduced the number of holdouts from 5,641,006 to &#039;&#039;&#039;5,127,263&#039;&#039;&#039;, a &#039;&#039;&#039;9.11%&#039;&#039;&#039; reduction, with mxdys&#039;s new inductive decider.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1502750172407533628]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(3,4)]]&lt;br /&gt;
**XnoobSpeakable completed Stage 2 of [[BB(3,4)#Phase 3|Phase 3]], reducing to number of holdouts from 12,049,358 to &#039;&#039;&#039;11,362,197&#039;&#039;&#039;, a &#039;&#039;&#039;5.70%&#039;&#039;&#039; reduction.&lt;br /&gt;
*[[BB(2,6)]]&lt;br /&gt;
**Andrew Ducharme reduced the number of holdouts from 536,112 to &#039;&#039;&#039;527,232&#039;&#039;&#039; via Enumerate.py and TM-enum, a &#039;&#039;&#039;1.66%&#039;&#039;&#039; reduction.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1500218448951775383][https://discord.com/channels/960643023006490684/1084047886494470185/1501436678823477368]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**Using the new inductive decider by mxdys and TM-enum, Andrew Ducharme first reduced the number of holdouts from 527,232 to &#039;&#039;&#039;501,914&#039;&#039;&#039;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1501664852953792513][https://discord.com/channels/960643023006490684/1084047886494470185/1501812428113973268]&amp;lt;/sup&amp;gt;, then to &#039;&#039;&#039;439,120&#039;&#039;&#039; again using the inductive decider.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1502436063103291492]&amp;lt;/sup&amp;gt; In total this was a &#039;&#039;&#039;16.71%&#039;&#039;&#039; reduction.&lt;br /&gt;
**Using FAR, Andrew Ducharme further reduced the number of holdouts from 439,120 to &#039;&#039;&#039;418,127&#039;&#039;&#039;, a &#039;&#039;&#039;4.78%&#039;&#039;&#039; reduction.&lt;br /&gt;
**Using some mxdys deciders, Andrew Ducharme continued reducing the number of holdouts through May 17, from 418,127 to &#039;&#039;&#039;413,513&#039;&#039;&#039; (a &#039;&#039;&#039;1.10%&#039;&#039;&#039; reduction).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1505277282648981504][https://discord.com/channels/960643023006490684/1084047886494470185/1506063539498913934][https://discord.com/channels/960643023006490684/1084047886494470185/1507614139563118694][https://discord.com/channels/960643023006490684/1084047886494470185/1508623369967370472]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(2,7)]]&lt;br /&gt;
** Terry Ligocki enumerated 130K more subtasks, increasing the number of holdouts to &#039;&#039;&#039;1,087,732,936&#039;&#039;&#039;. A total of 350K subtasks out of the 1 million subtasks (or &#039;&#039;&#039;35%&#039;&#039;&#039;) have been enumerated.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1492652604088516659]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:This Month in Beaver Research|2026-05]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=TMBR:_October_2026&amp;diff=10307</id>
		<title>TMBR: October 2026</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=TMBR:_October_2026&amp;diff=10307"/>
		<updated>2026-11-06T21:25:37Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Papers */ It was published by Dos Santos, not &amp;quot;a research entity&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{TMBRnav|September 2026|November 2026}}&#039;&#039;This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[[:Category:This Month in Beaver Research|This Month in Beaver Research]] for October 2026.&lt;br /&gt;
&lt;br /&gt;
== Papers ==&lt;br /&gt;
&lt;br /&gt;
* Marco Dos Santos and researchers at [https://deepmind.google/ Google DeepMind] published a paper on the usage of AI to derive simple arithmetic rules for small Turing machine holdouts: [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]&lt;br /&gt;
&lt;br /&gt;
== Blog Posts / In the Media ==&lt;br /&gt;
&lt;br /&gt;
* [https://nickdrozd.github.io/2026/10/20/blanking-beavers-results-and-open-problems.html Blanking Beavers: Results and Open Problems]. Nick Drozd. 20 Oct 2026.&lt;br /&gt;
* [https://www.youtube.com/watch?v=kMHCl2PGloQ The Discord Server that Solved an Open Math Problem]. polylog. 25 Oct 2026.&lt;br /&gt;
&lt;br /&gt;
== BB Adjacent ==&lt;br /&gt;
&lt;br /&gt;
* [[Register machine|Register Machine]]&lt;br /&gt;
** On October 1, sheep discovered a 12-state, 2-register [[Cryptid]] which halts iff 7 converges to 1 under the Collatz-like 5n+1 map, thus showing that MBB(12, 2) is hard.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555083694937604097]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, @-d enumerated MBB(8), which left 7,891 holdouts after reduction, or 404 holdouts if an ai-created decider is used.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555102010473193513]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, @mineralli discovered a family of champions for MBB(n,1).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555268332465422508]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 2, @mineralli discovered a new champion for MBB(10,2).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555502006372663337]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, sheep discovered 2 new tetrational champions for MBB(10).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555512334846402573][https://discord.com/channels/960643023006490684/1552294888740098139/1555546324567335048]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki released an MBB(8) holdout list consisting of 145 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555699448066342953]&amp;lt;/sup&amp;gt; using another ai-created decider similar to CTL.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555699290285019147]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 3, Shawn Ligocki released another MBB(8) holdout list consisting of 46 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555754019606106212]&amp;lt;/sup&amp;gt; later reduced to 6&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555772428997886004]&amp;lt;/sup&amp;gt; (from 7&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555759004444270633]&amp;lt;/sup&amp;gt;) holdouts.&lt;br /&gt;
** On the same day, Shawn Ligocki discovered a cryptid similar to [[Space Needle]] amongst the 6 remaining holdouts, showing MBB(8) is hard.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555767330531967099]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, sheep analyzed the rest of the holdouts, discovering 4 equivalences and another Space Needle-like cryptid (Needle 1),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555897664078618675]&amp;lt;/sup&amp;gt; meaning MBB(8) &amp;quot;probviously&amp;quot; = 3,394.&lt;br /&gt;
** On the same day, Katelyn Doucette devised a method to show that a sizeable portion of powers of two could not be reached by Needle 1&#039;s path.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1556086800861233154]&amp;lt;/sup&amp;gt; She later concluded that this backwards reasoning-like method, though powerful, would not be enough to decide Needle 1.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1556810508160606243]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 7, sheep rediscovered a 2003 [https://web.archive.org/web/20061216201733/http://www2.cantabgold.net/users/m.y.becker.98/part2projects/rickdissertation.zip dissertation] by Rick Griffiths&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1557447684896464909]&amp;lt;/sup&amp;gt; which investigated the (maximum register value) Busy Beaver function for register machines (Beaver(n)); Griffiths determines the values of Beaver(n) for sizes 1 to 4 (using the modern instruction counting convention), and provides lower bounds for sizes 5 to 8. It also provides a machine (constructed by Ortwin Gasper in 2003) which shows the bound MBB(11) &amp;gt; 10↑↑17.74.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1557623496044183603]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 8, sheep marginally improved the bounds for MBB(10).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1557714856960983131]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 10, AlephSquirrel rediscovered a 2020 [https://www.sciencedirect.com/science/article/pii/S0304397519304633 article] by Yuri Matiyasevich&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1560363138946175047]&amp;lt;/sup&amp;gt; which provides a 130-instruction, 29-register machine which halts if and only if the Riemann hypothesis is false.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1557447684896464909]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 17, mineralli published a script capable of converting any arbitrary register machine into an equivalent 2-register machine.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1560932610723676202]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 22, mineralli released a list of 581 MBB(11,2) holdouts (though they are not confident that these are all of the MBB(11,2) holdouts) that display [[Collatz-like]] behavior.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1562879542643925073]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[SKI Calculus]]&lt;br /&gt;
** On October 8, cppdecksucker shared a holdouts list for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(8) consisting of 17 terms, 2 of which have been decided to not have a normal form.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1557759102187348009]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 12, cppdecksucker claimed to have used Aristotle AI to prove Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(8) = 80.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1559185635947057216]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Δ⁵ proved Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(5) = 47.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=prev&amp;amp;oldid=9048]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 13, Δ⁵ translated a 15 combinator term in the BCKW calculus, demonstrating Ξ₀&amp;lt;sub&amp;gt;BCKW&amp;lt;/sub&amp;gt;(15) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{2 \uparrow\uparrow 18 - 1}}(2)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&amp;amp;diff=next&amp;amp;oldid=9048]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 20, elgan65536 discovered new champions for Ξ₀(9)&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1562237449848225846]&amp;lt;/sup&amp;gt; and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(11),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1562238534092464191]&amp;lt;/sup&amp;gt;, with trivial extensions that are new champions for Ξ₀(10), Ξ₀(11), and Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(12).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1562251625597509764]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 21, elgan65536 discovered a new champion for Ξ₀&amp;lt;sub&amp;gt;SK&amp;lt;/sub&amp;gt;(10).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552337976946597928/1562511629743165501]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Lambda Calculus]]&lt;br /&gt;
** On October 9, Discord user Sam discovered a new 80 bit term,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1557997291401642085]&amp;lt;/sup&amp;gt; shown by 50_ft_lock to demonstrate the bound BBλ(80) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^\omega + 1}(3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1558011994781778044]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 13, Sam optimized the BBλ(80) champion to a reduced and improved 79 bit term, demonstrating the bound BBλ(79) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^\omega + 1}(7)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1559448255803293757]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Gustavo Melo estimated that a specific family of terms, mentioned earlier by Sam,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1559075925449244794]&amp;lt;/sup&amp;gt; reaches &amp;lt;math&amp;gt;f_{\omega^\omega \cdot 2 + 1}&amp;lt;/math&amp;gt; growth.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1559648655135215627]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Sam discovered new &amp;lt;math&amp;gt;f_{\omega^\omega \cdot 2 + 1}&amp;lt;/math&amp;gt;-level champions for BBλ(70), BBλ(74), BBλ(78), and BBλ(80).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1559714680547844188]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 15, Gustavo Melo discovered new &amp;lt;math&amp;gt;f_{\omega^{\omega^\omega}}&amp;lt;/math&amp;gt;-level champions for BBλ(77),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560413331515379733]&amp;lt;/sup&amp;gt; BBλ(80),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560403657529360445]&amp;lt;/sup&amp;gt; and BBλ(85) (the next day),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560447706382602263]&amp;lt;/sup&amp;gt; and conjectured that a specific 76 bit term would have a normal form greater than &amp;lt;math&amp;gt;f_{\omega^{\omega^3}}(2)&amp;lt;/math&amp;gt; bits.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560406048337043459]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 16, Δ⁵ discovered a new 80 bit term, demonstrating the bound BBλ(80) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{\omega^{14}}}(2)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;amp;diff=prev&amp;amp;oldid=9125][https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;amp;diff=next&amp;amp;oldid=9167]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Gustavo Melo proved the conjecture about the 76 bit term&#039;s size, demonstrating the bound BBλ(76) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{\omega^3}}(2)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1355653587824283678/1560695606035357816]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 17, Δ⁵ discovered a new 77 bit term, demonstrating the bound BBλ(77) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{\omega \cdot 2}}(3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;amp;diff=next&amp;amp;oldid=9199]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 18, Δ⁵ discovered a new 82 bit term, demonstrating the bound BBλ(82) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^{\omega^\omega}}(2 \uparrow\uparrow\uparrow\uparrow 18)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;amp;diff=next&amp;amp;oldid=9214]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Beeping Busy Beaver]]&lt;br /&gt;
** On October 10, Crorem proved two bounds regarding different defintions of the Beeping Booping Busy Beaver function (BBBB(m,n)), which emulates a Turing machine equipped with a second-order oracle: BBBB&amp;lt;sub&amp;gt;first&amp;lt;/sub&amp;gt;(2,3) = 177, and BBBB&amp;lt;sub&amp;gt;last&amp;lt;/sub&amp;gt;(2,3) ≥ 265. Notably, Crorem reduced the BBBB&amp;lt;sub&amp;gt;last&amp;lt;/sub&amp;gt;(2,3) domain to 5 holdouts, one of which Crorem believes to be a Collatz-like Cryptid.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1558372326251438151]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 26, carrino claimed to have used Claude to determine the instruction-based champions for 1 to 4 states and 2 symbols, and for 2 states and 3 symbols.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1564393769984458862]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Instruction-Limited Busy Beaver|Domain-Restricted Instruction-Limited Busy Beaver]]&lt;br /&gt;
** On October 10, star claimed to have used Claude to discover a new champion for BBi(10, 6, 2) (colloquially known as BB(5.5)).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558608094949416993]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 11, star claimed to have used Claude to reduce BBi(10, 6, 2) to 4 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558654629821157499]&amp;lt;/sup&amp;gt; all of which were present in the most recent holdouts equivalence list at the time (BB6_holdouts_1581_eqv_740.txt).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558671475999772775]&amp;lt;/sup&amp;gt; She believes that two of these holdouts ({{TM|1RB1LA_1RC0RF_1RD---_0LE1RB_---0LA_1LD1RF}} and another equivalent machine) are Cryptids.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558766480424964169]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Fractran]]&lt;br /&gt;
** On October 13, @-d completed the verification of the ai-generated 1dpc decider and its certificates, reducing the official count of BBf(23) holdouts from 21,233 to 8,021, and the official count of BBf(24) holdouts from 231,432 to 85,726.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1559523323493482566]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, @-d discovered 0.1% of certificates created by the ai-generated ndpc decider to be invalid, hypothesized to have been caused by a soundness bug in the decider.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1559708872019681341]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 24, @-d discovered the size 24 energy vampire &amp;lt;code&amp;gt;[2/15, 1/6, 441/2, 11/3, 25/7, 6/11]&amp;lt;/code&amp;gt;, a Collatz-like machine that simulates an unbiased random walk. What separates this holdout from other random walks is its sheer luck; over several extremely far simulations (one to 2&amp;lt;sup&amp;gt;34&amp;lt;/sup&amp;gt; iterations,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1563511627742191627]&amp;lt;/sup&amp;gt; one to 2&amp;lt;sup&amp;gt;35&amp;lt;/sup&amp;gt; iterations,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1563991018401960128]&amp;lt;/sup&amp;gt; and one to 1.5 × 2&amp;lt;sup&amp;gt;38&amp;lt;/sup&amp;gt; iterations&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1565260814368251955]&amp;lt;/sup&amp;gt;), the machine has remained active; if this machine were to halt, it would show BBf(24) &amp;gt; 6.38 × 10&amp;lt;sup&amp;gt;175,634,090,326&amp;lt;/sup&amp;gt;.&lt;br /&gt;
** On October 26, Shawn Ligocki added BMO12 (&amp;lt;code&amp;gt;[2/15, 1/6, 441/2, 11/3, 25/7, 6/11]&amp;lt;/code&amp;gt;) to the [[Beaver Math Olympiad]].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1226543091264126976/1564372797709361262]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 30, @-d claimed the halting of BMO12 in 1.714 × 10&amp;lt;sup&amp;gt;210,914,744,116&amp;lt;/sup&amp;gt; steps (i.e. 495,141,375,730 iterations), awaiting verification.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1438019511155691521/1565647448452636672]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Pebble Automaton]]&lt;br /&gt;
** On October 13, AlephSquirrel proved peBBle(5) = 11 and peBBle(6) = 17.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1559703384943104163]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 18, AlephSquirrel proved peBBle(7) = 28.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561404687260065896]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 19, Shawn Ligocki claimed to have used Google Gemini to prove peBBle(8) = 63 using a CTL-like method,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561538647470379019]&amp;lt;/sup&amp;gt; and to find 54,394 9-pebble holdouts (including automata with multiple undefined transitions),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561539854834335764]&amp;lt;/sup&amp;gt; later reduced to 376 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561553087938953228]&amp;lt;/sup&amp;gt; then 104 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561571328253890590]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 19, a poll was held to determine whether a pebble automata that moves pebbles every step, but has no effect on any cells (i.e. it has a static tape), should be considered as halted (which is what the old halting definition decides); the general consensus is to class this behavior as non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561785819872886919]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to prove peBBle(9) = 63,577, under the old halting definition.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561852114299523185]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 20, Shawn Ligocki claimed to have used Google Gemini to find a peBBle(10) champion that runs for 5,778 steps, simultaneously finding 1,867 10-pebble holdouts (including automata with multiple undefined transitions),&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561905431960485888]&amp;lt;/sup&amp;gt; later reduced to 1,221 holdouts, though these lists were considered only under the old halting definition.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561978057764376669]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, AlephSquirrel discovered that one of the peBBle(10) holdouts used a mechanism that simulates a [[Piecewise Affine Function]],&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562101152986828830]&amp;lt;/sup&amp;gt; though none of the extraneous conditions lead to halting;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562121777054879916]&amp;lt;/sup&amp;gt; she also provided a compressed spacetime diagram of this holdout.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562208455383580773]&amp;lt;/sup&amp;gt; A similar holdout was shared earlier that day by Shawn Ligocki, but not analyzed.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1561915644536946739]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to produce peBBle(10) holdout lists with 429 holdouts&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562194616546238526]&amp;lt;/sup&amp;gt; and 319 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562230142577676439]&amp;lt;/sup&amp;gt; both updated to account for the new halting definition.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562160772551802953]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 21, AlephSquirrel analyzed the aforementioned peBBle(10) former holdout (excluding edge cases), confirming that it models a PAF.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562457437666017301]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to produce a peBBle(10) holdout list with 268 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562461150245814384]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Aleph Squirrel discovered a 12 pebble possible Cryptid, implying solving peBBle(12) would be at least as hard as solving a BMO1-like problem.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562498516729991280]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to prove peBBle(10) = 5,778.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1562579016895176798]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 28, Shawn Ligocki began enumeration of peBBle(11), finding a machine that demonstrates peBBle(11) ≥ 9,040,389.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565052555728257195]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, Shawn Ligocki completed enumeration of peBBle(11) using an enumerator and deciders written by Google Gemini, claiming to find 359,706 11-pebble holdouts (including automata with multiple undefined transitions).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565456164785881191]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki found two new champions for peBBle(11).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565462948103847957]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 30, Shawn Ligocki found a peBBle(11) champion that runs for 810,626,821 steps.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565541995852865558]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Shawn Ligocki claimed to have used Google Gemini to produce peBBle(11) holdout lists with 160,367 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565580890082643968]&amp;lt;/sup&amp;gt; 960 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565594328217165984]&amp;lt;/sup&amp;gt; 580 holdouts,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565754647644344401]&amp;lt;/sup&amp;gt; and 229 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565846253072285786]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 31, Shawn Ligocki claimed to have used Google Gemini to produce peBBle(11) holdout lists with 133 holdouts&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565890967935127663]&amp;lt;/sup&amp;gt; and 22 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1565911083087167654]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, sheep reduced this claimed holdout list to 10 holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1535695107448381591/1566004742080045099]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [https://discord.com/channels/960643023006490684/1476612651109843024 Busy Bricklayer Problem]&lt;br /&gt;
** On October 20, mathmasterzach, along with their friends, showed that the problem&#039;s associated busy beaver function, over the 10-ominos, either takes the value 138, or is larger than 3,000.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1561917906051407909]&amp;lt;/sup&amp;gt; Note that there is still one undecided 10-omino.&lt;br /&gt;
** On October 21, mathmasterzach, using the singular 10-omino holdout, produced a tiling of an 88-cell wide half-strip.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1562458368763891855]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 24, Drakou111 set up a distributed computation project that aims to determine which rectangles the 10-omino holdout can be shown to (not) tile. The project increased the minimum tiles required to 3,200.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1563594621030768731]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 25, the bound for the smallest number of the holdout 10-omino tiles (now named fe70&amp;lt;sup&amp;gt;[https://fe70.org/]&amp;lt;/sup&amp;gt;) required to tile a rectangle had increased to 3,264.&amp;lt;sup&amp;gt;[https://fe70.org/api/results]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 26, mathmasterzach completed an ennumeration of larger domains, finding lower bounds on the largest smallest rectangle a polyomino can tile for 11-ominos, 12-ominos, and 13-ominos, finding order 270, order 180, and order 2 tiles for each domain respectively, and finding 3, 16, and 0 holdout tiles for each domain respectively.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1564111342346960958]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, mathmasterzach announced that the minimum width of a hypothetical rectangle that the 10-omino holdout can tile had been shown to be at least 165, and that half-strip tilings were known to be constructible for widths of the form 168 + 8n.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1476612651109843024/1565474623254954015]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Instruction-Limited Busy Beaver]]&lt;br /&gt;
** On October 24, nickdrozd claimed to have used ChatGPT to claim two of the final nine informal BBi(8) holdouts halting.&lt;br /&gt;
** On the same day, prurq confirmed one of nickdrozd&#039;s claims,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1563639486670311576]&amp;lt;/sup&amp;gt; and claimed to use Aristotle to confirm the other of nickdrozd&#039;s claims.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1563647923013558374]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, hipparcos confirmed the other of nickdrozd&#039;s claims.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565202912903438408]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Semi Infinite Tape Turing Machine]]&lt;br /&gt;
** On October 25, [[User:Loader3229]] created an alternative model for Turing machines on a semi infinite tape, where a Turing machine that attempts to move leftwards off the tape remains stationary, giving rise to the function BB&amp;lt;sub&amp;gt;SI&amp;lt;/sub&amp;gt;(m,n), which they provided small champions for.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Semi_Infinite_Tape_Turing_Machine&amp;amp;oldid=9562]&amp;lt;/sup&amp;gt; Notably, one state machines do not act as trivially in this model, and that BB&amp;lt;sub&amp;gt;SI&amp;lt;/sub&amp;gt;(1,n) is at least quadratic in growth.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1450894930422530161/1563965787998392406]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Champions ==&lt;br /&gt;
{| class=&amp;quot;wikitable mw-collapsible mw-collapsed&amp;quot;&lt;br /&gt;
|+New&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;champions&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;discovered&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;this&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;month&lt;br /&gt;
|-&lt;br /&gt;
!Domain&lt;br /&gt;
!Champion&lt;br /&gt;
!Discoverer&lt;br /&gt;
!New lower bound&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Previous lower bound&lt;br /&gt;
|-&lt;br /&gt;
|BB(7)&lt;br /&gt;
|{{TM|1RB0RG_1RC1RB_0RD1RZ_0LE0LD_0LF1LE_1RA1LF_1LC0RB|halt}}&lt;br /&gt;
| rowspan=&amp;quot;8&amp;quot; |Jeff Ketchersid&lt;br /&gt;
|&amp;lt;math&amp;gt;3 \uparrow^{20} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Pavel&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;Kropitz&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;2 \uparrow^{11} 2 \uparrow^{11} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(8)&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LH0LC_1RG1LD_0RG0RF_1RG---|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^3(12)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(9)&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LH0LC_1RG1LD_0RG0RF_0LI---_1LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^6(12)&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}(f_{9}(2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(10)&lt;br /&gt;
|{{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LI0LC_0RG1LD_1RH1LG_1LC0RG_0LJ0LI_1RZ0LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(2 \uparrow^{36} 3) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|racheline&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^2(25)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(11)&lt;br /&gt;
|{{TM|1RG0LH_1RK1RC_0LD1LA_0RE1LD_0LI1RF_1RZ0RG_1RB1RG_1LA1LH_0LK0LJ_1LH1LI_1LJ1RE|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(f_\omega^2(5))&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^2(10 \uparrow^4 4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(12)&lt;br /&gt;
|{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RG0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_1RZ0LL_0LH1LK|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}(f_{\omega + 1}^2(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|racheline&lt;br /&gt;
|&amp;lt;math&amp;gt;f_\omega^4(2 \uparrow\uparrow\uparrow 4-3) &amp;gt; f_\omega^4(f_4(2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(13)&lt;br /&gt;
|{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RM0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_0LL0LL_0LH1LK_1RZ0LH|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}^6(f_{\omega + 1}(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|50_ft_lock&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(2046) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(14)&lt;br /&gt;
|{{TM|1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RM0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_0LN0LL_0LH1LK_1RZ0LH_0RJ0LI|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}^9(f_{\omega + 1}(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(f_\omega^4(f_7(3)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(29)&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |[https://discord.com/channels/960643023006490684/1331570843829932063/1564527050512142427 too long, see source]&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |mxdys&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega^\omega}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |racheline&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |&amp;lt;math&amp;gt;f_{\omega^2}^2(4 \uparrow\uparrow 341)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(31)&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega \uparrow\uparrow 4}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(33)&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega \uparrow\uparrow 6}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,4)&lt;br /&gt;
|{{TM|0LB3LB1RZ2RA_1LD3RB1LC2RA_3RB1LB3LC2RC_0RD2RC2LB0RA|halt}}&lt;br /&gt;
|[[User:Loader3229]]&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{509} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,4)&lt;br /&gt;
|{{TM|1LF2RA3RB---_3RD2LB3RB1LC_2RA1LB3RC2LC_1LD2RE0LA1LD_1RZ0LE1LF---_2RA---2LF2LF|halt}}&lt;br /&gt;
|Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(10 \uparrow\uparrow 65533) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |Jacobzheng&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^2(10 \uparrow\uparrow\uparrow6)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,4)&lt;br /&gt;
|{{TM|1RC3LB2RD2RA_1RF3RB1LC2RA_3RB1LB3LC2RC_0RF2LD1LD2LE_3RE3LB2RE2LE_0LG0LH1RZ3RB_1LG2RD1LG3RG_0LH0LC0LH3RD|halt}}&lt;br /&gt;
| rowspan=&amp;quot;7&amp;quot; |[[User:Loader3229]]&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}(f_\omega^4(12))&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;f_{\omega + 1}(f_{\omega}(f_7(2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(9,4)&lt;br /&gt;
|{{TM|2LI3LB2RD2RA_2LC3RB1LC2RA_3RB1LB3LC2RC_0RF2LD1LD2LE_3RE3LB2RE2LE_0LG0LH1RZ---_1LG2RD1LG3RG_0LH---0LH3RD_2LB---1LI3RF|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}(16)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,5)&lt;br /&gt;
|{{TM|1RB3LB4LC2RA4LB_2LC3RB1LC2RA4RD_3RB1LB3LC2RC4LC_2RC2RD1RZ4RB1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(27,041) &amp;gt; g_{64}&amp;lt;/math&amp;gt;&lt;br /&gt;
|racheline&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}(2 \uparrow^{15} 5)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(5,5)&lt;br /&gt;
|{{TM|1LB3LB4LC2RA4LB_3LE3RB1LC2RA4RD_3RB1LB3LC2RC4LC_1RZ------4LD4LE_3RB------4LE3LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(f_{\omega}^4(6))&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,5)&lt;br /&gt;
|{{TM|0LB3LB4LC2RA4LB_1LF3RB1LC2RA4RD_3RB1LB3LC2RC4LC_1RZ------4LD4LE_3RB------4LE3LC_4RF3RE---0RA3LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}(11)&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |Jacobzheng&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;f_{\omega}^2(10 \uparrow\uparrow\uparrow6)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,5)&lt;br /&gt;
|{{TM|2LE3LB4LC2RA4LB_4RA3RB1LC2RA4RD_3RB1LB3LC2RC4LC_---3LF1LG4LD4LE_3RB---1LE4LE3LC_4LC------3LF3LF_3LF------1LG1LG|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}^2(10)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,5)&lt;br /&gt;
|{{TM|0LB3LB1RZ2RA4RB_0LD1RB1LD2RA1LE_3RB1LB3LC2RC3LF_3RE2LF3LC2RC4LF_0LF3RE0LG4LH2LB_0LE3LG4LC2RF4LG_1LC3RG1LH2RF2RA_3RG1LG3LH2RH4LH|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega \cdot 2}(32)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(f_{\omega}(f_7(2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(2,7)&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA_2LA6RA4RB1RZ3LB6LA4RB|halt}}&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |roromachine14&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 4&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |Pavel Kropitz&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |&amp;lt;math&amp;gt;10 \uparrow\uparrow 10 \uparrow\uparrow 10^{10^{115}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(2,8)&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA1RZ_2LA6RA4RB7RA3LB6LA4RB4RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(2,9)&lt;br /&gt;
|{{TM|1RB3RB4LA1LB5LA6LB5RA8RA1RZ_2LA6RA4RB7RA3LB6LA4RB4RA4RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 6&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
* Jeff Ketchersid claimed to have used Claude Opus 5.5 and Gemini 4 Argon to discover and prove the scores of a set of Ackermann-level machines, three of which ([[BB(8)]], BB(9), BB(10)) were derived from Pavel Kropitz&#039;s former [[BB(7)]] champion, and three of which (BB(12), BB(13), BB(14)) were derived from Jacobzheng&#039;s former champion for BB(14). Ketchersid also claimed to have found a new, novel champion for BB(7). Ketchersid&#039;s previous claimed bounds are listed here:&lt;br /&gt;
** On October 4, BB(8) &amp;gt; &amp;lt;math&amp;gt;2 \uparrow^{37} 3&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1448375857046360094/1556422395776995408][https://github.com/jeff87654/busy-beaver/commit/d8d00340fc3435684c0baf506f5c1d84b6f7f4a8]&amp;lt;/sup&amp;gt; Prior to this, the BB(7) champion, found by Pavel Kropitz, which held the BB(8) championship by default, ran for around &amp;lt;math&amp;gt;2 \uparrow^{11} 2 \uparrow^{11} 3&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
** On October 7, BB(9) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}(2 \uparrow^{13} 3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1557495370014130300][https://github.com/jeff87654/busy-beaver/commit/0b61aa598ce99ee04eaa88dec7f113d3d60340db]&amp;lt;/sup&amp;gt; Prior to October, the BB(9) champion, found by Jacobzheng, ran for around&amp;lt;math&amp;gt;f_{\omega}(f_{9}(2))&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
** On October 8, BB(10) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(2 \uparrow^{36} 3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1557806386073702622][https://github.com/jeff87654/busy-beaver/commit/772402455254c6afe9ba8fad50e074b14ec7a755]&amp;lt;/sup&amp;gt; Prior to October, the BB(10) champion, found by racheline, ran for around &amp;lt;math&amp;gt;f_{\omega}^2(25)&amp;lt;/math&amp;gt; steps; this machine also dethroned the previous BB(11) champion, which was found by Jaconzheng, and ran around &amp;lt;math&amp;gt;f_{\omega}^2(10 \uparrow^4 4)&amp;lt;/math&amp;gt; steps. for This is also the smallest 2-symbol machine (in states) known to run for longer than a [[Graham&#039;s number]] number number of steps; in other words, this machine shows that BB(10) &amp;gt; g&amp;lt;sub&amp;gt;64&amp;lt;/sub&amp;gt;, improving on 50_ft_lock&#039;s earlier result that BB(13) &amp;gt; g&amp;lt;sub&amp;gt;64&amp;lt;/sub&amp;gt;.&lt;br /&gt;
** On October 11, BB(12) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}^2(2 \uparrow^{36} 3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/ca5f0882319c02b86055a93ecbec1d150244a9c6]&amp;lt;/sup&amp;gt; Prior to October, the BB(12) champion, found by racheline, ran for around &amp;lt;math&amp;gt;f_{\omega}^4(2 \uparrow\uparrow\uparrow 4 - 3)&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
** On October 14, BB(13) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(f_{\omega}(20))&amp;lt;/math&amp;gt; and BB(14) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}^3(15)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1559991272456986684][https://github.com/jeff87654/busy-beaver/commit/502667dd6eb65ca014957b30487af3dc94192411]&amp;lt;/sup&amp;gt; Prior to October, the BB(13) champion, found by 50_ft_lock, ran for around &amp;lt;math&amp;gt;f_{\omega + 1}(2046)&amp;lt;/math&amp;gt; steps, and was previously the 2-symbol machine with the least amount of states used that was known to run longer than g&amp;lt;sub&amp;gt;64&amp;lt;/sub&amp;gt; steps, whereas the BB(14) champion, found by Jacobzheng, ran for around &amp;lt;math&amp;gt;f_{\omega + 1}(f_\omega^4(f_7(3)))&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
** On October 17, BB(9) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}(f_{\omega}(465,009))&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/9ed1e7a0e7437244942ed4545f199774c5c8a117]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 18, BB(9) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}^3(12)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/be5ae9e6b4ea975fe0eebf01b75a114d7bbf3889]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 19, BB(8) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}^3(12)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/be7b08caf8b6bc30a32c0c6274c1ce7f14f5c2d3]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 22, a new bound for BB(9) slightly larger than that for BB(8) at the time.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/52aab0ec4fbf1c93c177255a50eefb9e1e5dcc18]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 22, BB(9) &amp;gt; &amp;lt;math&amp;gt;f_{\omega}^6(12)&amp;lt;/math&amp;gt;, with their new BB(8) champion from October 19 also being announced along with this champion on this day.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1562971399029526539][https://github.com/jeff87654/busy-beaver/commit/3750b1490e0e7b01e6301450e1b1774afb2658c5][https://github.com/jeff87654/busy-beaver/commit/e107e3b1ac28da6dae224181ae71fe1627348bd9]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 23, Jeff Ketchersid claimed to have used Gemini 4 Argon and Claude Opus 5.5 to search through the over fifteen million BB(7) holdouts, resulting in the finding of a &#039;&#039;&#039;new BB(7) champion&#039;&#039;&#039;, {{TM|1RB0RG_1RC1RB_0RD---_0LE0LD_0LF1LE_1RA1LF_1LC0RB|halt}}, which runs for over &amp;lt;math&amp;gt;3 \uparrow^{20} 3&amp;lt;/math&amp;gt; steps, leaving a similarly notated number of ones on the tape.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1563048075184836699][https://github.com/jeff87654/busy-beaver/commit/9d9a1a4fcaa5dbabc19e887e0fd834cb79567081]&amp;lt;/sup&amp;gt; This dethrones the previous champion, {{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF|halt}}, found by Pavel Kropitz in May 2025,&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=BB(7)&amp;amp;oldid=9434#cite_note-10]&amp;lt;/sup&amp;gt; which runs for around &amp;lt;math&amp;gt;2 \uparrow^{11} 2 \uparrow^{11} 3&amp;lt;/math&amp;gt; steps. Both of these champions begin by setting a pattern that repeats dozens of times, which is iterated upon by using an Ackermann-level mechanism to reach similarly impressive heights. Notably, this new champion has a twin machine, {{TM|1RB0RG_1RC1RB_0RD1RZ_0LE0LD_0LF1LE_1RA1LF_0LD0RB|halt}}, which differs in only one transition, and uses the same mechanism to output the same number of ones, but runs for slightly shorter than than the champion.&lt;br /&gt;
** On October 26, BB(12) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(f_{\omega + 1}^2(3))&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564399479707406348]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, BB(11) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(f_\omega^2(5))&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/27d8d20284b2a6c57f7389a7b3d8c587275b8b5a]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 28, BB(13) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}^6(f_{\omega + 1}(3))&amp;lt;/math&amp;gt; and BB(14) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}^9(f_{\omega + 1}(3))&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565084294110515250]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* roromachine14 claimed to have used Gemini 4 Argon to discover a new champion for BB(2,7) on October 22, and new champions for BB(2,8), and BB(2,9) on October 23, running for at least &amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 4&amp;lt;/math&amp;gt; steps, &amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 5&amp;lt;/math&amp;gt; steps, and &amp;lt;math&amp;gt;10 \uparrow\uparrow\uparrow 6&amp;lt;/math&amp;gt; steps respectively.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1563058883654590494][https://discord.com/channels/960643023006490684/1084047886494470185/1563070360956698804]&amp;lt;/sup&amp;gt; The previous champion for these domains was, by default, Pavel Kropitz&#039;s BB(2,6) champion, which ran for around &amp;lt;math&amp;gt;10 \uparrow\uparrow 10 \uparrow\uparrow 10^{10^{115}}&amp;lt;/math&amp;gt; steps.&lt;br /&gt;
* mxdys claimed to have used AI to discover three near-ε&amp;lt;sub&amp;gt;0&amp;lt;/sub&amp;gt;-level champions, demonstrating BB(29) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^\omega}(3)&amp;lt;/math&amp;gt;, BB(31) &amp;gt; &amp;lt;math&amp;gt;f_{\omega \uparrow\uparrow 4}(3)&amp;lt;/math&amp;gt;, and BB(33) &amp;gt; &amp;lt;math&amp;gt;f_{\omega \uparrow\uparrow 6}(3)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1564527050512142427]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[User:Loader3229]] discovered an array of champions based on Kropitz&#039;s current [[BB(3,4)]] champion, demonstrating the following bounds:&lt;br /&gt;
** On October 27, BB(3,n + 4) &amp;gt; &amp;lt;math&amp;gt;f_\omega^{n + 1}(15)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564608571734495313]&amp;lt;/sup&amp;gt; and BB(4,4) &amp;gt; &amp;lt;math&amp;gt;2 \uparrow^{195} 3&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564638159944294442]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 28, BB(4,4) &amp;gt; &amp;lt;math&amp;gt;2 \uparrow^{509} 3&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;,[https://discord.com/channels/960643023006490684/1084047886494470185/1564816765031288876]&amp;lt;/sup&amp;gt; BB(4,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(27,041) &amp;gt; g_{64}&amp;lt;/math&amp;gt;,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564866772941672489]&amp;lt;/sup&amp;gt; and BB(6,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(97) &amp;gt; g_{64}&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565043340984979488]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, BB(8,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(83)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565368627304210483]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 30, BB(8,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(f_\omega^4(12))&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565534357181960424]&amp;lt;/sup&amp;gt; and BB(9,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 3}(16)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1565660171684941895]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 31, BB(5,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(f_{\omega}^4(6)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566039528819400716]&amp;lt;/sup&amp;gt;, BB(6,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 3}(11)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566103427316977789]&amp;lt;/sup&amp;gt; (preceeded by &amp;lt;math&amp;gt;f_{\omega + 2}(126)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566047238252400641]&amp;lt;/sup&amp;gt;  and &amp;lt;math&amp;gt;f_{\omega + 2}(176)&amp;lt;/math&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566092396062711870]&amp;lt;/sup&amp;gt;), BB(7,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 3}^2(10)&amp;lt;/math&amp;gt;,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566111131926274121]&amp;lt;/sup&amp;gt; and BB(8,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega \cdot 2}(32)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566113702468390923]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* Jacobzheng discovered a 6-state, 4-symbol Turing machine that demonstrates the bound BB(6,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(10 \uparrow\uparrow 65533)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=Champions&amp;amp;diff=prev&amp;amp;oldid=9777]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Holdouts ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&#039;&#039;&#039;BB Holdout Reduction by Domain&#039;&#039;&#039;&lt;br /&gt;
!Domain&lt;br /&gt;
!New Holdout Count&lt;br /&gt;
!Previous Holdout Count&lt;br /&gt;
!Holdout Reduction&lt;br /&gt;
!% Reduction&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|608&lt;br /&gt;
|797&lt;br /&gt;
|189&lt;br /&gt;
|23.71%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(7)]]&lt;br /&gt;
|12,663,440*&lt;br /&gt;
|15,743,264&lt;br /&gt;
|3,079,824&lt;br /&gt;
|19.56%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,3)]]&lt;br /&gt;
|4,673,384&lt;br /&gt;
|4,720,332&lt;br /&gt;
|46,948&lt;br /&gt;
|0.99%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,5)]]&lt;br /&gt;
|37&lt;br /&gt;
|39&lt;br /&gt;
|2&lt;br /&gt;
|5.13%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,6)]]&lt;br /&gt;
|389,503&lt;br /&gt;
|412,086&lt;br /&gt;
|22,583&lt;br /&gt;
|4.47%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,7)]]&lt;br /&gt;
|3,125,433,611&lt;br /&gt;
|&#039;&#039;Enumeration incomplete&#039;&#039;&lt;br /&gt;
|&#039;&#039;N/A&#039;&#039;&lt;br /&gt;
|&#039;&#039;N/A&#039;&#039;&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;nowiki&amp;gt;*&amp;lt;/nowiki&amp;gt;list may be incomplete, see Holdouts &amp;gt; BB(7).&lt;br /&gt;
* [[BB(6)]]&lt;br /&gt;
** On October 1, Discord user oscar claimed to have used GPT-6.1 Sol to prove a machine non-halting, [https://github.com/oscar172772/bb6-1RB1RF_1LC0LF_---0LD_0LE1LD_0RF0LB_1RA1RE-nonhalt-proof formalized] in Rocq the next day.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1555183165977403453/1555641766391324813]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 1, dyuan shared a subset of [[BB(6)]] holdouts, consisting of 24 machines which are expected to be easily analyzable by [[Longitudinal Analysis|longitudinal analysis]].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1555244959840337973]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 3, oscar claimed to have used GPT-6.1 Sol to prove a machine halting,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1555992557148831755]&amp;lt;/sup&amp;gt; formalized in Rocq the next day.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1556006145649545247/1556258332048887889]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 6, Discord user Zuck claimed to have used Claude to prove a machine non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1557025952217833632]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 7, mxdys released a holdout list of &#039;&#039;&#039;778&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1557353710101995550]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 10, Discord user Dennis claimed to have used Claude Opus 5.5 to [https://github.com/DennisKoshta/busycoq/blob/59de13796aa9dbccedd52bc5d081e87980dd2f7e/verify/BellEatsCounter_1RB0RF.v prove] a machine non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558558131213041755]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, mxdys released a holdout list of &#039;&#039;&#039;740&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558585686288891986]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 11, Dennis claimed to have used Claude Opus 5.5 to [https://github.com/ccz181078/busycoq/pull/16 prove] another 4 machines non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1558644008199262220]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 13, Dennis claimed to have used Claude Opus 5.5 to [https://github.com/ccz181078/busycoq/pull/17 prove] another 3 machines non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1559650670632632360]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Dennis claimed to have used Claude Opus 5.5 to [https://github.com/ccz181078/busycoq/pull/18 prove] a machine halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1559661025270435870/1559661025270435870]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 15, mxdys released a holdout list of &#039;&#039;&#039;698&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560185889290985532]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/ccz181078/busycoq/pull/19 prove] 7 machines halting, and another 20 machines (pull requests [https://github.com/ccz181078/busycoq/pull/20 #1], [https://github.com/ccz181078/busycoq/pull/21 #2], [https://github.com/ccz181078/busycoq/pull/22 #3], [https://github.com/ccz181078/busycoq/pull/23 #4]) non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560409510156435476]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Dennis claimed to have used Claude Opus 5.5 and GPT-6 Astra to prove another 8 machines (pull requests [https://github.com/ccz181078/busycoq/pull/24 #1], [https://github.com/ccz181078/busycoq/pull/25 #2], [https://github.com/ccz181078/busycoq/pull/26 #3], [https://github.com/ccz181078/busycoq/pull/27 #4], [https://github.com/ccz181078/busycoq/pull/28 #5]) non-halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560430940168265729]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 16, mxdys released a holdout list of &#039;&#039;&#039;663&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560559556164063242]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 21, Re-us simulated a machine to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1562505095365787862]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 24, mxdys released a holdout list of &#039;&#039;&#039;623&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1563505561905926175]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, stratus1221 simulated two machines to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1563597080176500877]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 25, mxdys confirmed another three machines halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1563868945218408490]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, stratus1221 simulated another two machines to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1563927722445508618]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 27, stratus1221 simulated another machine to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1564592221603495937]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 29, enan456 claimed to have used Claude Fable 5.1&amp;lt;sup&amp;gt;[https://github.com/Enan456/bbchallenge-proofs/commit/72965887b21cfc0310a90c93ec36b09d8b3ee8f6]&amp;lt;/sup&amp;gt; to [https://github.com/Enan456/bbchallenge-proofs reproduce] 4 of Google DeepMind&#039;s potential cryptids forward behavior and to confirm the rules established. None of them have been decided&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1565230636741169234][https://github.com/Enan456/bbchallenge-proofs/blob/main/docs/results/2026-10-22-gdm-cross-verification.md]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 30, Ahmer Reza simulated four holdouts, all Reus Vampires, to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1565557844869382316]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, mxdys released a holdout list of &#039;&#039;&#039;608&#039;&#039;&#039; machines up to equivalence.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1565584609176195113]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Ahmer Reza simulated another holdout, a Reus Vampire, to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1565656577178992651]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(7)]]&lt;br /&gt;
** On October 23, Jeff Ketchersid claimed to have used Gemini 4 Argon and Claude Opus 5.5 to find a new BB(7) champion; more details are available in the Champions section.&lt;br /&gt;
** Finlay reduced the numbers of holdouts from &#039;&#039;&#039;15,743,264&#039;&#039;&#039; to &#039;&#039;12,663,440&#039;&#039;, a 19.56% reduction,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1564656989999472782]&amp;lt;/sup&amp;gt; though a handful of machines are reportedly missing from the final files.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1369339127652159509/1563950872000467005]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(4,3)]]&lt;br /&gt;
** Andrew Ducharme reduced the number of holdouts from &#039;&#039;&#039;4,720,332&#039;&#039;&#039; to &#039;&#039;&#039;4,673,384&#039;&#039;&#039;, a &#039;&#039;&#039;0.99%&#039;&#039;&#039; reduction, by using enumerate.py&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=BB(4,3)&amp;amp;diff=prev&amp;amp;oldid=9263]&amp;lt;/sup&amp;gt; and Meet-in-the-Middle CTL.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1564216669256294481]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,5)]]&lt;br /&gt;
** On October 2, prurq claimed to have used Aristotle AI, to prove one of the remaining holdouts halting, reducing the unofficial count to &#039;&#039;&#039;38&#039;&#039;&#039; out of initially 60 Rocq-proven.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1555690509245087827]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 9, prurq simulated a machine to halting using a Rocq-certified program, reducing the official and unofficial counts to respectively &#039;&#039;&#039;59&#039;&#039;&#039; and &#039;&#039;&#039;37&#039;&#039;&#039;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1558226290509742082]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On the same day, Andrew Ducharme released an unofficial holdout list of &#039;&#039;&#039;37&#039;&#039;&#039; machines.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1558248567800336394]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 17, LegionMammal978 simulated {{TM|1RB---3RA2LA2RB_2LB3LA4LB4RA0RA|halt}} to over 10&amp;lt;sup&amp;gt;1,140,000,000&amp;lt;/sup&amp;gt; steps,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1561033327190872226]&amp;lt;/sup&amp;gt; previously claiming the machine to be a doubly-exponential probviously halting &amp;quot;hard-drive vampire&amp;quot;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1559400536690794496][https://discord.com/channels/960643023006490684/1259770421046411285/1559690798490980384]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,6)]]&lt;br /&gt;
** Andrew Ducharme reduced the number of holdouts from &#039;&#039;&#039;412,086&#039;&#039;&#039; to &#039;&#039;&#039;389,503&#039;&#039;&#039;, a &#039;&#039;&#039;5.48%&#039;&#039;&#039; reduction.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1561092563581145182][https://discord.com/channels/960643023006490684/1084047886494470185/1561506925126877265][https://discord.com/channels/960643023006490684/1084047886494470185/1562784657907650581]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,7)]]&lt;br /&gt;
** Terry Ligocki enumerated 20K more subtasks, increasing the number of holdouts to &#039;&#039;&#039;3,125,433,611&#039;&#039;&#039;. All 1 million subtasks have been enumerated! This enumeration took from November 2025 to October 2026 using the resources [Ligocki] had available to work on this enumeration. Now we can start decreasing the number of holdouts!&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
All Turing machines mentioned in this section work with an alphabet of 2 symbols unless explicitly stated. The state bounds given also only consider Turing machines which work with 2 symbols.&lt;br /&gt;
&lt;br /&gt;
* [[Cryptids#Cryptids at the Edge|Cryptids in the Wild]] (+ [[User:RobinCodes/Machines at the Edge|Energy Vampires]])&lt;br /&gt;
** On October 15, Google DeepMind claimed to have used Gemini 3.1 Pro to discover and [https://github.com/google-deepmind/cryptids/commit/ac5eff7b899f1920cea206363fa05a856005e130 prove] simple rules that characterise the behavior of 11 BB(6) holdouts, noting them as potential Cryptids.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1560334894704492594]&amp;lt;/sup&amp;gt; Their methods are elaborated on in their [https://arxiv.org/abs/2610.22603 paper], published this month.&lt;br /&gt;
** [https://discord.com/channels/960643023006490684/1561037362581086228 Reus Vampires]&lt;br /&gt;
*** On October 15, Re-us claimed to have used Claude Opus 5.5 to discover 7 probviously halting BB(6) holdouts which rely on an exceedingly rare tape configuration to halt, similar to the mechanism used by {{TM|1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA|halt}}.&amp;lt;sup&amp;gt;[https://github.com/thomasreus-bb/bb6-vampire-family-1RB0LA_0RC0RB_1LD1LA_1LC1RE_1RF0RD_1LC---][https://discord.com/channels/960643023006490684/1239205785913790465/1560688456382939268]&amp;lt;/sup&amp;gt; Re-us has also estimated that, assuming perfect randomness of the machines&#039; bit generation, a median of 780 billion iterations would have to be applied for each machine to halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1562001104701759511][https://github.com/thomasreus-bb/bb6-vampire-family-1RB0LA_0RC0RB_1LD1LA_1LC1RE_1RF0RD_1LC---/commit/a523942bf34d6ad793727d3197d81f45f81f78a0]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 19, Re-us ran path O1 to 1.08 × 10&amp;lt;sup&amp;gt;10&amp;lt;/sup&amp;gt; iterations; the path, and therefore the machines associated with the path, have not yet halted.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1561737008143933491]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On the same day, Andrew Ducharme ran path O2 to 3.5 × 10&amp;lt;sup&amp;gt;9&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1561757313851990100]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On the same day, Re-us ran path O2 to 8 × 10&amp;lt;sup&amp;gt;9&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1561767318495694918]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On the same day, Ersen ran path O2 to 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1561787161726947358]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 21, Andrew Ducharme ran path O3 to 10&amp;lt;sup&amp;gt;10&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1562019033405063229]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 22, Re-us ran path O2 to 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt, confirming Ersen&#039;s previous simulation.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1562732252511731796]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 22, Ersen ran path O1 to 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1562918309697949796]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 23, Andrew Ducharme ran path O4 to 2 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1563298186301542441]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 25, Re-us ran path O2 to 3 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1563930665114800130]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 26, Re-us ran path O2 to 3.6 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1564302884554801224]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 27, Ahmer Raza ran path O3 to 4.4 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1564602113638531233]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 28, Ahmer Raza ran path O3 to 10&amp;lt;sup&amp;gt;12&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1564860941114544150]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 29, Re-us ran path O2 to 5 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1565282039547039851]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** On October 30, Ahmer Raza ran path O1 and O2 to 747,242,483,684 and 731,899,010,932 iterations respectively, at which point they both halt!&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1565539982368706660]&amp;lt;/sup&amp;gt; These paths correspond to groups of machines with halting times of over 10&amp;lt;sup&amp;gt;263,165,730,000&amp;lt;/sup&amp;gt; and 10&amp;lt;sup&amp;gt;257,762,030,000&amp;lt;/sup&amp;gt; steps respectively.&lt;br /&gt;
*** On the same day, Ahmer Raza ran path O3 to 1,961,935,897,288 iterations, at which point it also halts!&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1565654168708841534]&amp;lt;/sup&amp;gt; This path corresponds to a group of machines with halting times of over 10&amp;lt;sup&amp;gt;690,959,520,000&amp;lt;/sup&amp;gt; steps. They also ran path O4 to 7.6 × 10&amp;lt;sup&amp;gt;11&amp;lt;/sup&amp;gt; iterations, and later 10&amp;lt;sup&amp;gt;12&amp;lt;/sup&amp;gt; iterations&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1565743330376159394]&amp;lt;/sup&amp;gt; without a halt.&lt;br /&gt;
*** On October 31, Ahmer Raza ran path O4 to 1.7 × 10&amp;lt;sup&amp;gt;12&amp;lt;/sup&amp;gt; iterations without a halt.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1566161389993599129]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On October 18, Ersen claimed to have used Claude to help run an independent (and currently ongoing) run of [[Antihydra]] to 2&amp;lt;sup&amp;gt;38&amp;lt;/sup&amp;gt; rule applications, seemingly verifying apgoucher&#039;s results.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1561480238586658867][https://discord.com/channels/960643023006490684/1026577255754903572/1271528180246773883]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[File:ZFC_Machine_254.png|alt=The transition table of a 254-state, 2-symbol Turing machine. The starting state, in the top left corner, has the rule 1LB0LC, and the halt transition occurs if the 78th state encounters a 1.|thumb|This month, Mira, using GPT-6 Astra, has claimed to have found this 254-state Turing machine that halts if, and only if, ZFC is inconsistent (Jeff Ketchersid has claimed to have proven this property using Claude Opus 5.5). The transition table of Mira&#039;s machine is shown in this image, with state 1 corresponding to the starting state.]]&lt;br /&gt;
* [[Cryptids#Larger Cryptids|Larger Cryptids]]&lt;br /&gt;
** [[Logical independence|Logical Independence]]&lt;br /&gt;
*** [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo-Frankel set theory]]&lt;br /&gt;
**** On October 6, Mira claimed to have used GPT-6 Astra to reduce their previous 256-state TM whose halting status is independent of ZFC, to a 254-state TM.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1557078543278678136]&amp;lt;/sup&amp;gt; They estimate that the Metamath formalization verifying that their previous 238-state TM is independent of Peano Arithmetic is roughly 70% complete, and the formalization verifying that their new 254-state ZFC-independent TM is roughly 40% complete.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1557065280004300913]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 10, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/7ba85376a9349d54e3460b46ed776df6e094c7dc/Cryptids/Zf393.lean formalize] the claims of the independence of Wade&#039;s 393-state TM&#039;s halting status from ZFC.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/7ba85376a9349d54e3460b46ed776df6e094c7dc#diff-b0e5d5e6cf367c2f1ba87f511ad05a12cee37dc578f5974b9e1b70e96bc11f8a]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 13, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/main/Cryptids/Zf380.lean formally] reduce Andrew Wade&#039;s 393-state ZFC-independent TM, to a 380-state TM.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/3f273d55d213d7676eb20ae0454acfa472ff4d5d]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On the same day, Jeff Ketchersid claimed to have used Claude Opus 5.5 to [https://github.com/jeff87654/busy-beaver/tree/main/ZF/verify/335 formally] reduce Andrew Wade&#039;s 393-state TM whose halting status is independent of ZFC, to a 335-state TM.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1559077555158392844]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 14, Jeff Ketchersid claimed to have used Claude Opus 5.5 to [https://github.com/jeff87654/busy-beaver/tree/zf-254/ZF/m254 prove] the independence of Mira&#039;s 254-state TM&#039;s halting status from ZFC.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1559799702776582244]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 18, Vladimir Reshetnikov claimed to have used Claude to reduce Mira&#039;s previous 254-state ZFC-independent TM, to a 246-state TM.&amp;lt;sup&amp;gt;[https://github.com/VladimirReshetnikov/ProveIt/commit/34f6b40a21305d4e1a6a36858aa7e5b9bebc03b9][https://github.com/VladimirReshetnikov/ProveIt/commit/8cdc55ff9281b0aaba49bf74b0b225d57f12b893]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 19, Kinata claimed to have used GPT-6 Astra&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1561712707860828261]&amp;lt;/sup&amp;gt; to [https://github.com/elliotglazer/k230-rocq/tree/main/coq formally] reduce Reshetnikov&#039;s previous 246-state ZFC-independent TM, to 230 states.&amp;lt;sup&amp;gt;[https://github.com/elliotglazer/k230-rocq/commit/088a8f2eb47b0dee9e7761cc49cd411157dd5e28][https://discord.com/channels/960643023006490684/1331570843829932063/1561712452679368824]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 20, Vladimir Reshetnikov claimed to have used Claude to [https://github.com/VladimirReshetnikov/ProveIt/tree/main/Computability/BusyBeaver/Research/ZFC/k225-formal/verification/k215/rocq formally] optimize their previous 246-state, ZFC-independent TM, to 215 states.&amp;lt;sup&amp;gt;[https://github.com/VladimirReshetnikov/ProveIt/commit/a61476422532a5d3b7dec11fc7a92751fe0d60f8]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** [[wikipedia:Peano_axioms|Peano Arithmetic]]&lt;br /&gt;
**** On October 15, Mira claimed to have used GPT-6 Astra to [https://github.com/jeff87654/busy-beaver/tree/main/PA/m238/coq prove] the independence of their 238-state PA-independent TM, building off of Jeff Ketchersid&#039;s proof of their ZFC-independent TM.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1560095900024442920]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 29, Discord user charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/PAK formally] reduce the number of defined instructions required in a PA-independent TM to 469 (470 including the halting transition).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1565325918896005130]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 30, Mira claimed to have found a 8,250,306-state TM that &amp;quot;ω-accepts&amp;quot; iff ZFC is ω-consistent. This condition presumably requires an ω-level oracle to determine.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1565752410956234844]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 31, Mira claimed to have found a 236-state TM that &amp;quot;ω-accepts&amp;quot; iff PA is ω-consistent.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1566168045343215777]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** [[wikipedia:Large_cardinal|Large Cardinal Axioms]]&lt;br /&gt;
**** On October 15, Jeff Ketchersid claimed to have used Claude Opus 5.5 to discover a 296-state TM whose halting status can be [https://github.com/jeff87654/busy-beaver/tree/main/ZF/tg296/coq proven] to be independent of ZFC + &amp;quot;Every set is contained in a Grothedieck universe&amp;quot;.&amp;lt;sup&amp;gt;[https://github.com/jeff87654/busy-beaver/commit/923f561312adaaad8bd0e6b20a1e17e5f0339d6d]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** Number Theory&lt;br /&gt;
*** [[wikipedia:Goldbach&#039;s_conjecture|Goldbach&#039;s Conjecture]]&lt;br /&gt;
**** On October 9, Google DeepMind claimed to have used Gemini 3.1 Pro to discover and [https://github.com/google-deepmind/cryptids/blob/c458ec7ae90f5603c35d1bd5534eb6fd4ac1bd58/Cryptids/Goldbach24.lean prove] the property of a 24-state TM that halts if and only if Goldbach&#039;s conjecture is false, improving on the previous smallest known machine with this property by one state.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/c458ec7ae90f5603c35d1bd5534eb6fd4ac1bd58]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 13, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/main/Cryptids/Goldbach21.lean formally] reduce the number of states required from 24 to 21.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/176e5f980ddc6e74f963b983e9d4ba7b28bacc26]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 25, Jeff Ketchersid claimed to have used Claude Opus 5.5 to discover and [https://github.com/jeff87654/busy-beaver/tree/main/PA/goldbach/coq prove] the property of a 449-state TM that halts if and only if Peano Arithmetic can prove Goldbach&#039;s conjecture.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1331570843829932063/1563983209744834570][https://github.com/jeff87654/busy-beaver/tree/main/PA/goldbach]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 31, Charlie used Claude to discover a BB(10,6) machine that halts if and only if Goldbach&#039;s conjecture is false, reducing the number of instructions from 41 to 34.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1566029907169910844]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** [[wikipedia:Riemann_hypothesis|Riemann Hypothesis]]&lt;br /&gt;
**** On October 10, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/7ba85376a9349d54e3460b46ed776df6e094c7dc/Cryptids/Riemann120.lean formalize] the claims of Shunia&#039;s 120-state TM&#039;s halting if and only if the Riemann hypothesis is false.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/7ba85376a9349d54e3460b46ed776df6e094c7dc#diff-c8f1a37032a46e9025c82851438f2d05a1ea34802d5a717c83eeb530a736014f]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 13, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/main/Cryptids/Riemann104.lean formally] reduce the number of states required for a specific TM to encode the truth value of the Riemann hypothesis from 120 to 104.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/468868ef0a7c82a667e8f8013eba19263e972811]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 19, Google DeepMind claimed to have used Gemini 3.1 Pro to [https://github.com/google-deepmind/cryptids/blob/main/Cryptids/Riemann95.lean formally] reduce the bound from 104 states to 95 states.&amp;lt;sup&amp;gt;[https://github.com/google-deepmind/cryptids/commit/bf17809905a1b9a514b0427e24290c7e860a649e]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*** [https://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/ Weak Collatz Conjecture]&lt;br /&gt;
**** On October 18, charlie claimed to have used Claude to reduce the number of states required for a specific TM to encode the truth value of the Weak Collatz conjecture from 124 to 23.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1561339005432500386]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On October 20, Mira claimed to have used GPT-6 Astra&amp;lt;sup&amp;gt;[https://twitter.com/_Mira___Mira_/status/2112429878528324078]&amp;lt;/sup&amp;gt; to reduce the number of states required from 23 to 16.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1561995595848360066][https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM]&amp;lt;/sup&amp;gt;&lt;br /&gt;
**** On the same day, charlie claimed to have used Claude to reduce this bound to 14 states.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1562181014724546651][https://github.com/calr3/tinycryptids/blob/weakcollatz-14/weakcollatz/README.md]&amp;lt;/sup&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+Other problems encoded into Turing machines this month&lt;br /&gt;
!Conjecture&lt;br /&gt;
!Domain&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Discovery date&lt;br /&gt;
!Notes&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.jstor.org/stable/2689842 Erdős ternary conjecture]&lt;br /&gt;
|BB(14)&lt;br /&gt;
|[[User:Cosmo|Tristan Stérin]], GPT‑6&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;Astra&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1562203343114473472]&amp;lt;/sup&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1562205562798604390]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 20&lt;br /&gt;
|Probviously non-halting - halts iff the conjecture is false.&lt;br /&gt;
Reduces the previous known bound of BB(15).&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Fermat&#039;s_Last_Theorem|Fermat&#039;s Last Theorem]]&lt;br /&gt;
|BB(90)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1562937428678017055]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 22&lt;br /&gt;
|Non-halting. (if Wiles&#039;s proof is not assumed: Probviously non-halting - halts iff the theorem is false. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/Fermat Proof.])&lt;br /&gt;
Reduces the previous known bound of BB(400). The previous machine was a Cryptid at the time of construction (1965), whereas this one is not, as the theorem has sice been proven.&amp;lt;sup&amp;gt;[https://www.jstor.org/stable/2118559]&amp;lt;/sup&amp;gt; The proof of this machine&#039;s property, notably, does not rely on the theorem.&lt;br /&gt;
|-&lt;br /&gt;
|Erdős ternary conjecture variant&lt;br /&gt;
|BB(4,4)&lt;br /&gt;
|roromachine14, Gemini&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;4&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;Argon&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1563042146649382983]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 23&lt;br /&gt;
|Probviously non-halting - halts iff there exists an n &amp;gt; 0 such that 2&amp;lt;sup&amp;gt;n&amp;lt;/sup&amp;gt; - 1 does not contain a 1 in its ternary representation.&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Sierpiński_number#Smallest_Sierpi%C5%84ski_number|Smallest Sierpiński number]] &lt;br /&gt;
|BB(60)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1563258441055731712]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 23&lt;br /&gt;
|Unknown - halts iff 78,557 is the smallest Sierpiński number. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/Sierpinski Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Perfect_number#Odd_perfect_numbers|Odd perfect numbers]]&lt;br /&gt;
|BB(67)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1563258441055731712]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 23&lt;br /&gt;
|Probviously non-halting - halts iff an odd perfect number exists. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/OddPerfect Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Collatz_conjecture|Collatz conjecture]]&lt;br /&gt;
|BBB(17)&lt;br /&gt;
|Mira, GPT-6 Astra&amp;lt;sup&amp;gt;[https://twitter.com/_Mira___Mira_/status/2113850733326110966]&amp;lt;/sup&amp;gt;&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561295445312151622/1563419486055432192]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 24&lt;br /&gt;
|Probviously non-quasihalting - quasihalts iff the conjecture is false. [https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Twin_prime#Twin_prime_conjecture|Twin prime conjecture]]&lt;br /&gt;
|BBB(18)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1563635774178590750]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 25&lt;br /&gt;
|Probviously non-quasihalting - quasihalts iff the conjecture is false. [https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[oeis:A049782|Kurepa&#039;s conjecture]]&lt;br /&gt;
|BB(38)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1564196186192216166]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 26&lt;br /&gt;
|Unknown - halts iff the conjecture is false. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/Kurepa Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Fermat_number#Primality|Last Fermat prime]]&lt;br /&gt;
|BB(25)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1564553504364826627]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 27&lt;br /&gt;
|Probviously non-halting - halts iff 65,537 is not the last Fermat prime. [https://github.com/calr3/tinycryptids/tree/main/fermatprimes Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|Finite Fermat primes&lt;br /&gt;
|BBB(16)&lt;br /&gt;
|charlie, Claude&lt;br /&gt;
|October 27&lt;br /&gt;
|Probviously quasihalting - quasihalts iff there are finitely many Fermat primes. [https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM Proof.]&lt;br /&gt;
Announced along with the other Fermat prime-related machine.&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Abc_conjecture|abc conjecture]]&lt;br /&gt;
|BBBB(235)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1565097340560216205]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 28&lt;br /&gt;
|Probviously [[pseudoquasihalting]] - pseudoquasihalts iff the conjecture is &#039;&#039;true&#039;&#039;. [https://github.com/Mira-Cult/math/tree/main/turing-machines/proofs/CollatzTM Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Wall–Sun–Sun_prime#Existence|Wall-Sun-Sun primes]]&lt;br /&gt;
|BB(50)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1565732795328766126]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 30&lt;br /&gt;
|Probviously halting - halts iff a Wall-Sun-Sun prime exists. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/WallSunSun2 Proof.]&lt;br /&gt;
|-&lt;br /&gt;
|Finite Wall-Sun-Sun primes&lt;br /&gt;
|BBB(48)&lt;br /&gt;
|charlie, Claude&lt;br /&gt;
|October 30&lt;br /&gt;
|Probviously non-quasihalting - quasihalts iff there are finitely many Wall-Sun-Sun primes. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/WallSunSunInf Proof.]&lt;br /&gt;
Announced along with the other Wall-Sun-Sun prime-related machine.&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:P_versus_NP_problem|P = NP]]&lt;br /&gt;
|BBB(290)&lt;br /&gt;
|Mira, GPT-6.1 Terra&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1566167540445741147][https://twitter.com/_Mira___Mira_/status/2116578207210361277]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|October 31&lt;br /&gt;
|Unknown - quasihalts iff P = NP. Unformalized.&lt;br /&gt;
|-&lt;br /&gt;
|[[wikipedia:Co-NP|NP = coNP]]&lt;br /&gt;
|BBB(284)&lt;br /&gt;
|Mira, GPT-6.1 Terra&lt;br /&gt;
|October 31&lt;br /&gt;
|Unknown - quasihalts iff NP = coNP. Unformalized.&lt;br /&gt;
Announced along with the P = NP machine.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Misc ==&lt;br /&gt;
&lt;br /&gt;
* On October 17, XnoobSpeakable began archiving messages of users who have consented to the archival project, as well as adding these archived messages to this wiki.&amp;lt;sup&amp;gt;[https://wiki.bbchallenge.org/w/index.php?title=1RB0LD_0RC0RE_1LC0LA_---1LE_0LF0RE_0RA0LE&amp;amp;diff=prev&amp;amp;oldid=9229]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* On October 19, person89 began research for writing a book about the Busy Beaver function,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561880425914179634/1561880425914179634]&amp;lt;/sup&amp;gt; following a poll earlier that month.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1557640579007905853]&amp;lt;/sup&amp;gt; They plan to explain the function&#039;s history, how some values of the function were determined, the mechanisms behind deciders, the behaviors of special machines, and analogs to the function in other models of computation.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561880425914179634/1561880827959447582]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:This Month in Beaver Research|2026-10]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=TMBR:_November_2026&amp;diff=10306</id>
		<title>TMBR: November 2026</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=TMBR:_November_2026&amp;diff=10306"/>
		<updated>2026-11-06T21:23:13Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Added NLogSpace video about Skelet 17&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{TMBRnav|October 2026|December 2026}}&#039;&#039;This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[[:Category:This Month in Beaver Research|This Month in Beaver Research]] for November 2026.&lt;br /&gt;
&lt;br /&gt;
== Media ==&lt;br /&gt;
&lt;br /&gt;
* YouTube video: [https://www.youtube.com/watch?v=pZrjqwlYbF0 Skelet #17: The Last Obstacle to solving Busy Beaver 5]. NLogSpace. 6 Nov 2026.&lt;br /&gt;
&lt;br /&gt;
== BB Adjacent ==&lt;br /&gt;
* [[Pebble Automaton]]&lt;br /&gt;
** On November 2, the remaining group of 22 pebble(11) holdouts was officially dubbed the &amp;quot;golems&amp;quot;. They are modeled by complex systems of equations, making them potential cryptids. They can be categorized into 7 unique paths.&lt;br /&gt;
&lt;br /&gt;
== Champions ==&lt;br /&gt;
{| class=&amp;quot;wikitable mw-collapsible mw-collapsed&amp;quot;&lt;br /&gt;
|+New&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;champions&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;discovered&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;this&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;month&lt;br /&gt;
!Domain&lt;br /&gt;
!Champion&lt;br /&gt;
!Discoverer&lt;br /&gt;
!New&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;lower&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;bound&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Previous&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;lower&#039;&#039;&#039;&amp;amp;nbsp;&#039;&#039;&#039;bound&lt;br /&gt;
|-&lt;br /&gt;
|BB(17)&lt;br /&gt;
|{{TM|1LB1LA_1RC0LA_1RD1RC_1RE1RK_1RF0LJ_1LG1RI_1RM0LM_1LG0RC_0RN0LE_1LA1LE_0LL1LB_0RM1LL_1LF1RH_1RQ0LO_1LP1LN_0RB1LI_1RZ1LO|halt}}&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Jeff Ketchersid&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}^3(9)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(18)&lt;br /&gt;
|{{TM|1LB1LA_1RC0LA_1RD1RC_1RE1RK_1RF0LJ_1LG1RI_1RM0LM_1LG0RC_0RN0LE_1LA1LE_0LL1LB_0RM1LL_1LF1RH_1RQ0LO_1LP1LN_0RB1LI_1RR0LO_0RO1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}^4(9)&amp;lt;/math&amp;gt;&lt;br /&gt;
|Jeff Ketchersid&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}(114)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(19)&lt;br /&gt;
|{{TM|1RQ1RL_0LI1RC_0LD1LF_0RA1LD_1RB1RE_1LH0LG_1LF1LG_1RE1RM_1LJ1LI_0LK1LI_1RL1RA_0RL0RE_0LN1RM_1LO0LO_1RE1LP_1LN1LN_1LR1RQ_1RZ1LS_0LE0LR|halt}}&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |[[User:Jacobzheng]]&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 7}^2(5)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(20)&lt;br /&gt;
|{{TM|1LH0LG_0LI1RC_0LD1LA_0RE1LD_1RQ1RL_1RB1RF_1LA1LG_1RF1RM_1LJ1LI_0LK1LI_1RL1RE_0RL0RF_0LN1RM_0RF0LO_0RF1LP_0RF1LN_1LR1RQ_1RZ1LS_0LF1LT_0LF0LR|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega * 2}(f_{\omega + 2}^2(f_{10}(2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |[[User:Jacobzheng]]&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 6}^2(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(11,4)&lt;br /&gt;
|{{TM|1RG3LB1RZ2RA_2LD---1LD2RA_3RB1LB3LC2RC_3RE---3LC2RC_---3RE3LH2LF_3RF2RF2LE1LF_2LC3LH2LJ2RG_---3RH1LI2RG_3RH1LH3LI2RI_------3LJ3RK_------2RA3RK|halt}}&lt;br /&gt;
| rowspan=&amp;quot;9&amp;quot; |[[User:Loader3229]]&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega \cdot 2}(21)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}^2(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,5)&lt;br /&gt;
|{{TM|2RG3LB4LC2RA4LB_1RZ---1LD2RA4LD_3RB1LB3LC2RC4LC_3RE---3LC2RC3LC_---3RE4LE4LH4RB_4LE3LG3LB2RF4LG_2LH3RG1LH2RF2RA_3RG1LG3LH2RH4LH|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega \cdot 2 + 1}(93)&amp;lt;/math&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |[[User:Loader3229]]&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega \cdot 2}(32)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,6)&lt;br /&gt;
|{{TM|5LD3LB5LC2RA4LB4LC_1RZ3RB1LC2RA3RD0LA_3RB1LB3LC2RC4LC1RA_3RB0LA2LC4LD4LC4LD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}(29)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(2 \uparrow^{15} 5)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(5,6)&lt;br /&gt;
|{{TM|1LE3LB2LA2RA4LB5RA_1RZ3RB1LC2RA3RD4RA_3RB1LB3LC2RC4LC2LB_3RB0LA5LE4LD4LC4LD_4LC5LC0RE5LE1RE2RE|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 3}(31)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(6,6)&lt;br /&gt;
|{{TM|4LF3LB1RZ2RA4LB---_2LC3RB1LD2RA3LF---_3RB1LB3LC2RC4LC0LE_3RB---3LC2RC---3RE_5RC3RE---4LC------_5RB0LF1RB1LF---5RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega * 2}(89)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(7,6)&lt;br /&gt;
|{{TM|2LE3LB1RZ2RA4LB2LD_0LA3RB1LD2RA3LF5RB_3RB1LB3LC2RC4LC1LE_3RB3RE3LC2RC---3RD_5RB3RE0LG4LC3LG5LE_5RB5RB---1LF---5LF_5LF---3RC1LG---5LG|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega^2}(63)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(8,6)&lt;br /&gt;
|{{TM|0LC3LB2LH2RA4LB1RZ_3LH3RB1LD2RA3LF5RB_3RB1LB3LC2RC4LC1LE_3RB3RE3LC2RC2LD3RD_5RB3RE---4LC3LG5LE_5RB5RB---1LF5LF5LF_5LF4RG1LB1LG5LD5LG_3LE---1LH1LH---5RG|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega^2 + 1}(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(3,7)&lt;br /&gt;
|{{TM|6LC3LB5RA2RA4LB2LA5LC_1RZ3RB1LC2RA3RB4LC0LA_3RB1LB3LC2RC4LC5LC---|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 1}(77)&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:Loader3229]]&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega}^4(15)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|BB(4,7)&lt;br /&gt;
|{{TM|6LD3LB5LD2RA4LB3LC5LA_1RZ3RB1LC2RA3RD---2RA_3RB1LB3LC2RC4LC3LC5LD_3RB---6LC4LD4LC4LD---|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;f_{\omega + 2}(124)&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
* [[User:Loader3229]] discovered an array of champions based on Kropitz&#039;s current [[BB(3,4)]] champion, demonstrating the following bounds:&lt;br /&gt;
** On November 1, BB(8,5) &amp;gt; &amp;lt;math&amp;gt;f_{\omega \cdot 2 + 1}(93)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566410612949385317]&amp;lt;/sup&amp;gt; and BB(11,4) &amp;gt; &amp;lt;math&amp;gt;f_{\omega \cdot 2}(21)&amp;lt;/math&amp;gt;.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1084047886494470185/1566423230187700245]&amp;lt;/sup&amp;gt;&lt;br /&gt;
** On November 2, BB(4,6) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(29)&amp;lt;/math&amp;gt;, BB(5,6) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 3}(31)&amp;lt;/math&amp;gt;, BB(6,6) &amp;gt; &amp;lt;math&amp;gt;f_{\omega * 2}(36)&amp;lt;/math&amp;gt; and BB(7,6) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^2}(28)&amp;lt;/math&amp;gt;.&lt;br /&gt;
** On November 3, BB(6,6) &amp;gt; &amp;lt;math&amp;gt;f_{\omega * 2}(89)&amp;lt;/math&amp;gt;.&lt;br /&gt;
** On November 4, BB(7,6) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^2}(63)&amp;lt;/math&amp;gt;, BB(8,6) &amp;gt; &amp;lt;math&amp;gt;f_{\omega^2 + 1}(7)&amp;lt;/math&amp;gt;, BB(3,7) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 1}(77)&amp;lt;/math&amp;gt; and BB(4,7) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 2}(124)&amp;lt;/math&amp;gt;&lt;br /&gt;
* [[User:Jacobzheng]] discovered the following bounds:&lt;br /&gt;
** On November 2, BB(20) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 7}^2(5)&amp;lt;/math&amp;gt;.&lt;br /&gt;
** On November 4, BB(19) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 7}^2(5)&amp;lt;/math&amp;gt; and BB(20) &amp;gt; &amp;lt;math&amp;gt;f_{\omega * 2}(f_{\omega + 2}^2(f_{10}(2))&amp;lt;/math&amp;gt;.&lt;br /&gt;
* On November 4, Jeff Ketchersid used Claude and Gemini to discover the bounds BB(17) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 3}(9)&amp;lt;/math&amp;gt;, BB(18) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 3}^4(9)&amp;lt;/math&amp;gt; and BB(19) &amp;gt; &amp;lt;math&amp;gt;f_{\omega + 4}(f_{\omega + 2}(114))&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
== Holdouts ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&#039;&#039;&#039;BB Holdout Reduction by Domain&#039;&#039;&#039;&lt;br /&gt;
!Domain&lt;br /&gt;
!New Holdout Count&lt;br /&gt;
!Previous Holdout Count&lt;br /&gt;
!Holdout Reduction&lt;br /&gt;
!% Reduction&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|608&lt;br /&gt;
|608&lt;br /&gt;
|0&lt;br /&gt;
|0.00%&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,5)]]&lt;br /&gt;
|37 (official)&lt;br /&gt;
|59 (official), 37 (informal)&lt;br /&gt;
|22 (Rocq confirmation of Lean proofs)&lt;br /&gt;
|37.29% (confirmations)&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
* [[BB(6)]]&lt;br /&gt;
** On November 1, Ahmer Raza simulated two holdouts, both Reus Vampires, to halting.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1566293610503340184]&amp;lt;/sup&amp;gt;&lt;br /&gt;
*[[BB(2,5)]]&lt;br /&gt;
** On November 3, mxdys confirmed in Rocq the proofs in Lean of 22 TMs solved with AI assistance (GPT6 and Aristotle), releasing a formal list of &#039;&#039;&#039;37&#039;&#039;&#039; holdouts.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1259770421046411285/1567052029430595584]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
All Turing machines mentioned in this section work with an alphabet of 2 symbols unless explicitly stated. The state bounds given also only consider Turing machines which work with 2 symbols.&lt;br /&gt;
&lt;br /&gt;
* [[Cryptids#Cryptids at the Edge|Cryptids in the Wild]] (+ [[User:RobinCodes/Machines at the Edge|Energy Vampires]])&lt;br /&gt;
** [https://discord.com/channels/960643023006490684/1561037362581086228 Reus Vampires]&lt;br /&gt;
*** On November 1, Ahmer Raza ran path O4 to 1,941,376,761,248 iterations, at which point it halts!&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1561037362581086228/1566292773173198980]&amp;lt;/sup&amp;gt; This path corresponds to a group of machines with halting times of over 10&amp;lt;sup&amp;gt;683,718,950,000&amp;lt;/sup&amp;gt; steps, and decides the last of the 7 Reus vampires.&lt;br /&gt;
&lt;br /&gt;
* [[Cryptids#Larger Cryptids|Larger Cryptids]]&lt;br /&gt;
** [[Logical independence|Logical Independence]]&lt;br /&gt;
*** [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo-Frankel set theory]]&lt;br /&gt;
**** On November 1, charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/zfc_nsymbols/mm0 formally] reduce the number of defined instructions required in a ZFC-independent TM to 375 (376 including the halting transition).&lt;br /&gt;
** Computational Complexity Theory&lt;br /&gt;
*** On November 1, GregoryMorse claimed to have found a 278-state machine that quasihalts iff P = NP, a 295-state machine that quasihalts iff P = PP, and a 291-state machine that quasihalts iff P = PSPACE.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1566326998563823719]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+Other problems encoded into Turing machines this month&lt;br /&gt;
!Conjecture&lt;br /&gt;
!Domain&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Discovery date&lt;br /&gt;
!Notes&lt;br /&gt;
|-&lt;br /&gt;
|Pillai&#039;s conjecture&lt;br /&gt;
|BBBB(91)&lt;br /&gt;
|charlie, Claude&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1385498968011575366/1566248174614479061]&amp;lt;/sup&amp;gt;&lt;br /&gt;
|November 1&lt;br /&gt;
|Unknown - pseudoquasihalts if the conjecture is false. [https://github.com/calr3/tinycryptids/tree/main/lean/TinyCryptids/Pillai Proof.]&lt;br /&gt;
|}&lt;br /&gt;
[[Category:This Month in Beaver Research|2026-11]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Measuring_large_numbers&amp;diff=10267</id>
		<title>Measuring large numbers</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Measuring_large_numbers&amp;diff=10267"/>
		<updated>2026-11-05T06:53:05Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Fast-growing hierarchy */ Tidy up fast-growing hierarchy&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Stub}}&lt;br /&gt;
The busy beaver functions are known to grow faster than any computable function, as do many of their variants. Because of this, values of the function, or lower bounds on the function can be very, very large, so it is tempting to find ways of representing these numbers; this article will cover these methods.&lt;br /&gt;
&lt;br /&gt;
Paradoxically, although the Kolgomorov complexity of stating &amp;quot;The runtime of program X&amp;quot; to define the runtime of program X is typically very low, it is often not useful as it does not give us good information on the size of the number. Informally, more &amp;quot;natural&amp;quot; or &amp;quot;combinatorial&amp;quot; ways of measuring large numbers are desired which allow us to relatively compare the rough &amp;quot;ballparks&amp;quot; of the numbers&#039; scales. Tools like Knuth&#039;s up-arrow notation can help us achieve this, as well as more powerful methods such as [[Fast-Growing Hierarchy|fast-growing hierarchy]] or the diagonalization of an axiomatic foundation of mathematics.&lt;br /&gt;
&lt;br /&gt;
== Scientific notation ==&lt;br /&gt;
Scientific notation is one of the most common ways of representing large numbers; numbers written in standard scientific notation symbolically consist of a multiplicand (taking a value between 1 and the base, though is sometimes omitted), a base (commonly 10) and an exponent (usually an integer, though sometimes takes non-integer values if the multiplicand is omitted).&lt;br /&gt;
&lt;br /&gt;
For example, &amp;lt;math&amp;gt;8.68 \cdot 10^6&amp;lt;/math&amp;gt; represents the number 8,680,000, whereas &amp;lt;math&amp;gt;6.022 \cdot 10^{23}&amp;lt;/math&amp;gt; represents the number 602,200,000,000,000,000,000,000. These numbers are often approximations (to some number of digits) or lower/upper bounds on the precise integer.&lt;br /&gt;
&lt;br /&gt;
Non-integer exponents are also often used to approximate. For example, &amp;lt;math&amp;gt;10^{7.67}&amp;lt;/math&amp;gt; representing a lower bound for the number 46,773,515.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Certain busy beaver values can most conveniently be represented using scientific notation; they include:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(3,3) &amp;gt; 1.1912 \cdot 10^{17}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BBf}(23) &amp;gt; 4.3932 \cdot 10^{124}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(38) &amp;gt; 1.0017 \cdot 10^{19,729}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
When representing even larger numbers using scientific notation, the exponent itself may also be represented using scientific notation. For example:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(2,5) &amp;gt; 10^{10^{10^{3,314,360}}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Knuth&#039;s up-arrow notation ==&lt;br /&gt;
Knuth&#039;s up-arrow notation extends the sequence of recursive operators (i.e. addition, multiplication, exponentiation) to higher-order functions (e.g. tetration, pentation) which grow much more rapidly.&lt;br /&gt;
&lt;br /&gt;
Tetration, the operation following exponentiation in the sequence of &amp;quot;hyperoperators&amp;quot; is defined by:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;a \uparrow \uparrow b = \begin{cases}&lt;br /&gt;
    1, &amp;amp; \text{if } b = 0&lt;br /&gt;
    \\ a^{a \uparrow \uparrow (b - 1)}, &amp;amp; \text{otherwise.}&lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The lower bound for &amp;lt;math&amp;gt;S(2,5)&amp;lt;/math&amp;gt; can thus be more concisely (though more weakly) written as &amp;lt;math&amp;gt;S(2,5) &amp;gt; 10 \uparrow\uparrow 4&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Knuth&#039;s up-arrow notation generalizes this though the following formula (where an arrow with a superscript of n represents the operator indicated by n arrows):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;a \uparrow^{n} b =\begin{cases}&lt;br /&gt;
     a^b, &amp;amp; \text{if } n = 1,&lt;br /&gt;
     \\ 1, &amp;amp; \text{if } n &amp;gt; 1 \text{ and } b = 0,&lt;br /&gt;
     \\ a \uparrow^{n - 1} (a \uparrow^{n} (b - 1)), &amp;amp; \text{otherwise.}&lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Larger busy beaver values represented using Knuth&#039;s up-arrow notation include:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(2,6) &amp;gt; 10 \uparrow \uparrow \uparrow 3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(4,3) &amp;gt; 10 \uparrow \uparrow \uparrow \uparrow 4&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(3,4) &amp;gt; 2 \uparrow^{15} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(3,5) &amp;gt; 2 \uparrow^{2 \uparrow^{15} 3} 3&amp;lt;/math&amp;gt; &lt;br /&gt;
&lt;br /&gt;
[[Busy Beaver Challenge|bbchallenge]] uses a piecewise extension of tetration in order to write numbers of this scale more accurately:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;a \uparrow \uparrow b =\begin{cases}&lt;br /&gt;
     b + 1, &amp;amp; \text{if } -1 &amp;lt; b \leq 0,&lt;br /&gt;
     \\ a^{a \uparrow \uparrow (b - 1)}, &amp;amp; \text{otherwise.}&lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Note that when using this method, the function &amp;lt;math&amp;gt;10 \uparrow\uparrow x&amp;lt;/math&amp;gt;, and other functions similar to it, are not analytic functions; however, that requirement is unnecessary when using this method to represent large numbers. Additionally, methods of obtaining analytic hyperoperators are complex, typically involving Abel functions, Riemann mappings, or Jabotinsky matrices; this method forgoes this, allowing for the ease of calculation.&lt;br /&gt;
&lt;br /&gt;
In this format, the lower bound for &amp;lt;math&amp;gt;S(2,5)&amp;lt;/math&amp;gt; can be written more precisely as &amp;lt;math&amp;gt;S(2,5) &amp;gt; 10 \uparrow\uparrow 4.8142&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Graham&#039;s number]] (&amp;lt;math&amp;gt;g_{64}&amp;lt;/math&amp;gt;) is a famously large number that is defined using Knuth&#039;s up-arrow notation:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;g_n = \begin{cases}&lt;br /&gt;
    3 \uparrow \uparrow \uparrow \uparrow 3, &amp;amp; \text{if }n = 1&lt;br /&gt;
    \\ 3 \uparrow^{g_{n - 1}} 3, &amp;amp; \text{if } n &amp;gt; 1 &lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The Ackermann function &amp;lt;math&amp;gt;\operatorname{A}(n,n)&amp;lt;/math&amp;gt; grows at roughly the same rate as &amp;lt;math&amp;gt;2 \uparrow^{n} 3&amp;lt;/math&amp;gt;. It can be said to &amp;quot;diagonalize&amp;quot; across the hyperoperators, eventually dominating every single hyperoperator.&lt;br /&gt;
&lt;br /&gt;
== Fast-growing hierarchy ==&lt;br /&gt;
The [[fast-growing hierarchy]] uses function iteration and diagonalization across previous functions to extend far beyond the Ackermann function. Functions in the fast-growing hierarchy are written in the form &amp;lt;math&amp;gt;f_\alpha(n)&amp;lt;/math&amp;gt;, and are calculated according to three rules:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f_0(n) = n + 1&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f_{\alpha + 1}(n) = f_{\alpha}^n(n)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f_{\alpha}(n) = f_{\alpha[n]}(n)&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; is a limit ordinal (i.e. not a successor of any ordinal, nor zero.)&lt;br /&gt;
&lt;br /&gt;
Usually, an ordinal &amp;lt;math&amp;gt;\lambda&amp;lt;/math&amp;gt; is first chosen, and then &amp;lt;math&amp;gt;f_\alpha&amp;lt;/math&amp;gt; is defined via to the clauses above for all ordinals &amp;lt;math&amp;gt;\alpha &amp;lt; \lambda&amp;lt;/math&amp;gt;. This requires a system of fundamental sequences to be fixed first, where for each limit ordinal &amp;lt;math&amp;gt;\alpha &amp;lt; \lambda&amp;lt;/math&amp;gt; the fundamental sequence of &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; is a sequence of ordinals which has a supremum of &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
It is suspected that in this wiki, and in most other spaces that deal with googology, the fundamental sequences described by Maksudov (2017){{Citation needed}} are used to define the fast-growing hierarchy.&lt;br /&gt;
&lt;br /&gt;
In this manner, the value of &amp;lt;math&amp;gt;S(3,5)&amp;lt;/math&amp;gt; can be more concisely (though more weakly) written as &amp;lt;math&amp;gt;S(3,5) &amp;gt; f_\omega(2 \uparrow^{15} 3)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Other busy beaver values that necessitate the use of the fast-growing hierarchy include:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(49) &amp;gt; f_{\omega + 1}\left(\frac{2 \uparrow \uparrow 6}{2}\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{S}(51) &amp;gt; f_{\varepsilon_0 + 1}(8)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(100) &amp;gt; f_{\psi_0(\Omega_\omega) + 1}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Defining fundamental sequences: ordinal notations and ordinal collapsing functions ===&lt;br /&gt;
Individually defining fundamental sequences for a transfinite number of ordinals may be less than ideal; thus, to define the fast-growing hierarchy effectively, ordinal notations, which define a computable mapping between sequences of symbols and ordinals can be used to define fundamental sequences instead. TODO&amp;lt;!-- somewhere in this section should mention&lt;br /&gt;
cantor form&lt;br /&gt;
primitive sequence system or kirby paris hydra&lt;br /&gt;
buccholz ocf and/or extension to p0(Lambda)&lt;br /&gt;
after that, go, be free. live. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Comparing FGH and BB ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Ordinal α !! Least m that BB(m) confirmed &amp;gt;= f&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt;(2) !! Least m that BB(m) confirmed &amp;gt;= f&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt;(3) !! Least m that BB(m) confirmed &amp;gt;= f&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt;(10)&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega&amp;lt;/math&amp;gt; (Cantor normal form)|| 3 || 6 || 7&amp;lt;ref&amp;gt;See {{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF}}.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega+1&amp;lt;/math&amp;gt;|| 7 || 8 || 10&amp;lt;ref&amp;gt;Jeff Ketchersid, &amp;quot;[https://github.com/jeff87654/busy-beaver/blob/main/BB10/1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LI0LC_0RG1LD_1RH1LG_1LC0RG_0LJ0LI_1RZ0LC.md A 10-state machine at level f_(ω+1)]&amp;quot;. Github file, October 2026. Accessed 17 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega+2&amp;lt;/math&amp;gt;|| 10 || 12 || 12&amp;lt;ref&amp;gt;Jeff Ketchersid, &amp;quot;[https://github.com/jeff87654/busy-beaver/blob/main/BB12/1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RG0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_1RZ0LL_0LH1LK.md M12: a 12-state machine at level f_(ω+2)]&amp;quot;. Github file, October 2026. Accessed 27 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega\times 2&amp;lt;/math&amp;gt;|| 10 || 14 || 20&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega^2&amp;lt;/math&amp;gt;|| 10 || 20 || 21&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega^\omega&amp;lt;/math&amp;gt;|| 10 || 29 || 31&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega^\omega+1&amp;lt;/math&amp;gt;|| 31 || 31 || 31&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\varepsilon_0&amp;lt;/math&amp;gt; (Epsilon ordinals)|| 10 || 31 || 51&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1026577255754903572/1276881449685094495&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Sligocki, &amp;quot;[[Talk:Champions#BB(51)_epsilon_0_champion|BB(51) epsilon_0 champion]]&amp;quot;. bbchallenge wiki talk page edit, September 2024. Accessed 7 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\varphi(\omega , 0)&amp;lt;/math&amp;gt; (Veblen&#039;s phi function)|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\Omega_2)&amp;lt;/math&amp;gt; (Buchholz&#039;s psi function)|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\Omega_\omega)&amp;lt;/math&amp;gt;|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\varepsilon_{\Omega_\omega+1})&amp;lt;/math&amp;gt;|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\Omega_{\Omega_{\Omega_{...}}})&amp;lt;/math&amp;gt;|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;lim(BMS)&amp;lt;/math&amp;gt; (Bashicu matrix system)|| || || 150&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Theories ==&lt;br /&gt;
The proof-theoretic ordinal of a theory is defined as supremum of the order types of all ordinal notations that can be shown to be well-founded within the theory.&lt;br /&gt;
&lt;br /&gt;
Some examples of proof theoretical ordinals include &amp;lt;math&amp;gt;\operatorname{PTO}(Q) = \omega&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\operatorname{PTO}(PA) = \varepsilon_0&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;\operatorname{PTO}(\operatorname{KP}) = \psi_0(\varepsilon_{\Omega+1})&amp;lt;/math&amp;gt;. Here Q is [[wikipedia:Robinson_arithmetic|Robinson arithmetic]], PA is Peano Arithmetic, and KP is Kripke-Platek set theory. &lt;br /&gt;
&lt;br /&gt;
Determination of the proof theoretic ordinal of second order arithmetic has been claimed in two preprints, one of which is a work-in-progress,&amp;lt;ref&amp;gt;T. Arai, &amp;quot;[https://arxiv.org/abs/2311.12459 An ordinal analysis of &amp;lt;math&amp;gt;\Pi_n&amp;lt;/math&amp;gt;-Collection]&amp;quot; (2023). Accessed 8 October 2026.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;H. Towsner, &amp;quot;[https://arxiv.org/abs/2403.17922 Proofs that Modify Proofs]&amp;quot; (2024). Accessed 8 October 2026.&amp;lt;/ref&amp;gt; and is known to vastly exceed that of &amp;lt;math&amp;gt;\operatorname{KP}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
They can be used to compare the strength of different theories, as well as (by definition) an indicator as to which ordinal notations (or functions that are derived from ordinal notations) cannot be shown to be well-founded (or total) in a theory.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A notable example of a theory which is directly used to create fast growing functions is the Calculus of Constructions (CoC), which has a proof-theoretic ordinal greater than that of any nth order arithmetic (&amp;lt;math&amp;gt;Z_n&amp;lt;/math&amp;gt;); well-formed statements in CoC can also be easily detected, and are strongly normalizing (TODO: explain what that means in this context).&lt;br /&gt;
&lt;br /&gt;
CoC yields the fast growing function &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; (defined by Ralph Loader in 2001 to create the eponymous Loader&#039;s number = &amp;lt;math&amp;gt;D^5(99)&amp;lt;/math&amp;gt;), which computes something similar to (but larger than) &amp;quot;The largest number \(x\) such that there is a &amp;lt;math&amp;gt;\Sigma^0_1&amp;lt;/math&amp;gt; formula &amp;lt;math&amp;gt;\phi(x)&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;\phi(x)&amp;lt;/math&amp;gt; is true and &amp;lt;math&amp;gt;\exists x\phi(x)&amp;lt;/math&amp;gt; is provable in CoC with a proof of length \(\leq \log_2 n\)&amp;quot;.&amp;lt;ref&amp;gt;R. Loader, &amp;quot;[https://raw.githubusercontent.com/rcls/busy/master/README.txt busy]&amp;quot;. GitHub repository (2003). Accessed 7 October 2026.&amp;lt;/ref&amp;gt; &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; outgrows all recursive functions provably total in &amp;lt;math&amp;gt;Z_\omega&amp;lt;/math&amp;gt;; the growth rate of &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; is sometimes informally written as &amp;lt;math&amp;gt;f_{\operatorname{PTO}(Z_\omega)}(n)&amp;lt;/math&amp;gt;, though no fundamental sequence has yet been defined for all ordinals under &amp;lt;math&amp;gt;\operatorname{PTO}(Z_\omega)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
The simplicity of CoC and &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; has been utilized to show the following bounds for certain busy beaver values:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(1797) &amp;gt; D^5(99)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{S}(1015) &amp;gt; D^5(99)&amp;lt;/math&amp;gt;&amp;lt;ref&amp;gt;CatsAreFluffy, &amp;quot;[https://github.com/CatsAreFluffy/metamath-turing-machines/commit/85948b04fc4aeb983ca6d63d6aee5ad6ef308bfe metamath-turing-machines]&amp;quot;. GitHub commit (September 2024). Accessed 7 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An even stronger but simpler function, &amp;lt;math&amp;gt;q(n)&amp;lt;/math&amp;gt;, has been derived from the structure of [[wikipedia:Rank-into-rank_cardinal|&amp;lt;math&amp;gt;\operatorname{I3}&amp;lt;/math&amp;gt;]] elementary embeddings, though it is unknown if this function can be shown to be total in &amp;lt;math&amp;gt;\operatorname{ZFC}&amp;lt;/math&amp;gt; alone, and whether it grows faster than the aforementioned &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt;. It is used in the following (conjectured) bounds:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(201) &amp;gt; q(5)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{S}(67) &amp;gt; q^{81}(q(5) - 2)&amp;lt;/math&amp;gt;&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1331570843829932063/1339669138510970881&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;racheline, &amp;quot;[https://wiki.bbchallenge.org/wiki/Talk:Champions Larger Champions]&amp;quot;. bbchallenge wiki talk post edit (February 2025). Accessed 7 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Resources ==&lt;br /&gt;
The Googology wiki hosts good information on methods of describing large numbers or large upper bounds for numbers.&lt;br /&gt;
&lt;br /&gt;
* https://googology.miraheze.org/wiki/Main_Page&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
[[Category:Stub]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Measuring_large_numbers&amp;diff=10266</id>
		<title>Measuring large numbers</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Measuring_large_numbers&amp;diff=10266"/>
		<updated>2026-11-05T06:48:39Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Knuth&amp;#039;s up-arrow notation */ Tidy up knuth up-arrow section&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Stub}}&lt;br /&gt;
The busy beaver functions are known to grow faster than any computable function, as do many of their variants. Because of this, values of the function, or lower bounds on the function can be very, very large, so it is tempting to find ways of representing these numbers; this article will cover these methods.&lt;br /&gt;
&lt;br /&gt;
Paradoxically, although the Kolgomorov complexity of stating &amp;quot;The runtime of program X&amp;quot; to define the runtime of program X is typically very low, it is often not useful as it does not give us good information on the size of the number. Informally, more &amp;quot;natural&amp;quot; or &amp;quot;combinatorial&amp;quot; ways of measuring large numbers are desired which allow us to relatively compare the rough &amp;quot;ballparks&amp;quot; of the numbers&#039; scales. Tools like Knuth&#039;s up-arrow notation can help us achieve this, as well as more powerful methods such as [[Fast-Growing Hierarchy|fast-growing hierarchy]] or the diagonalization of an axiomatic foundation of mathematics.&lt;br /&gt;
&lt;br /&gt;
== Scientific notation ==&lt;br /&gt;
Scientific notation is one of the most common ways of representing large numbers; numbers written in standard scientific notation symbolically consist of a multiplicand (taking a value between 1 and the base, though is sometimes omitted), a base (commonly 10) and an exponent (usually an integer, though sometimes takes non-integer values if the multiplicand is omitted).&lt;br /&gt;
&lt;br /&gt;
For example, &amp;lt;math&amp;gt;8.68 \cdot 10^6&amp;lt;/math&amp;gt; represents the number 8,680,000, whereas &amp;lt;math&amp;gt;6.022 \cdot 10^{23}&amp;lt;/math&amp;gt; represents the number 602,200,000,000,000,000,000,000. These numbers are often approximations (to some number of digits) or lower/upper bounds on the precise integer.&lt;br /&gt;
&lt;br /&gt;
Non-integer exponents are also often used to approximate. For example, &amp;lt;math&amp;gt;10^{7.67}&amp;lt;/math&amp;gt; representing a lower bound for the number 46,773,515.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Certain busy beaver values can most conveniently be represented using scientific notation; they include:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(3,3) &amp;gt; 1.1912 \cdot 10^{17}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BBf}(23) &amp;gt; 4.3932 \cdot 10^{124}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(38) &amp;gt; 1.0017 \cdot 10^{19,729}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
When representing even larger numbers using scientific notation, the exponent itself may also be represented using scientific notation. For example:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(2,5) &amp;gt; 10^{10^{10^{3,314,360}}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Knuth&#039;s up-arrow notation ==&lt;br /&gt;
Knuth&#039;s up-arrow notation extends the sequence of recursive operators (i.e. addition, multiplication, exponentiation) to higher-order functions (e.g. tetration, pentation) which grow much more rapidly.&lt;br /&gt;
&lt;br /&gt;
Tetration, the operation following exponentiation in the sequence of &amp;quot;hyperoperators&amp;quot; is defined by:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;a \uparrow \uparrow b = \begin{cases}&lt;br /&gt;
    1, &amp;amp; \text{if } b = 0&lt;br /&gt;
    \\ a^{a \uparrow \uparrow (b - 1)}, &amp;amp; \text{otherwise.}&lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The lower bound for &amp;lt;math&amp;gt;S(2,5)&amp;lt;/math&amp;gt; can thus be more concisely (though more weakly) written as &amp;lt;math&amp;gt;S(2,5) &amp;gt; 10 \uparrow\uparrow 4&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Knuth&#039;s up-arrow notation generalizes this though the following formula (where an arrow with a superscript of n represents the operator indicated by n arrows):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;a \uparrow^{n} b =\begin{cases}&lt;br /&gt;
     a^b, &amp;amp; \text{if } n = 1,&lt;br /&gt;
     \\ 1, &amp;amp; \text{if } n &amp;gt; 1 \text{ and } b = 0,&lt;br /&gt;
     \\ a \uparrow^{n - 1} (a \uparrow^{n} (b - 1)), &amp;amp; \text{otherwise.}&lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Larger busy beaver values represented using Knuth&#039;s up-arrow notation include:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(2,6) &amp;gt; 10 \uparrow \uparrow \uparrow 3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(4,3) &amp;gt; 10 \uparrow \uparrow \uparrow \uparrow 4&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(3,4) &amp;gt; 2 \uparrow^{15} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(3,5) &amp;gt; 2 \uparrow^{2 \uparrow^{15} 3} 3&amp;lt;/math&amp;gt; &lt;br /&gt;
&lt;br /&gt;
[[Busy Beaver Challenge|bbchallenge]] uses a piecewise extension of tetration in order to write numbers of this scale more accurately:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;a \uparrow \uparrow b =\begin{cases}&lt;br /&gt;
     b + 1, &amp;amp; \text{if } -1 &amp;lt; b \leq 0,&lt;br /&gt;
     \\ a^{a \uparrow \uparrow (b - 1)}, &amp;amp; \text{otherwise.}&lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Note that when using this method, the function &amp;lt;math&amp;gt;10 \uparrow\uparrow x&amp;lt;/math&amp;gt;, and other functions similar to it, are not analytic functions; however, that requirement is unnecessary when using this method to represent large numbers. Additionally, methods of obtaining analytic hyperoperators are complex, typically involving Abel functions, Riemann mappings, or Jabotinsky matrices; this method forgoes this, allowing for the ease of calculation.&lt;br /&gt;
&lt;br /&gt;
In this format, the lower bound for &amp;lt;math&amp;gt;S(2,5)&amp;lt;/math&amp;gt; can be written more precisely as &amp;lt;math&amp;gt;S(2,5) &amp;gt; 10 \uparrow\uparrow 4.8142&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Graham&#039;s number]] (&amp;lt;math&amp;gt;g_{64}&amp;lt;/math&amp;gt;) is a famously large number that is defined using Knuth&#039;s up-arrow notation:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;g_n = \begin{cases}&lt;br /&gt;
    3 \uparrow \uparrow \uparrow \uparrow 3, &amp;amp; \text{if }n = 1&lt;br /&gt;
    \\ 3 \uparrow^{g_{n - 1}} 3, &amp;amp; \text{if } n &amp;gt; 1 &lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The Ackermann function &amp;lt;math&amp;gt;\operatorname{A}(n,n)&amp;lt;/math&amp;gt; grows at roughly the same rate as &amp;lt;math&amp;gt;2 \uparrow^{n} 3&amp;lt;/math&amp;gt;. It can be said to &amp;quot;diagonalize&amp;quot; across the hyperoperators, eventually dominating every single hyperoperator.&lt;br /&gt;
&lt;br /&gt;
== Fast-growing hierarchy ==&lt;br /&gt;
The fast-growing hierarchy uses the fundamental sequences of ordinals to define diagonalizations across previous functions in the hierarchy. Functions in the fast-growing hierarchy are written in the form &amp;lt;math&amp;gt;f_\alpha(n)&amp;lt;/math&amp;gt;, and are calculated according to three rules:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f_0(n) = n + 1&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f_{\alpha + 1}(n) = f_{\alpha}^n(n)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f_{\alpha}(n) = f_{\alpha[n]}(n)&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; is a limit ordinal (i.e. not a successor of any ordinal, nor zero.)&lt;br /&gt;
&lt;br /&gt;
Usually, an ordinal &amp;lt;math&amp;gt;\lambda&amp;lt;/math&amp;gt; is first chosen, and then &amp;lt;math&amp;gt;f_\alpha&amp;lt;/math&amp;gt; is defined via to the clauses above for all ordinals &amp;lt;math&amp;gt;\alpha &amp;lt; \lambda&amp;lt;/math&amp;gt;. This requires a system of fundamental sequences to be fixed first, where for each limit ordinal &amp;lt;math&amp;gt;\alpha &amp;lt; \lambda&amp;lt;/math&amp;gt; the fundamental sequence of &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; is a sequence of ordinals which has a supremum of &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
It is suspected that in this wiki, and in most other spaces that deal with googology, the fundamental sequences described by Maksudov (2017){{Citation needed}} are used to define the fast-growing hierarchy.&lt;br /&gt;
&lt;br /&gt;
In this manner, the value of &amp;lt;math&amp;gt;S(3,5)&amp;lt;/math&amp;gt; can be more concisely (though more weakly) written as &amp;lt;math&amp;gt;S(3,5) &amp;gt; f_\omega(2 \uparrow^{15} 3)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Other busy beaver values that necessitate the use of the fast-growing hierarchy include:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(49) &amp;gt; f_{\omega + 1}\left(\frac{2 \uparrow \uparrow 6}{2}\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{S}(51) &amp;gt; f_{\varepsilon_0 + 1}(8)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(100) &amp;gt; f_{\psi_0(\Omega_\omega) + 1}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Defining fundamental sequences: ordinal notations and ordinal collapsing functions ===&lt;br /&gt;
Individually defining fundamental sequences for a transfinite number of ordinals may be less than ideal; thus, to define the fast-growing hierarchy effectively, ordinal notations, which define a computable mapping between sequences of symbols and ordinals can be used to define fundamental sequences instead. TODO&amp;lt;!-- somewhere in this section should mention&lt;br /&gt;
cantor form&lt;br /&gt;
primitive sequence system or kirby paris hydra&lt;br /&gt;
buccholz ocf and/or extension to p0(Lambda)&lt;br /&gt;
after that, go, be free. live. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Comparing FGH and BB ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Ordinal α !! Least m that BB(m) confirmed &amp;gt;= f&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt;(2) !! Least m that BB(m) confirmed &amp;gt;= f&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt;(3) !! Least m that BB(m) confirmed &amp;gt;= f&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt;(10)&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega&amp;lt;/math&amp;gt; (Cantor normal form)|| 3 || 6 || 7&amp;lt;ref&amp;gt;See {{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF}}.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega+1&amp;lt;/math&amp;gt;|| 7 || 8 || 10&amp;lt;ref&amp;gt;Jeff Ketchersid, &amp;quot;[https://github.com/jeff87654/busy-beaver/blob/main/BB10/1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LI0LC_0RG1LD_1RH1LG_1LC0RG_0LJ0LI_1RZ0LC.md A 10-state machine at level f_(ω+1)]&amp;quot;. Github file, October 2026. Accessed 17 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega+2&amp;lt;/math&amp;gt;|| 10 || 12 || 12&amp;lt;ref&amp;gt;Jeff Ketchersid, &amp;quot;[https://github.com/jeff87654/busy-beaver/blob/main/BB12/1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RG0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_1RZ0LL_0LH1LK.md M12: a 12-state machine at level f_(ω+2)]&amp;quot;. Github file, October 2026. Accessed 27 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega\times 2&amp;lt;/math&amp;gt;|| 10 || 14 || 20&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega^2&amp;lt;/math&amp;gt;|| 10 || 20 || 21&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega^\omega&amp;lt;/math&amp;gt;|| 10 || 29 || 31&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega^\omega+1&amp;lt;/math&amp;gt;|| 31 || 31 || 31&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\varepsilon_0&amp;lt;/math&amp;gt; (Epsilon ordinals)|| 10 || 31 || 51&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1026577255754903572/1276881449685094495&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Sligocki, &amp;quot;[[Talk:Champions#BB(51)_epsilon_0_champion|BB(51) epsilon_0 champion]]&amp;quot;. bbchallenge wiki talk page edit, September 2024. Accessed 7 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\varphi(\omega , 0)&amp;lt;/math&amp;gt; (Veblen&#039;s phi function)|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\Omega_2)&amp;lt;/math&amp;gt; (Buchholz&#039;s psi function)|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\Omega_\omega)&amp;lt;/math&amp;gt;|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\varepsilon_{\Omega_\omega+1})&amp;lt;/math&amp;gt;|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\Omega_{\Omega_{\Omega_{...}}})&amp;lt;/math&amp;gt;|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;lim(BMS)&amp;lt;/math&amp;gt; (Bashicu matrix system)|| || || 150&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Theories ==&lt;br /&gt;
The proof-theoretic ordinal of a theory is defined as supremum of the order types of all ordinal notations that can be shown to be well-founded within the theory.&lt;br /&gt;
&lt;br /&gt;
Some examples of proof theoretical ordinals include &amp;lt;math&amp;gt;\operatorname{PTO}(Q) = \omega&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\operatorname{PTO}(PA) = \varepsilon_0&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;\operatorname{PTO}(\operatorname{KP}) = \psi_0(\varepsilon_{\Omega+1})&amp;lt;/math&amp;gt;. Here Q is [[wikipedia:Robinson_arithmetic|Robinson arithmetic]], PA is Peano Arithmetic, and KP is Kripke-Platek set theory. &lt;br /&gt;
&lt;br /&gt;
Determination of the proof theoretic ordinal of second order arithmetic has been claimed in two preprints, one of which is a work-in-progress,&amp;lt;ref&amp;gt;T. Arai, &amp;quot;[https://arxiv.org/abs/2311.12459 An ordinal analysis of &amp;lt;math&amp;gt;\Pi_n&amp;lt;/math&amp;gt;-Collection]&amp;quot; (2023). Accessed 8 October 2026.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;H. Towsner, &amp;quot;[https://arxiv.org/abs/2403.17922 Proofs that Modify Proofs]&amp;quot; (2024). Accessed 8 October 2026.&amp;lt;/ref&amp;gt; and is known to vastly exceed that of &amp;lt;math&amp;gt;\operatorname{KP}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
They can be used to compare the strength of different theories, as well as (by definition) an indicator as to which ordinal notations (or functions that are derived from ordinal notations) cannot be shown to be well-founded (or total) in a theory.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A notable example of a theory which is directly used to create fast growing functions is the Calculus of Constructions (CoC), which has a proof-theoretic ordinal greater than that of any nth order arithmetic (&amp;lt;math&amp;gt;Z_n&amp;lt;/math&amp;gt;); well-formed statements in CoC can also be easily detected, and are strongly normalizing (TODO: explain what that means in this context).&lt;br /&gt;
&lt;br /&gt;
CoC yields the fast growing function &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; (defined by Ralph Loader in 2001 to create the eponymous Loader&#039;s number = &amp;lt;math&amp;gt;D^5(99)&amp;lt;/math&amp;gt;), which computes something similar to (but larger than) &amp;quot;The largest number \(x\) such that there is a &amp;lt;math&amp;gt;\Sigma^0_1&amp;lt;/math&amp;gt; formula &amp;lt;math&amp;gt;\phi(x)&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;\phi(x)&amp;lt;/math&amp;gt; is true and &amp;lt;math&amp;gt;\exists x\phi(x)&amp;lt;/math&amp;gt; is provable in CoC with a proof of length \(\leq \log_2 n\)&amp;quot;.&amp;lt;ref&amp;gt;R. Loader, &amp;quot;[https://raw.githubusercontent.com/rcls/busy/master/README.txt busy]&amp;quot;. GitHub repository (2003). Accessed 7 October 2026.&amp;lt;/ref&amp;gt; &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; outgrows all recursive functions provably total in &amp;lt;math&amp;gt;Z_\omega&amp;lt;/math&amp;gt;; the growth rate of &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; is sometimes informally written as &amp;lt;math&amp;gt;f_{\operatorname{PTO}(Z_\omega)}(n)&amp;lt;/math&amp;gt;, though no fundamental sequence has yet been defined for all ordinals under &amp;lt;math&amp;gt;\operatorname{PTO}(Z_\omega)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
The simplicity of CoC and &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; has been utilized to show the following bounds for certain busy beaver values:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(1797) &amp;gt; D^5(99)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{S}(1015) &amp;gt; D^5(99)&amp;lt;/math&amp;gt;&amp;lt;ref&amp;gt;CatsAreFluffy, &amp;quot;[https://github.com/CatsAreFluffy/metamath-turing-machines/commit/85948b04fc4aeb983ca6d63d6aee5ad6ef308bfe metamath-turing-machines]&amp;quot;. GitHub commit (September 2024). Accessed 7 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An even stronger but simpler function, &amp;lt;math&amp;gt;q(n)&amp;lt;/math&amp;gt;, has been derived from the structure of [[wikipedia:Rank-into-rank_cardinal|&amp;lt;math&amp;gt;\operatorname{I3}&amp;lt;/math&amp;gt;]] elementary embeddings, though it is unknown if this function can be shown to be total in &amp;lt;math&amp;gt;\operatorname{ZFC}&amp;lt;/math&amp;gt; alone, and whether it grows faster than the aforementioned &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt;. It is used in the following (conjectured) bounds:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(201) &amp;gt; q(5)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{S}(67) &amp;gt; q^{81}(q(5) - 2)&amp;lt;/math&amp;gt;&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1331570843829932063/1339669138510970881&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;racheline, &amp;quot;[https://wiki.bbchallenge.org/wiki/Talk:Champions Larger Champions]&amp;quot;. bbchallenge wiki talk post edit (February 2025). Accessed 7 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Resources ==&lt;br /&gt;
The Googology wiki hosts good information on methods of describing large numbers or large upper bounds for numbers.&lt;br /&gt;
&lt;br /&gt;
* https://googology.miraheze.org/wiki/Main_Page&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
[[Category:Stub]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Measuring_large_numbers&amp;diff=10265</id>
		<title>Measuring large numbers</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Measuring_large_numbers&amp;diff=10265"/>
		<updated>2026-11-05T06:42:25Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Scientific notation */ Tidy up sci notation section&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Stub}}&lt;br /&gt;
The busy beaver functions are known to grow faster than any computable function, as do many of their variants. Because of this, values of the function, or lower bounds on the function can be very, very large, so it is tempting to find ways of representing these numbers; this article will cover these methods.&lt;br /&gt;
&lt;br /&gt;
Paradoxically, although the Kolgomorov complexity of stating &amp;quot;The runtime of program X&amp;quot; to define the runtime of program X is typically very low, it is often not useful as it does not give us good information on the size of the number. Informally, more &amp;quot;natural&amp;quot; or &amp;quot;combinatorial&amp;quot; ways of measuring large numbers are desired which allow us to relatively compare the rough &amp;quot;ballparks&amp;quot; of the numbers&#039; scales. Tools like Knuth&#039;s up-arrow notation can help us achieve this, as well as more powerful methods such as [[Fast-Growing Hierarchy|fast-growing hierarchy]] or the diagonalization of an axiomatic foundation of mathematics.&lt;br /&gt;
&lt;br /&gt;
== Scientific notation ==&lt;br /&gt;
Scientific notation is one of the most common ways of representing large numbers; numbers written in standard scientific notation symbolically consist of a multiplicand (taking a value between 1 and the base, though is sometimes omitted), a base (commonly 10) and an exponent (usually an integer, though sometimes takes non-integer values if the multiplicand is omitted).&lt;br /&gt;
&lt;br /&gt;
For example, &amp;lt;math&amp;gt;8.68 \cdot 10^6&amp;lt;/math&amp;gt; represents the number 8,680,000, whereas &amp;lt;math&amp;gt;6.022 \cdot 10^{23}&amp;lt;/math&amp;gt; represents the number 602,200,000,000,000,000,000,000. These numbers are often approximations (to some number of digits) or lower/upper bounds on the precise integer.&lt;br /&gt;
&lt;br /&gt;
Non-integer exponents are also often used to approximate. For example, &amp;lt;math&amp;gt;10^{7.67}&amp;lt;/math&amp;gt; representing a lower bound for the number 46,773,515.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Certain busy beaver values can most conveniently be represented using scientific notation; they include:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(3,3) &amp;gt; 1.1912 \cdot 10^{17}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BBf}(23) &amp;gt; 4.3932 \cdot 10^{124}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(38) &amp;gt; 1.0017 \cdot 10^{19,729}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
When representing even larger numbers using scientific notation, the exponent itself may also be represented using scientific notation. For example:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(2,5) &amp;gt; 10^{10^{10^{3,314,360}}}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Knuth&#039;s up-arrow notation ==&lt;br /&gt;
Knuth&#039;s up-arrow notation extends the sequence of recursive operators (i.e. addition, multiplication, exponentiation) to higher-order functions (e.g. tetration, pentation) which grow much more rapidly.&lt;br /&gt;
&lt;br /&gt;
Tetration, the operation following exponentiation in the sequence of &amp;quot;hyperoperators&amp;quot; is defined by:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;a \uparrow \uparrow b = \begin{cases}&lt;br /&gt;
    1, &amp;amp; \text{if } b = 0&lt;br /&gt;
    \\ a^{a \uparrow \uparrow (b - 1)}, &amp;amp; \text{otherwise.}&lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The lower bound for &amp;lt;math&amp;gt;S(2,5)&amp;lt;/math&amp;gt; can thus be more concisely (though more weakly) written as &amp;lt;math&amp;gt;S(2,5) &amp;gt; 10 \uparrow\uparrow 4&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Knuth&#039;s up-arrow notation generalizes this though the following formula (where an arrow with a superscript of n represents the operator indicated by n arrows):&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;a \uparrow^{n} b =\begin{cases}&lt;br /&gt;
     a^b, &amp;amp; \text{if } n = 1,&lt;br /&gt;
     \\ 1, &amp;amp; \text{if } n &amp;gt; 1 \text{ and } b = 0,&lt;br /&gt;
     \\ a \uparrow^{n - 1} (a \uparrow^{n} (b - 1)), &amp;amp; \text{otherwise.}&lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Larger busy beaver values represented using Knuth&#039;s up-arrow notation include:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(2,6) &amp;gt; 10 \uparrow \uparrow \uparrow 3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(4,3) &amp;gt; 10 \uparrow \uparrow \uparrow \uparrow 4&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(3,4) &amp;gt; 2 \uparrow^{15} 3&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;S(3,5) &amp;gt; 2 \uparrow^{2 \uparrow^{15} 3} 3&amp;lt;/math&amp;gt; &lt;br /&gt;
&lt;br /&gt;
[[Busy Beaver Challenge|bbchallenge]] uses a piecewise extension of tetration in order to write numbers of this scale more accurately:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;a \uparrow \uparrow b =\begin{cases}&lt;br /&gt;
     b + 1, &amp;amp; \text{if } b \leq 0,&lt;br /&gt;
     \\ a^{a \uparrow \uparrow (b - 1)}, &amp;amp; \text{otherwise.}&lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Note that when using this method, the function &amp;lt;math&amp;gt;10 \uparrow\uparrow x&amp;lt;/math&amp;gt;, and other functions similar to it, are not analytic functions; however, that requirement is unnecessary when using this method to represent large numbers. Additionally, methods of obtaining analytic hyperoperators are complex, typically involving Abel functions, Riemann mappings, or Jabotinsky matrices; this method forgoes this, allowing for the ease of calculation.&lt;br /&gt;
&lt;br /&gt;
In this format, the lower bound for &amp;lt;math&amp;gt;S(2,5)&amp;lt;/math&amp;gt; can instead be written as &amp;lt;math&amp;gt;S(2,5) &amp;gt; 10 \uparrow\uparrow 4.8142&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
In popular mathematics&amp;lt;!-- This is an oxymoron, as mathematics is not popular; please find a better way to state this. --&amp;gt;, Graham&#039;s number (&amp;lt;math&amp;gt;= g_{64}&amp;lt;/math&amp;gt;) is represented using the following recursive function involving Knuth&#039;s up-arrow notation:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;g_n = \begin{cases}&lt;br /&gt;
    3 \uparrow \uparrow \uparrow \uparrow 3, &amp;amp; \text{if }n = 1&lt;br /&gt;
    \\ 3 \uparrow^{g_{n - 1}} 3, &amp;amp; \text{otherwise.}&lt;br /&gt;
    \end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The Ackermann function &amp;lt;math&amp;gt;\operatorname{A}(n,n)&amp;lt;/math&amp;gt; grows at roughly the same rate as &amp;lt;math&amp;gt;2 \uparrow^{n} 3&amp;lt;/math&amp;gt;. It can be said to &amp;quot;diagonalize&amp;quot; across the hyperoperators, eventually dominating every single hyperoperator.&lt;br /&gt;
&lt;br /&gt;
== Fast-growing hierarchy ==&lt;br /&gt;
The fast-growing hierarchy uses the fundamental sequences of ordinals to define diagonalizations across previous functions in the hierarchy. Functions in the fast-growing hierarchy are written in the form &amp;lt;math&amp;gt;f_\alpha(n)&amp;lt;/math&amp;gt;, and are calculated according to three rules:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f_0(n) = n + 1&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f_{\alpha + 1}(n) = f_{\alpha}^n(n)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;f_{\alpha}(n) = f_{\alpha[n]}(n)&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; is a limit ordinal (i.e. not a successor of any ordinal, nor zero.)&lt;br /&gt;
&lt;br /&gt;
Usually, an ordinal &amp;lt;math&amp;gt;\lambda&amp;lt;/math&amp;gt; is first chosen, and then &amp;lt;math&amp;gt;f_\alpha&amp;lt;/math&amp;gt; is defined via to the clauses above for all ordinals &amp;lt;math&amp;gt;\alpha &amp;lt; \lambda&amp;lt;/math&amp;gt;. This requires a system of fundamental sequences to be fixed first, where for each limit ordinal &amp;lt;math&amp;gt;\alpha &amp;lt; \lambda&amp;lt;/math&amp;gt; the fundamental sequence of &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; is a sequence of ordinals which has a supremum of &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
It is suspected that in this wiki, and in most other spaces that deal with googology, the fundamental sequences described by Maksudov (2017){{Citation needed}} are used to define the fast-growing hierarchy.&lt;br /&gt;
&lt;br /&gt;
In this manner, the value of &amp;lt;math&amp;gt;S(3,5)&amp;lt;/math&amp;gt; can be more concisely (though more weakly) written as &amp;lt;math&amp;gt;S(3,5) &amp;gt; f_\omega(2 \uparrow^{15} 3)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Other busy beaver values that necessitate the use of the fast-growing hierarchy include:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(49) &amp;gt; f_{\omega + 1}\left(\frac{2 \uparrow \uparrow 6}{2}\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{S}(51) &amp;gt; f_{\varepsilon_0 + 1}(8)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(100) &amp;gt; f_{\psi_0(\Omega_\omega) + 1}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Defining fundamental sequences: ordinal notations and ordinal collapsing functions ===&lt;br /&gt;
Individually defining fundamental sequences for a transfinite number of ordinals may be less than ideal; thus, to define the fast-growing hierarchy effectively, ordinal notations, which define a computable mapping between sequences of symbols and ordinals can be used to define fundamental sequences instead. TODO&amp;lt;!-- somewhere in this section should mention&lt;br /&gt;
cantor form&lt;br /&gt;
primitive sequence system or kirby paris hydra&lt;br /&gt;
buccholz ocf and/or extension to p0(Lambda)&lt;br /&gt;
after that, go, be free. live. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Comparing FGH and BB ===&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Ordinal α !! Least m that BB(m) confirmed &amp;gt;= f&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt;(2) !! Least m that BB(m) confirmed &amp;gt;= f&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt;(3) !! Least m that BB(m) confirmed &amp;gt;= f&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt;(10)&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega&amp;lt;/math&amp;gt; (Cantor normal form)|| 3 || 6 || 7&amp;lt;ref&amp;gt;See {{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF}}.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega+1&amp;lt;/math&amp;gt;|| 7 || 8 || 10&amp;lt;ref&amp;gt;Jeff Ketchersid, &amp;quot;[https://github.com/jeff87654/busy-beaver/blob/main/BB10/1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LI0LC_0RG1LD_1RH1LG_1LC0RG_0LJ0LI_1RZ0LC.md A 10-state machine at level f_(ω+1)]&amp;quot;. Github file, October 2026. Accessed 17 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega+2&amp;lt;/math&amp;gt;|| 10 || 12 || 12&amp;lt;ref&amp;gt;Jeff Ketchersid, &amp;quot;[https://github.com/jeff87654/busy-beaver/blob/main/BB12/1RB1RA_1RI1RC_0LD1LG_0RE1LD_1LK1RF_1RG0RA_1RA0LH_1LG1LH_1RE0LJ_1LH1LI_1RZ0LL_0LH1LK.md M12: a 12-state machine at level f_(ω+2)]&amp;quot;. Github file, October 2026. Accessed 27 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega\times 2&amp;lt;/math&amp;gt;|| 10 || 14 || 20&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega^2&amp;lt;/math&amp;gt;|| 10 || 20 || 21&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega^\omega&amp;lt;/math&amp;gt;|| 10 || 29 || 31&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\omega^\omega+1&amp;lt;/math&amp;gt;|| 31 || 31 || 31&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\varepsilon_0&amp;lt;/math&amp;gt; (Epsilon ordinals)|| 10 || 31 || 51&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1026577255754903572/1276881449685094495&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Sligocki, &amp;quot;[[Talk:Champions#BB(51)_epsilon_0_champion|BB(51) epsilon_0 champion]]&amp;quot;. bbchallenge wiki talk page edit, September 2024. Accessed 7 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\varphi(\omega , 0)&amp;lt;/math&amp;gt; (Veblen&#039;s phi function)|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\Omega_2)&amp;lt;/math&amp;gt; (Buchholz&#039;s psi function)|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\Omega_\omega)&amp;lt;/math&amp;gt;|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\varepsilon_{\Omega_\omega+1})&amp;lt;/math&amp;gt;|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;\psi_0(\Omega_{\Omega_{\Omega_{...}}})&amp;lt;/math&amp;gt;|| || ||&lt;br /&gt;
|-&lt;br /&gt;
| &amp;lt;math&amp;gt;lim(BMS)&amp;lt;/math&amp;gt; (Bashicu matrix system)|| || || 150&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Theories ==&lt;br /&gt;
The proof-theoretic ordinal of a theory is defined as supremum of the order types of all ordinal notations that can be shown to be well-founded within the theory.&lt;br /&gt;
&lt;br /&gt;
Some examples of proof theoretical ordinals include &amp;lt;math&amp;gt;\operatorname{PTO}(Q) = \omega&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\operatorname{PTO}(PA) = \varepsilon_0&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;\operatorname{PTO}(\operatorname{KP}) = \psi_0(\varepsilon_{\Omega+1})&amp;lt;/math&amp;gt;. Here Q is [[wikipedia:Robinson_arithmetic|Robinson arithmetic]], PA is Peano Arithmetic, and KP is Kripke-Platek set theory. &lt;br /&gt;
&lt;br /&gt;
Determination of the proof theoretic ordinal of second order arithmetic has been claimed in two preprints, one of which is a work-in-progress,&amp;lt;ref&amp;gt;T. Arai, &amp;quot;[https://arxiv.org/abs/2311.12459 An ordinal analysis of &amp;lt;math&amp;gt;\Pi_n&amp;lt;/math&amp;gt;-Collection]&amp;quot; (2023). Accessed 8 October 2026.&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;H. Towsner, &amp;quot;[https://arxiv.org/abs/2403.17922 Proofs that Modify Proofs]&amp;quot; (2024). Accessed 8 October 2026.&amp;lt;/ref&amp;gt; and is known to vastly exceed that of &amp;lt;math&amp;gt;\operatorname{KP}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
They can be used to compare the strength of different theories, as well as (by definition) an indicator as to which ordinal notations (or functions that are derived from ordinal notations) cannot be shown to be well-founded (or total) in a theory.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
A notable example of a theory which is directly used to create fast growing functions is the Calculus of Constructions (CoC), which has a proof-theoretic ordinal greater than that of any nth order arithmetic (&amp;lt;math&amp;gt;Z_n&amp;lt;/math&amp;gt;); well-formed statements in CoC can also be easily detected, and are strongly normalizing (TODO: explain what that means in this context).&lt;br /&gt;
&lt;br /&gt;
CoC yields the fast growing function &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; (defined by Ralph Loader in 2001 to create the eponymous Loader&#039;s number = &amp;lt;math&amp;gt;D^5(99)&amp;lt;/math&amp;gt;), which computes something similar to (but larger than) &amp;quot;The largest number \(x\) such that there is a &amp;lt;math&amp;gt;\Sigma^0_1&amp;lt;/math&amp;gt; formula &amp;lt;math&amp;gt;\phi(x)&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;\phi(x)&amp;lt;/math&amp;gt; is true and &amp;lt;math&amp;gt;\exists x\phi(x)&amp;lt;/math&amp;gt; is provable in CoC with a proof of length \(\leq \log_2 n\)&amp;quot;.&amp;lt;ref&amp;gt;R. Loader, &amp;quot;[https://raw.githubusercontent.com/rcls/busy/master/README.txt busy]&amp;quot;. GitHub repository (2003). Accessed 7 October 2026.&amp;lt;/ref&amp;gt; &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; outgrows all recursive functions provably total in &amp;lt;math&amp;gt;Z_\omega&amp;lt;/math&amp;gt;; the growth rate of &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; is sometimes informally written as &amp;lt;math&amp;gt;f_{\operatorname{PTO}(Z_\omega)}(n)&amp;lt;/math&amp;gt;, though no fundamental sequence has yet been defined for all ordinals under &amp;lt;math&amp;gt;\operatorname{PTO}(Z_\omega)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
The simplicity of CoC and &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt; has been utilized to show the following bounds for certain busy beaver values:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(1797) &amp;gt; D^5(99)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{S}(1015) &amp;gt; D^5(99)&amp;lt;/math&amp;gt;&amp;lt;ref&amp;gt;CatsAreFluffy, &amp;quot;[https://github.com/CatsAreFluffy/metamath-turing-machines/commit/85948b04fc4aeb983ca6d63d6aee5ad6ef308bfe metamath-turing-machines]&amp;quot;. GitHub commit (September 2024). Accessed 7 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
An even stronger but simpler function, &amp;lt;math&amp;gt;q(n)&amp;lt;/math&amp;gt;, has been derived from the structure of [[wikipedia:Rank-into-rank_cardinal|&amp;lt;math&amp;gt;\operatorname{I3}&amp;lt;/math&amp;gt;]] elementary embeddings, though it is unknown if this function can be shown to be total in &amp;lt;math&amp;gt;\operatorname{ZFC}&amp;lt;/math&amp;gt; alone, and whether it grows faster than the aforementioned &amp;lt;math&amp;gt;D(n)&amp;lt;/math&amp;gt;. It is used in the following (conjectured) bounds:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{BB\lambda}(201) &amp;gt; q(5)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\operatorname{S}(67) &amp;gt; q^{81}(q(5) - 2)&amp;lt;/math&amp;gt;&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1331570843829932063/1339669138510970881&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;racheline, &amp;quot;[https://wiki.bbchallenge.org/wiki/Talk:Champions Larger Champions]&amp;quot;. bbchallenge wiki talk post edit (February 2025). Accessed 7 October 2026.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Resources ==&lt;br /&gt;
The Googology wiki hosts good information on methods of describing large numbers or large upper bounds for numbers.&lt;br /&gt;
&lt;br /&gt;
* https://googology.miraheze.org/wiki/Main_Page&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
[[Category:Stub]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Pebble_Automaton&amp;diff=10242</id>
		<title>Pebble Automaton</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Pebble_Automaton&amp;diff=10242"/>
		<updated>2026-11-04T20:56:13Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: I think we can be more direct about this&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Stub}}&lt;br /&gt;
A pebble automaton is a type of [[cellular automaton]] introduced by AlephSquirrel, based on a Codeforces problem, also called Pebble Automaton.&amp;lt;ref&amp;gt;https://codeforces.com/gym/106465/problem/B&amp;lt;/ref&amp;gt; Each cell contains a non-negative number of pebbles, and the number of pebbles in the cell determines how many pebbles to push to each neighbor. Though in the original problem, the behavior of a cell also depended on the cell&#039;s location, the cellular automaton removes this dependence. Investigation so far has primarily focused on 1-dimensional pebble automata, but multi-dimensional pebble automata could be considered.&lt;br /&gt;
&lt;br /&gt;
Pebble automata have been informally shown to be [[Turing-complete]] via a reduction to 2-register [[Register machine|Register machines]].&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1535695107448381591/1567607590970458274&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Definition ==&lt;br /&gt;
A 1D pebble automaton is defined by three integer functions L(n), S(n) and R(n), defined over non-negative integers n, under the constraints:&lt;br /&gt;
&lt;br /&gt;
* L(n) ≥ 0&lt;br /&gt;
* S(n) ≥ 0&lt;br /&gt;
* R(n) ≥ 0&lt;br /&gt;
* L(n) + S(n) + R(n) = n for all n&lt;br /&gt;
&lt;br /&gt;
A simulation of a pebble automaton is represented by p(x, t), the number of pebbles at position x and time t. The initial configuration (t=0) has all n pebbles at x=0 and each generation, the pebbles are moved around according to the L, S, R rules:&lt;br /&gt;
&lt;br /&gt;
* p(0, 0) = n&lt;br /&gt;
* p(x, 0) = 0 for x ≠ 0&lt;br /&gt;
* p(x, t+1) = R(p(x-1, t)) + S(p(x,t)) + L(p(x+1, t))&lt;br /&gt;
&lt;br /&gt;
Informally, when a cell has n pebbles, it pushes L(n) to its left neighbor, R(n) to its right neighbor and S(n) stay.&lt;br /&gt;
&lt;br /&gt;
Because the number of pebbles is preserved in each row, the maximum number of pebbles in one location is n. Therefore, a pebble automaton only needs to specify the function values up to n.&lt;br /&gt;
&lt;br /&gt;
== Busy Beaver function ==&lt;br /&gt;
We say a pebble automaton has stabilized if no pebbles are moving; for any k in the configuration, L(k) = R(k) = 0.&lt;br /&gt;
&lt;br /&gt;
Let us define peBBle(n) as the maximum number of steps it takes for any pebble automaton to stabilize, starting from an initial state of n pebbles in a single cell.&lt;br /&gt;
&lt;br /&gt;
Notation (long version): &amp;lt;code&amp;gt;&amp;lt;nowiki&amp;gt;n --&amp;gt; L(n) | S(n) | R(n)&amp;lt;/nowiki&amp;gt;&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;0 --&amp;gt; 0 | 0 | 0&amp;lt;/code&amp;gt; is omitted since it is forced by the definition.&lt;br /&gt;
&lt;br /&gt;
The short version sets the rules in increasing order, separated by underscores, and removes &amp;lt;code&amp;gt;S(n)&amp;lt;/code&amp;gt; since it can be obtained with the equation &amp;lt;code&amp;gt;S(N) = n - L(n) - R(n)&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If there are over 10 pebbles, lowercase letters are used for numbers greater than 9 (a=10, b=11, etc.)&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!peBBle(n)&lt;br /&gt;
!Champion&lt;br /&gt;
|-&lt;br /&gt;
|1&lt;br /&gt;
|= 0&lt;br /&gt;
|&amp;lt;code&amp;gt;00&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|2&lt;br /&gt;
|= 1&lt;br /&gt;
|&amp;lt;code&amp;gt;00_01&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|3&lt;br /&gt;
|= 3&lt;br /&gt;
|&amp;lt;code&amp;gt;00_01_20&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|4&lt;br /&gt;
|= 6&lt;br /&gt;
|&amp;lt;code&amp;gt;00_01_20_03&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|5&lt;br /&gt;
|= 11&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_04&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|6&lt;br /&gt;
|= 17&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_40_15&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|7&lt;br /&gt;
|= 28&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_10_33_61&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|8&lt;br /&gt;
|= 63&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_50_30_24_70&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|9&lt;br /&gt;
|= 63,577&lt;br /&gt;
|&amp;lt;code&amp;gt;00_02_01_40_14_12_00_52_81&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|10&lt;br /&gt;
|= 5,778&lt;br /&gt;
|&amp;lt;code&amp;gt;00_02_01_40_14_12_00_17_63_18&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|11&lt;br /&gt;
|≥ 810,626,821&lt;br /&gt;
|&amp;lt;code&amp;gt;00_00_30_40_12_51_07_20_41_12_19&amp;lt;/code&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Analysis ==&lt;br /&gt;
&lt;br /&gt;
=== peBBle(5) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
.5.....&lt;br /&gt;
.14....&lt;br /&gt;
.311...&lt;br /&gt;
..41...&lt;br /&gt;
.212...&lt;br /&gt;
1.3.1..&lt;br /&gt;
1..31..&lt;br /&gt;
1...4..&lt;br /&gt;
1..211.&lt;br /&gt;
1.1.21.&lt;br /&gt;
1.11.2.&lt;br /&gt;
1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(6) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
...6.....&lt;br /&gt;
..1.5....&lt;br /&gt;
..141....&lt;br /&gt;
..312....&lt;br /&gt;
...5.1...&lt;br /&gt;
..41.1...&lt;br /&gt;
.212.1...&lt;br /&gt;
1.3.11...&lt;br /&gt;
1..311...&lt;br /&gt;
1...41...&lt;br /&gt;
1..212...&lt;br /&gt;
1.1.3.1..&lt;br /&gt;
1.1..31..&lt;br /&gt;
1.1...4..&lt;br /&gt;
1.1..211.&lt;br /&gt;
1.1.1.21.&lt;br /&gt;
1.1.11.2.&lt;br /&gt;
1.1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(7) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
..7.......&lt;br /&gt;
.6.1......&lt;br /&gt;
3.31......&lt;br /&gt;
.3.4......&lt;br /&gt;
..511.....&lt;br /&gt;
.1411.....&lt;br /&gt;
.3121.....&lt;br /&gt;
..5.2.....&lt;br /&gt;
.141.1....&lt;br /&gt;
.312.1....&lt;br /&gt;
..5.11....&lt;br /&gt;
.14.11....&lt;br /&gt;
.31111....&lt;br /&gt;
..4111....&lt;br /&gt;
.21211....&lt;br /&gt;
1.3.21....&lt;br /&gt;
1..4.2....&lt;br /&gt;
1.212.1...&lt;br /&gt;
11.3.11...&lt;br /&gt;
11..311...&lt;br /&gt;
11...41...&lt;br /&gt;
11..212...&lt;br /&gt;
11.1.3.1..&lt;br /&gt;
11.1..31..&lt;br /&gt;
11.1...4..&lt;br /&gt;
11.1..211.&lt;br /&gt;
11.1.1.21.&lt;br /&gt;
11.1.11.2.&lt;br /&gt;
11.1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(8) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
.....8............&lt;br /&gt;
....71............&lt;br /&gt;
...215............&lt;br /&gt;
..1.7.............&lt;br /&gt;
..1214............&lt;br /&gt;
..2.411...........&lt;br /&gt;
.1.3121...........&lt;br /&gt;
.1..5.2...........&lt;br /&gt;
.1.5.1.1..........&lt;br /&gt;
.15..1.1..........&lt;br /&gt;
.6...1.1..........&lt;br /&gt;
33...1.1..........&lt;br /&gt;
.33..1.1..........&lt;br /&gt;
..33.1.1..........&lt;br /&gt;
...331.1..........&lt;br /&gt;
....34.1..........&lt;br /&gt;
....2411..........&lt;br /&gt;
...12221..........&lt;br /&gt;
...21212..........&lt;br /&gt;
..1.3.3.1.........&lt;br /&gt;
..1..3.31.........&lt;br /&gt;
..1...3.4.........&lt;br /&gt;
..1....511........&lt;br /&gt;
..1...5.11........&lt;br /&gt;
..1..5..11........&lt;br /&gt;
..1.5...11........&lt;br /&gt;
..15....11........&lt;br /&gt;
..6.....11........&lt;br /&gt;
.33.....11........&lt;br /&gt;
..33....11........&lt;br /&gt;
...33...11........&lt;br /&gt;
....33..11........&lt;br /&gt;
.....33.11........&lt;br /&gt;
......3311........&lt;br /&gt;
.......341........&lt;br /&gt;
.......242........&lt;br /&gt;
......12311.......&lt;br /&gt;
......2.141.......&lt;br /&gt;
.....1.1312.......&lt;br /&gt;
.....1.1.5.1......&lt;br /&gt;
.....1.15..1......&lt;br /&gt;
.....1.6...1......&lt;br /&gt;
.....133...1......&lt;br /&gt;
.....1.33..1......&lt;br /&gt;
.....1..33.1......&lt;br /&gt;
.....1...331......&lt;br /&gt;
.....1....34......&lt;br /&gt;
.....1....241.....&lt;br /&gt;
.....1...1222.....&lt;br /&gt;
.....1...21211....&lt;br /&gt;
.....1..1.3.21....&lt;br /&gt;
.....1..1..4.2....&lt;br /&gt;
.....1..1.212.1...&lt;br /&gt;
.....1..11.3.11...&lt;br /&gt;
.....1..11..311...&lt;br /&gt;
.....1..11...41...&lt;br /&gt;
.....1..11..212...&lt;br /&gt;
.....1..11.1.3.1..&lt;br /&gt;
.....1..11.1..31..&lt;br /&gt;
.....1..11.1...4..&lt;br /&gt;
.....1..11.1..211.&lt;br /&gt;
.....1..11.1.1.21.&lt;br /&gt;
.....1..11.1.11.2.&lt;br /&gt;
.....1..11.1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(9) ===&lt;br /&gt;
The champion performs a [[Collatz-like]] function.&lt;br /&gt;
&lt;br /&gt;
Analysis:&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;text&amp;quot;&amp;gt;&lt;br /&gt;
A(n) := 6 0^n 3&lt;br /&gt;
B(n) := 6 0^n 21&lt;br /&gt;
&lt;br /&gt;
A(3k+1) -(20k+12)-&amp;gt; B(11k+5)&lt;br /&gt;
A(3k+2) -(8k+7)---&amp;gt; HALT&lt;br /&gt;
A(3k+3) -(20k+26)-&amp;gt; B(11k+12)&lt;br /&gt;
&lt;br /&gt;
B(3k)   -(8k+3)---&amp;gt; HALT&lt;br /&gt;
B(3k+1) -(20k+16)-&amp;gt; A(11k+7)&lt;br /&gt;
B(3k+2) -(20k+22)-&amp;gt; A(11k+11)&lt;br /&gt;
&lt;br /&gt;
9 -(8)-&amp;gt; B(4) -(36)-&amp;gt; A(18) -(126)-&amp;gt; B(67) -(456)-&amp;gt; A(249) -(1666)-&amp;gt; B(914) -(6102)-&amp;gt; A(3355) -(22372)-&amp;gt; B(12303) -(32811)-&amp;gt; HALT&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
&lt;br /&gt;
No cryptids have been found through exhaustive search, but there have been cryptids created by hand.&lt;br /&gt;
&lt;br /&gt;
A 12 pebble automaton has been created that is modeled by a [[Piecewise Affine Function]], similar to [[BMO1]]:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
00_00_00_40_10_00_00_08_41_11_00_a1&lt;br /&gt;
&lt;br /&gt;
Let A(u,v) := 1 0^(u-2) a 0^(v-1) 1&lt;br /&gt;
&lt;br /&gt;
A(u,v) -&amp;gt; A(4u-1, v-u) if u&amp;lt;v&lt;br /&gt;
A(u,v) -&amp;gt; A(u-v, 4v+1) if u&amp;gt;v+1&lt;br /&gt;
A(u,v) -&amp;gt; halt         if u=v or u=v+1&lt;br /&gt;
&lt;br /&gt;
start: A(3,1)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
An 86 pebble automaton has been produced by hand to display [[Hydra]]-like behavior:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1 --&amp;gt; 0 | 1 | 0&lt;br /&gt;
2 --&amp;gt; 0 | 0 | 2&lt;br /&gt;
3 --&amp;gt; 0 | 0 | 3&lt;br /&gt;
5 --&amp;gt; 0 | 0 | 5&lt;br /&gt;
6 --&amp;gt; 0 | 6 | 0&lt;br /&gt;
7 --&amp;gt; 0 | 1 | 6&lt;br /&gt;
8 --&amp;gt; 0 | 2 | 6&lt;br /&gt;
9 --&amp;gt; 9 | 0 | 0&lt;br /&gt;
12 --&amp;gt; 12 | 0 | 0&lt;br /&gt;
14 --&amp;gt; 0 | 14 | 0&lt;br /&gt;
15 --&amp;gt; 6 | 9 | 0&lt;br /&gt;
17 --&amp;gt; 17 | 0 | 0&lt;br /&gt;
24 --&amp;gt; 0 | 24 | 0&lt;br /&gt;
25 --&amp;gt; 0 | 2 | 23&lt;br /&gt;
26 --&amp;gt; 0 | 1 | 25&lt;br /&gt;
27 --&amp;gt; 24 | 3 | 0&lt;br /&gt;
28 --&amp;gt; 26 | 2 | 0&lt;br /&gt;
29 --&amp;gt; 27 | 2 | 0&lt;br /&gt;
30 --&amp;gt; 27 | 3 | 0&lt;br /&gt;
32 --&amp;gt; 0 | 32 | 0&lt;br /&gt;
33 --&amp;gt; 0 | 33 | 0&lt;br /&gt;
35 --&amp;gt; 0 | 2 | 33&lt;br /&gt;
38 --&amp;gt; 0 | 3 | 35&lt;br /&gt;
39 --&amp;gt; 0 | 0 | 39&lt;br /&gt;
40 --&amp;gt; 0 | 0 | 40&lt;br /&gt;
41 --&amp;gt; 1 | 40 | 0&lt;br /&gt;
45 --&amp;gt; 0 | 39 | 6&lt;br /&gt;
78 --&amp;gt; 0 | 0 | 78&lt;br /&gt;
79 --&amp;gt; 0 | 79 | 0&lt;br /&gt;
84 --&amp;gt; 24 | 15 | 45&lt;br /&gt;
86 --&amp;gt; 1 | 1 | 84&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
It may be interpreted in the following way:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let C(x, y) = $ 1 0^y 1 0^x 84 $&lt;br /&gt;
C(2k, y) --&amp;gt; C(7k + 3, y + 2)&lt;br /&gt;
C(2k + 1, y + 1) --&amp;gt; C(7k + 10, y)&lt;br /&gt;
C(2k + 1, 0) --&amp;gt; HALT&lt;br /&gt;
&lt;br /&gt;
$$ --&amp;gt; C(0, 0) --&amp;gt; C(3, 2) --&amp;gt; C(17, 1) --&amp;gt; C(66, 0) --&amp;gt; C(234, 2)...&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Other notable machines ==&lt;br /&gt;
=== Golems ===&lt;br /&gt;
The &amp;quot;golems&amp;quot; are a group of 22 holdouts in peBBle(11). They appear to be modeled by complex systems of equations, making them potential Cryptids. Discord user Sheep noted that they can be categorized into 7 unique &amp;quot;paths&amp;quot;&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1535695107448381591/1566012271719616573&amp;lt;/ref&amp;gt;, though the details may differ on how they behave if they encounter an improbable position.&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1535695107448381591/1566013254764073081&amp;lt;/ref&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ Golems text&lt;br /&gt;
|-&lt;br /&gt;
! Golem no. !! Machine !! Note&lt;br /&gt;
|-&lt;br /&gt;
| #1 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_71_17_--_18&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #2 || &amp;lt;code&amp;gt;00_00_30_10_41_06_31_15_08_--_19&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #3 || &amp;lt;code&amp;gt;00_00_03_31_11_60_21_16_54_--_19&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #4 || &amp;lt;code&amp;gt;00_00_30_10_02_06_31_17_08_--_45&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #5 || &amp;lt;code&amp;gt;00_00_30_10_02_06_31_17_18_--_45&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #6 || &amp;lt;code&amp;gt;00_00_30_10_41_06_31_15_08_--_14&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #7 || &amp;lt;code&amp;gt;00_00_30_10_02_06_31_07_--_17_1a&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #8 || &amp;lt;code&amp;gt;00_00_30_10_41_06_21_15_--_18_1a&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #9 || &amp;lt;code&amp;gt;00_00_30_10_41_06_31_15_--_18_1a&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #10 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_80_--_19&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #11 || &amp;lt;code&amp;gt;00_00_03_01_20_60_13_70_--_71_44&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #12 || &amp;lt;code&amp;gt;00_00_03_01_14_60_12_51_--_81_44&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #13 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_--_81_44&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #14 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_--_81_15&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #15 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_80_--_16&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #16 || &amp;lt;code&amp;gt;00_00_03_01_14_60_12_51_--_81_35&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #17 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_--_81_35&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #18 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_--_81_22&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #19 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_51_--_81_24&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #20 || &amp;lt;code&amp;gt;00_00_30_10_41_06_31_15_08_--_11&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #21 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_71_52_--_28&amp;lt;/code&amp;gt; || &lt;br /&gt;
|-&lt;br /&gt;
| #22 || &amp;lt;code&amp;gt;00_00_03_01_14_60_13_71_71_--_28&amp;lt;/code&amp;gt; || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Sources ==&lt;br /&gt;
&lt;br /&gt;
* Discord thread: https://discord.com/channels/960643023006490684/1535695107448381591&lt;br /&gt;
&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== External resources ==&lt;br /&gt;
&lt;br /&gt;
* [https://gist.github.com/AlephSquirrel/9ada4b14b675d18fe8755b200b20509d Uiua simulator]&lt;br /&gt;
* [https://github.com/AzertyWasTaken/Busy-Beaver/tree/main/Pebble%20Automaton Enumerator GitHub repo]&lt;br /&gt;
* [https://azertywastaken.github.io/Busy-Beaver/Website/pebble-automaton.html Simulator website]&lt;br /&gt;
&lt;br /&gt;
[[Category:Functions]]&lt;br /&gt;
[[Category:Stubs]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Beaver_Math_Olympiad&amp;diff=10176</id>
		<title>Beaver Math Olympiad</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Beaver_Math_Olympiad&amp;diff=10176"/>
		<updated>2026-11-04T02:51:20Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Note BMO12 preliminary solution.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Beaver Mathematical Olympiad&#039;&#039;&#039; (BMO) is an attempt to re-formulate the halting problem for some particular Turing machines as a mathematical problem in a style suitable for a hypothetical math olympiad. &lt;br /&gt;
&lt;br /&gt;
The purpose of the BMO is twofold. First, statements where non-essential details (related to tape encoding, number of steps, etc.) are discarded are more suitable to be shared with mathematicians who perhaps are able to help. Second, it&#039;s a way to jokingly highlight how a hard question could appear deceptively simple.&lt;br /&gt;
&lt;br /&gt;
BMO problems have been formalized in Lean and added to the DeepMind formal-conjectures database ([https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Other/BeaverMathOlympiad.lean Github]).&lt;br /&gt;
&lt;br /&gt;
== Unsolved problems ==&lt;br /&gt;
&lt;br /&gt;
=== 1. {{TM|1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0LB0LE|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 1}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;(b_n)_{n \ge 1}&amp;lt;/math&amp;gt; be two sequences such that &amp;lt;math&amp;gt;(a_1, b_1) = (1, 2)&amp;lt;/math&amp;gt; and&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;(a_{n+1}, b_{n+1}) = \begin{cases}&lt;br /&gt;
(a_n-b_n, 4b_n+2) &amp;amp; \text{if }a_n \ge b_n \\&lt;br /&gt;
(2a_n+1, b_n-a_n) &amp;amp; \text{if }a_n &amp;lt; b_n&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for all positive integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Does there exist a positive integer &amp;lt;math&amp;gt;i&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;a_i = b_i&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
The first 10 values of &amp;lt;math&amp;gt;(a_n, b_n)&amp;lt;/math&amp;gt; are &amp;lt;math&amp;gt;(1, 2), (3, 1), (2, 6), (5, 4), (1, 18), (3, 17), (7, 14), (15, 7), (8, 30), (17, 22)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 2. [[Hydra]] and [[Antihydra]] ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 0}&amp;lt;/math&amp;gt; be a sequence such that &amp;lt;math&amp;gt;a_{n+1} = a_n+\left\lfloor\frac{a_n}{2}\right\rfloor&amp;lt;/math&amp;gt; for all non-negative integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
# If &amp;lt;math&amp;gt;a_0=3&amp;lt;/math&amp;gt;, does there exist a non-negative integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that the list of numbers &amp;lt;math&amp;gt;a_0, a_1, a_2, \dots, a_k&amp;lt;/math&amp;gt; have more than twice as many even numbers as odd numbers? ([[Hydra]])&lt;br /&gt;
# If &amp;lt;math&amp;gt;a_0=8&amp;lt;/math&amp;gt;, does there exist a non-negative integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that the list of numbers &amp;lt;math&amp;gt;a_0, a_1, a_2, \dots, a_k&amp;lt;/math&amp;gt; have more than twice as many odd numbers as even numbers? ([[Antihydra]])&lt;br /&gt;
&lt;br /&gt;
=== 5. {{TM|1RB0LD_1LC0RA_1RA1LB_1LA1LE_1RF0LC_---0RE|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 1}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;(b_n)_{n \ge 1}&amp;lt;/math&amp;gt; be two sequences such that &amp;lt;math&amp;gt;(a_1, b_1) = (0, 5)&amp;lt;/math&amp;gt; and&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;(a_{n+1}, b_{n+1}) = \begin{cases}&lt;br /&gt;
(a_n+1, b_n-f(a_n)) &amp;amp; \text{if } b_n \ge f(a_n) \\&lt;br /&gt;
(a_n, 3b_n+a_n+5) &amp;amp; \text{if } b_n &amp;lt; f(a_n)&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;f(x)=10\cdot 2^x-1&amp;lt;/math&amp;gt; for all non-negative integers &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;. &lt;br /&gt;
&lt;br /&gt;
Does there exist a positive integer &amp;lt;math&amp;gt;i&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;b_i = f(a_i)-1&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
=== 6. [[Space Needle]] ===&lt;br /&gt;
Let &amp;lt;math&amp;gt;f(b) = b + k + 3a&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;a&amp;lt;/math&amp;gt; are non-negative integers satisfying &amp;lt;math&amp;gt;b = (2a+1)\cdot 2^k&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Now consider the iterated application of the function &amp;lt;math&amp;gt;f^{n+1}(b) = f(f^n(b))&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;f^0(b)=b&amp;lt;/math&amp;gt;. Does there exist a non-negative integer &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;f^n(6)&amp;lt;/math&amp;gt; equals a power of 2?&lt;br /&gt;
&lt;br /&gt;
=== 8. {{TM|1RB0LD_0RC1RB_0RD0RA_1LE0RD_1LF---_0LA1LA|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 1}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;(b_n)_{n \ge 1}&amp;lt;/math&amp;gt; be two sequences such that &amp;lt;math&amp;gt;(a_1, b_1) = (10, 12)&amp;lt;/math&amp;gt; and&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;(a_{n+1}, b_{n+1}) = \begin{cases}&lt;br /&gt;
(a_n-\left\lfloor\frac{b_n}{2}\right\rfloor-3, 3\left\lfloor\frac{b_n+1}{2}\right\rfloor+6) &amp;amp; \text{if }a_n &amp;gt; \left\lfloor\frac{b_n}{2}\right\rfloor \\&lt;br /&gt;
(3a_n+5, b_n-2a_n) &amp;amp; \text{if }a_n \le \left\lfloor\frac{b_n}{2}\right\rfloor&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for all positive integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Does there exist a positive integer &amp;lt;math&amp;gt;i&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;a_n = \left\lfloor \frac{b_n}{2} \right\rfloor + 1&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
=== 10. {{TM|1RB0LB_0RC0LD_1LD1RE_0LA0RF_0RD1RF_0RC---|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;\Sigma=\{0,1,\#\}&amp;lt;/math&amp;gt;.  Consider two-sided infinite words over &amp;lt;math&amp;gt;\Sigma&amp;lt;/math&amp;gt;.  The initial word is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
w^{(0)}=\cdots 10\#10\#10\#10\#0000\cdots,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
that is, a left-infinite repetition of &amp;lt;math&amp;gt;10\#&amp;lt;/math&amp;gt;, followed by a right-infinite tail of &amp;lt;math&amp;gt;0&amp;lt;/math&amp;gt;&#039;s.&lt;br /&gt;
&lt;br /&gt;
The rewrite rules are&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#0 \to 1,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#100 \to 000\#,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#110 \to 000\#,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#1010 \to 1010\#\#.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A rewrite step consists of choosing any occurrence of the left-hand side of one of these rules in the current word and replacing it by the corresponding right-hand side.  The&lt;br /&gt;
occurrence may be chosen arbitrarily; there is no prescribed reduction order.&lt;br /&gt;
&lt;br /&gt;
At any stage, call a symbol &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; active if it is the leftmost symbol of an occurrence of one of the four left-hand sides above.  Equivalently, a &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; is&lt;br /&gt;
active if the word beginning at that &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; starts with one of&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#0,\qquad \#100,\qquad \#110,\qquad \#1010.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The question is whether there exists some finite sequence of rewrite steps, starting from &amp;lt;math&amp;gt;w^{(0)}&amp;lt;/math&amp;gt;, after which the rightmost occurrence of &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; is not&lt;br /&gt;
active.  In other words, does there exist a rewrite order such that the rightmost &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; can no longer be rewritten?&lt;br /&gt;
&lt;br /&gt;
=== 11. {{TM|1RB0LD_0LC0RE_1LA0RD_0RB0LC_1RC1RF_0LD---|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;\Sigma=\{0,1,\#\}&amp;lt;/math&amp;gt;.  Consider two-sided infinite words over &amp;lt;math&amp;gt;\Sigma&amp;lt;/math&amp;gt;.  The initial word is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
w^{(0)}=\cdots 10\#10\#10\#10\#0000\cdots,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
that is, a left-infinite repetition of &amp;lt;math&amp;gt;10\#&amp;lt;/math&amp;gt;, followed by a right-infinite tail of &amp;lt;math&amp;gt;0&amp;lt;/math&amp;gt;&#039;s.&lt;br /&gt;
&lt;br /&gt;
The rewrite rules are&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#0 \to 1,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#100 \to 010\#,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#1010 \to 1010\#\#,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#10110 \to 10101,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#11 \to 10.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A rewrite step consists of choosing any occurrence of the left-hand side of one of these rules in the current word and replacing it by the corresponding right-hand side.  The&lt;br /&gt;
occurrence may be chosen arbitrarily; there is no prescribed reduction order.&lt;br /&gt;
&lt;br /&gt;
At any stage, call a symbol &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; active if it is the leftmost symbol of an occurrence of one of the five left-hand sides above.  Equivalently, a &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; is&lt;br /&gt;
active if the word beginning at that &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; starts with one of&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#0,\qquad \#100,\qquad \#1010,\qquad \#10110,\qquad \#11.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The question is whether there exists some finite sequence of rewrite steps, starting from &amp;lt;math&amp;gt;w^{(0)}&amp;lt;/math&amp;gt;, after which the rightmost occurrence of &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; is not&lt;br /&gt;
active.  In other words, does there exist a rewrite order such that the rightmost &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; can no longer be rewritten?&lt;br /&gt;
&lt;br /&gt;
=== 12. [[Fractran#Size 24: Energy Vampire|[2/15, 1/6, 441/2, 11/3, 25/7, 6/11]]] ===&lt;br /&gt;
Let &amp;lt;math&amp;gt;(h_n)_{n \ge 1}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;(w_n)_{n \ge 1}&amp;lt;/math&amp;gt; be two sequences such that &amp;lt;math&amp;gt;(h_1, w_1) = (1, 2)&amp;lt;/math&amp;gt; and&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;h_{n+1} = \left\lceil \frac{8 h_n}{3} \right\rceil&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;&lt;br /&gt;
w_{n+1} = \begin{cases}&lt;br /&gt;
  w_n - 1 &amp;amp; \text{if }h_n \equiv 0 \pmod{3} \\&lt;br /&gt;
  w_n     &amp;amp; \text{if }h_n \equiv 1 \pmod{3} \\&lt;br /&gt;
  w_n + 1 &amp;amp; \text{if }h_n \equiv 2 \pmod{3}&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for all positive integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Does there exist a positive integer &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;w_n = 0&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
Preliminary finding is that &amp;lt;math&amp;gt;w_{495141375730} = 0&amp;lt;/math&amp;gt;: https://discord.com/channels/960643023006490684/1438019511155691521/1565647448452636672. Waiting for confirmation.&lt;br /&gt;
&lt;br /&gt;
== Solved problems ==&lt;br /&gt;
&lt;br /&gt;
=== 3. {{TM|1RB0RB3LA4LA2RA_2LB3RA---3RA4RB|non-halt}} and {{TM|1RB1RB3LA4LA2RA_2LB3RA---3RA4RB|non-halt}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;v_2(n)&amp;lt;/math&amp;gt; be the largest integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;2^k&amp;lt;/math&amp;gt; divides &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Let &amp;lt;math&amp;gt;(a_n)_{n \ge 0}&amp;lt;/math&amp;gt; be a sequence such that&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;a_n = \begin{cases}&lt;br /&gt;
2 &amp;amp; \text{if } n=0 \\&lt;br /&gt;
a_{n-1}+2^{v_2(a_{n-1})+2}-1 &amp;amp; \text{if } n \ge 1&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for all non-negative integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Is there an integer &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;a_n=4^k&amp;lt;/math&amp;gt; for some positive integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
Link to Discord discussion: https://discord.com/channels/960643023006490684/1084047886494470185/1252634913220591728&lt;br /&gt;
&lt;br /&gt;
Formalised solution: [https://discord.com/channels/960643023006490684/1259770421046411285/1488737894943166604 Initial announcement], [https://discord.com/channels/960643023006490684/1259770421046411285/1488743526882738276 Lean proof], [https://discord.com/channels/960643023006490684/1259770421046411285/1488781537699696821 LLM-translated Rocq proof], [https://discord.com/channels/960643023006490684/1259770421046411285/1488898995865784442 Proof of closure of existing mid-level rules].&lt;br /&gt;
&lt;br /&gt;
=== 4. {{TM|1RB3RB---1LB0LA_2LA4RA3LA4RB1LB|non-halt}} ===&lt;br /&gt;
&lt;br /&gt;
Bonnie the beaver was bored, so she tried to construct a sequence of integers &amp;lt;math&amp;gt;\{a_n\}_{n \ge 0}&amp;lt;/math&amp;gt;. She first defined &amp;lt;math&amp;gt;a_0=2&amp;lt;/math&amp;gt;, then defined &amp;lt;math&amp;gt;a_{n+1}&amp;lt;/math&amp;gt; depending on &amp;lt;math&amp;gt;a_n&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; using the following rules:&lt;br /&gt;
&lt;br /&gt;
* If &amp;lt;math&amp;gt;a_n \equiv 0\text{ (mod 3)}&amp;lt;/math&amp;gt;, then &amp;lt;math&amp;gt;a_{n+1}=\frac{a_n}{3}+2^n+1&amp;lt;/math&amp;gt;.&lt;br /&gt;
* If &amp;lt;math&amp;gt;a_n \equiv 2\text{ (mod 3)}&amp;lt;/math&amp;gt;, then &amp;lt;math&amp;gt;a_{n+1}=\frac{a_n-2}{3}+2^n-1&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
With these two rules alone, Bonnie calculates the first few terms in the sequence: &amp;lt;math&amp;gt;2, 0, 3, 6, 11, 18, 39, 78, 155, 306, \dots&amp;lt;/math&amp;gt;. At this point, Bonnie plans to continue writing terms until a term becomes &amp;lt;math&amp;gt;1\text{ (mod 3)}&amp;lt;/math&amp;gt;. If Bonnie sticks to her plan, will she ever finish?&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Solution&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
How to guess the closed-form solution: Firstly, notice that &amp;lt;math&amp;gt;a_n \approx \frac{3}{5} \times 2^n&amp;lt;/math&amp;gt;. Secondly, calculate the error term &amp;lt;math&amp;gt;a_n - \frac{3}{5} \times 2^n&amp;lt;/math&amp;gt;. The error term appears to have a period of 4. This leads to the following guess:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;a_n=\frac{3}{5}\begin{cases}&lt;br /&gt;
2^n+\frac{7}{3} &amp;amp;\text{if } n\equiv 0 \pmod{4}\\&lt;br /&gt;
2^n-2 &amp;amp;\text{if } n\equiv 1 \pmod{4}\\&lt;br /&gt;
2^n+1 &amp;amp;\text{if } n\equiv 2 \pmod{4}\\&lt;br /&gt;
2^n+2 &amp;amp;\text{if } n\equiv 3 \pmod{4}&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This closed-form solution can be proven correct by induction. Unfortunately, the induction may require a lot of tedious calculations.&lt;br /&gt;
&lt;br /&gt;
For all &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt;, we have &amp;lt;math&amp;gt;a_{4k} \equiv 2\text{ (mod 3)}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;a_{4k+1} \equiv a_{4k+2} \equiv a_{4k+3} \equiv 0\text{ (mod 3)}&amp;lt;/math&amp;gt;. Therefore, Bonnie will never finish.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== 7. {{TM|1RB1RF_1RC0RA_1LD1RC_1LE0LE_0RA0LD_0RB---|non-halt}} ===&lt;br /&gt;
Let &amp;lt;math&amp;gt;v_2(n)&amp;lt;/math&amp;gt; be the largest integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;2^k&amp;lt;/math&amp;gt; divides &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;f(n) = n+1+(v_2(n+1) \bmod 2)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Now consider the iterated application of the function &amp;lt;math&amp;gt;f^{n+1}(b) = f(f^n(b))&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;f^0(b)=b&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 0}&amp;lt;/math&amp;gt; be a sequence such that &amp;lt;math&amp;gt;a_0=1&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;a_{n+1} = f^{n+2}\left(\left\lfloor\frac{a_n}{2}\right\rfloor\right)&amp;lt;/math&amp;gt; for all non-negative integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Does there exist a non-negative integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;a_k&amp;lt;/math&amp;gt; is even?&lt;br /&gt;
&lt;br /&gt;
(for simplicity, this question is slightly stronger than the halting problem of this TM)&lt;br /&gt;
&lt;br /&gt;
Link to Discord discussion: https://discord.com/channels/960643023006490684/1421782442213376000/1431483206208852001&lt;br /&gt;
&lt;br /&gt;
=== 9. {{TM|1RB1LA_1RC0RD_1LA---_1RE1RD_1LF0LA_---0LE|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;\mathbb{N}=\{0,1,2,\ldots\}&amp;lt;/math&amp;gt;.  Consider configurations given by infinite sequences of non-negative integers,&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\mathbb{N}^{\omega}&lt;br /&gt;
=&lt;br /&gt;
\{(x_0,x_1,x_2,\ldots): x_i\in\mathbb{N}\}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Define a partial transition map&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
T:\mathbb{N}^{\omega}\to \mathbb{N}^{\omega}\cup\{\mathrm{Halt}\}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
by the following rewrite rules.  For all &amp;lt;math&amp;gt;a,b,c\in\mathbb{N}&amp;lt;/math&amp;gt; and every infinite tail sequence &amp;lt;math&amp;gt;\mathbf r\in\mathbb{N}^{\omega}&amp;lt;/math&amp;gt;,&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(0,a,c,\mathbf r)\mapsto (3+a+c,\mathbf r),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(1,0,\mathbf r)\mapsto \mathrm{Halt},&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(1,1+a,c,\mathbf r)\mapsto (a,0,1,1+c,\mathbf r),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(2+a,b,c,\mathbf r)\mapsto (a,1+b,1+c,\mathbf r).&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The initial configuration is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\mathbf x^{(0)}=(0,0,0,0,\ldots).&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The question is whether the orbit of &amp;lt;math&amp;gt;\mathbf x^{(0)}&amp;lt;/math&amp;gt; under repeated application of &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt; eventually halts; that is, whether there exists some&lt;br /&gt;
&amp;lt;math&amp;gt;n\in\mathbb{N}&amp;lt;/math&amp;gt; such that&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
T(\mathbf x^{(n)})=\mathrm{Halt},&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\mathbf x^{(n+1)}=T(\mathbf x^{(n)})&amp;lt;/math&amp;gt; whenever the right-hand side is not &amp;lt;math&amp;gt;\mathrm{Halt}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
== Practice Problems ==&lt;br /&gt;
Problems that are not BMO-level, but provide counter-examples to certain [[probvious]] intuition:&lt;br /&gt;
&lt;br /&gt;
* {{TM|1RB0LE_1LC1RA_---1LD_0RB1LF_1RD1LA_0LA0RD}}&lt;br /&gt;
* {{TM|1RB0RD_0LC1RA_0RA1LB_1RE1LB_1LF1LB_---1LE}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Individual machines]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Register_machine&amp;diff=10030</id>
		<title>Register machine</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Register_machine&amp;diff=10030"/>
		<updated>2026-11-01T17:24:27Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* MBB(8): Space Needle variants */ Add historical info about Needles&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Register machines&#039;&#039;&#039;, also known as &#039;&#039;&#039;Minsky machines&#039;&#039;&#039;, are a [[Turing complete|Turing-complete]] model of computation.&lt;br /&gt;
&lt;br /&gt;
Register machines contain a set of instructions and a set of registers. The instructions are labelled A, B, C, and so on. The registers are numbered 0, 1, 2, and so on. There are 2 types of instructions:&lt;br /&gt;
&lt;br /&gt;
* inc(c, n) adds 1 to the register c then jumps to instruction n.&lt;br /&gt;
* dec(c, n, m) jumps to instruction m if register c equals 0, else subtract 1 to the register c then jump to instruction n.&lt;br /&gt;
&lt;br /&gt;
The program halts if it reaches an undefined instruction. Here we label an undefined instruction with &amp;lt;code&amp;gt;*&amp;lt;/code&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
== Register Busy Beaver ==&lt;br /&gt;
The Register Busy Beaver function, denoted MBB(n,r), returns the maximum number of instructions executed by a register machine with n instructions and r registers when started in instruction A and all registers initialized to 0. MBB(n) = MBB(n,n) (unlimited registers).&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Halting Time&lt;br /&gt;
!Champion&lt;br /&gt;
|-&lt;br /&gt;
|MBB(0)&lt;br /&gt;
|0&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|MBB(1)&lt;br /&gt;
|1&lt;br /&gt;
|&amp;lt;code&amp;gt;0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(2)&lt;br /&gt;
|3&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(3)&lt;br /&gt;
|5&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0-C*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(4)&lt;br /&gt;
|10&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1+C_0-BD_1-C*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(5)&lt;br /&gt;
|24&lt;br /&gt;
|&amp;lt;code&amp;gt;0-DB_0+C_1-ED_1+A_1-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(6)&lt;br /&gt;
|49&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1-FC_1+D_0-CE_0+A_1-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(7)&lt;br /&gt;
|231&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+D_1-GE_1+F_0-EC_1-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(8)&lt;br /&gt;
|≥ 3,394&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_1-GD_1+E_0-DF_2-HG_2+A_2-D*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(9)&lt;br /&gt;
|&amp;gt; 4.493 × 10&amp;lt;sup&amp;gt;74&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_1-HD_0-EG_0-FI_1+D_2+H_0+A_2-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(10)&lt;br /&gt;
|&amp;gt; 10↑↑4.03&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1-AC_2-ED_1+E_1+F_0-DG_2-JH_2+I_1-HE_2-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(11)&lt;br /&gt;
|&amp;gt; 10↑↑17.74&lt;br /&gt;
|&amp;lt;code&amp;gt;0-KB_1-IC_1+D_1+E_2-CF_0-AG_0+H_1-GI_2+J_2+B_0-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
The Register Sigma function, denoted MΣ(n,r), returns the maximum value in any register when a register machine with n instructions and r registers halting when started in instruction A and all registers initialized to 0. MΣ(n) = MΣ(n,n) (unlimited registers) = [[oeis:A081419|A081419]](n+1).&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Sigma&lt;br /&gt;
!Champion&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(0)&lt;br /&gt;
|0&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(1)&lt;br /&gt;
|1&lt;br /&gt;
|&amp;lt;code&amp;gt;0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(2)&lt;br /&gt;
|2&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(3)&lt;br /&gt;
|3&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(4)&lt;br /&gt;
|4&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+D_0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(5)&lt;br /&gt;
|6&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+D_1-*E_1+A&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(6)&lt;br /&gt;
|≥ 9&lt;br /&gt;
|&amp;lt;code&amp;gt;1+B_1+C_0+D_0+E_0+F_1-C*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(7)&lt;br /&gt;
|≥ 34&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+D_1-GE_1+F_0-EC_1-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(8)&lt;br /&gt;
|≥ 520&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1+C_2-AD_2+E_2+F_0-DG_1-H*_1-EB&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(9)&lt;br /&gt;
|&amp;gt; 2.64 × 10&amp;lt;sup&amp;gt;73&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_1-HD_0-EG_0-FI_1+D_2+H_0+A_2-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(10)&lt;br /&gt;
|&amp;gt; 10↑↑4.03&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1-AC_2-ED_1+E_1+F_0-DG_2-JH_2+I_1-HE_2-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MΣ(11)&lt;br /&gt;
|&amp;gt; 10↑↑17.74&lt;br /&gt;
|&amp;lt;code&amp;gt;0-KB_1-IC_1+D_1+E_2-CF_0-AG_0+H_1-GI_2+J_2+B_0-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Analysis ==&lt;br /&gt;
MBB(7):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(x) = A:[x, 0]&lt;br /&gt;
A(2x) -&amp;gt; 9x+20 -&amp;gt; A(3x+4)&lt;br /&gt;
A(2x+1) -&amp;gt; 9x+27 -&amp;gt; halt&lt;br /&gt;
&lt;br /&gt;
A(0) -&amp;gt; 20 -&amp;gt; A(4) -&amp;gt; 38 -&amp;gt; A(10) -&amp;gt; 65 -&amp;gt; A(19) -&amp;gt; 108 -&amp;gt; halt&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(8):&lt;br /&gt;
&amp;lt;pre&amp;gt;Let S(z) = F:[0, 2z+1, z]&lt;br /&gt;
S(2k) -&amp;gt; 44k+19 -&amp;gt; S(5k+2)&lt;br /&gt;
S(2k+1) -&amp;gt; 4k+2 -&amp;gt; halt&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] -&amp;gt; 44 -&amp;gt; S(4) -&amp;gt; 107 -&amp;gt; S(12) -&amp;gt; 283 -&amp;gt; S(32) -&amp;gt; 723 -&amp;gt;  S(82) -&amp;gt; 1823 -&amp;gt; S(207) -&amp;gt; 414 -&amp;gt; halt&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(9):&lt;br /&gt;
&amp;lt;pre&amp;gt;Let A(x, y) = D:[x, 0, y]&lt;br /&gt;
A(2k, y) --(7k + 6)--&amp;gt; A(3k + 3, y + 1)&lt;br /&gt;
A(2k + 1, y + 1) --(7k + 5)--&amp;gt; A(3k + 1, y)&lt;br /&gt;
A(2k + 1, 0) --(3k + 3)--&amp;gt; *:[0, k, 0]&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0]&lt;br /&gt;
--(3)--&amp;gt; A(2, 0)&lt;br /&gt;
--(13)--&amp;gt; A(6, 1)&lt;br /&gt;
--(27)--&amp;gt; A(12, 2)&lt;br /&gt;
...&lt;br /&gt;
--(2753550047052785432549)--&amp;gt; A(1180092877308336613950, 31)&lt;br /&gt;
--(4130325070579178148831)--&amp;gt; A(1770139315962504920928, 32)&lt;br /&gt;
--(6195487605868767223254)--&amp;gt; A(2655208973943757381395, 33)&lt;br /&gt;
...&lt;br /&gt;
--(123361440505394191838159894807429323394336791980165278392551786831696080997)--&amp;gt; A(52869188788026082216354240631755424311858625134356547882522194356441177569, 0)&lt;br /&gt;
--(79303783182039123324531360947633136467787937701534821823783291534661766355)--&amp;gt; *[0, 26434594394013041108177120315877712155929312567178273941261097178220588784, 0]&lt;br /&gt;
MBB(9) ≥ 449388104698221698839011045369921106650798313642030657001438652029750007257&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(10):&lt;br /&gt;
&amp;lt;pre&amp;gt;Let A(x) = E:[0, 0, x]&lt;br /&gt;
A(3k) --(28 × 2^k - 5k - 21)--&amp;gt; A(4 × 2^k - 2)&lt;br /&gt;
A(3k + 1) --(20 × 2^k - 5k - 16)--&amp;gt; *:[0, 4 × 2^k - 3, 0]&lt;br /&gt;
A(3k + 2) --(56 × 2^k - 5k - 23)--&amp;gt; A(8 × 2^k - 1)&lt;br /&gt;
&lt;br /&gt;
Let t3 = 2^5864062014807&lt;br /&gt;
Let t4 = 2^((t3 + 4) / 3)&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0]&lt;br /&gt;
--(20)--&amp;gt; A(5)&lt;br /&gt;
--(84)--&amp;gt; A(15)&lt;br /&gt;
--(850)--&amp;gt; A(126)&lt;br /&gt;
--(123145302310681)--&amp;gt; A(17592186044414)&lt;br /&gt;
--(7 × t3 - 29320310074043)--&amp;gt; A(t3 - 1)&lt;br /&gt;
--(5 × t4 - 5 / 3 × t3 - 38 / 3)--&amp;gt; *:[0, t4 - 3, 0]&lt;br /&gt;
MBB(10) ≥ 5 × t4 + 16 / 3 × t3 + 281474976712738 / 3 &amp;gt; 10^^4.03&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(11):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(x) = I:[x, 0, 0]&lt;br /&gt;
A(3k) --&amp;gt; A((20 * 4^k + 1)/3) if k ≥ 1&lt;br /&gt;
A(3k + 1) --&amp;gt; A((80 * 4^k + 1)/3) if k ≥ 1&lt;br /&gt;
A(3k + 2) --&amp;gt; *:[0, (20 * 4^k - 2)/3, 0] if k ≥ 1&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] --(140)--&amp;gt; A(27)&lt;br /&gt;
--&amp;gt; A((20 * 4^9 + 1) / 3) = A(1747627)&lt;br /&gt;
--&amp;gt; A((80 * 4^582542 + 1) / 3) ≡ A(4897384) mod 3^15&lt;br /&gt;
--&amp;gt; A((80 * 4^1632461 + 1) / 3) ≡ A(2637523) mod 3^14&lt;br /&gt;
--&amp;gt; A((80 * 4^879174 + 1) / 3) ≡ A(813591) mod 3^13&lt;br /&gt;
--&amp;gt; A((20 * 4^271197 + 1) / 3) ≡ A(72385) mod 3^12&lt;br /&gt;
--&amp;gt; A((80 * 4^24128 + 1) / 3) ≡ A(84526) mod 3^11&lt;br /&gt;
--&amp;gt; A((80 * 4^28175 + 1) / 3) ≡ A(35479) mod 3^10&lt;br /&gt;
--&amp;gt; A((80 * 4^11826 + 1) / 3) ≡ A(14202) mod 3^9&lt;br /&gt;
--&amp;gt; A((20 * 4^4734 + 1) / 3) ≡ A(268) mod 3^8&lt;br /&gt;
--&amp;gt; A((80 * 4^89 + 1) / 3) ≡ A(2077) mod 3^7&lt;br /&gt;
--&amp;gt; A((80 * 4^692 + 1) / 3) ≡ A(394) mod 3^6&lt;br /&gt;
--&amp;gt; A((80 * 4^131 + 1) / 3) ≡ A(235) mod 3^5&lt;br /&gt;
--&amp;gt; A((80 * 4^78 + 1) / 3) ≡ A(21) mod 3^4&lt;br /&gt;
--&amp;gt; A((20 * 4^7 + 1) / 3) ≡ A(12) mod 3^3&lt;br /&gt;
--&amp;gt; A((20 * 4^4 + 1) / 3) ≡ A(6) mod 3^2&lt;br /&gt;
--&amp;gt; A((20 * 4^2 + 1) / 3) ≡ A(2) mod 3^1&lt;br /&gt;
--&amp;gt; *:[0, (20 * 4^0 - 2) / 3, 0] ≡ *:[0, 0, 0] mod 3^0&lt;br /&gt;
MBB(11) &amp;gt; 10^^17.74&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
&lt;br /&gt;
=== &#039;&#039;&#039;Cryptids in the Wild&#039;&#039;&#039; ===&lt;br /&gt;
These cryptids were discovered through exhaustive enumeration of a domain, rather than being constructed by hand.&lt;br /&gt;
&lt;br /&gt;
==== MBB(8): Space Needle variants ====&lt;br /&gt;
Through the exhaustive search of the MBB(8) domain, all eight instruction machines have either been decided, or are equivalent to one of the two following potential [[cryptids]]: &amp;lt;code&amp;gt;0+B_1+C_2-AD_1-EH_2+F_1-DG_0-EB_2-C*&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;0+B_1-FC_2-GD_0-EF_1+C_2+A_2-EH_1-B*&amp;lt;/code&amp;gt;, which may each be interpreted in the following ways:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
0+B_1+C_2-AD_1-EH_2+F_1-DG_0-EB_2-C*&lt;br /&gt;
&lt;br /&gt;
Let A(x, y) = D:[x, y, 0]&lt;br /&gt;
A(x, 0) --(2)--&amp;gt; *:[x, 0, 0]&lt;br /&gt;
A(x, 2k + 1) --(6x + 6k + 9)--&amp;gt; A(x + k + 1, x + k + 2)&lt;br /&gt;
A(x, 2k + 2) --(6k + 6)--&amp;gt; A(x + k, k)&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] --(3)--&amp;gt; A(1, 1)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Needle rules:&lt;br /&gt;
Let C(x + 3) = A(x, x + 1) = D:[x, x + 1, 0].&lt;br /&gt;
Let a and b be non-negative integers satisfying x = (2a + 1) * 2^b.&lt;br /&gt;
C(x) --&amp;gt; C(2x - a - 2b - 1) if a &amp;gt; 0&lt;br /&gt;
C(x) --&amp;gt; *:[2x - 2b - 3, 0, 0] if a = 0&lt;br /&gt;
&lt;br /&gt;
START: C(5)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
0+B_1-FC_2-GD_0-EF_1+C_2+A_2-EH_1-B*&lt;br /&gt;
&lt;br /&gt;
Let A(x, y) = C:[x, 0, y]&lt;br /&gt;
A(x, 2k) --(6x + 6k + 5)--&amp;gt; A(x + k + 1, x + k + 1)&lt;br /&gt;
A(x, 2k + 3) --(6k + 7)--&amp;gt; A(x + k, k)&lt;br /&gt;
A(x, 1) --(3)--&amp;gt; *:[x, 0, 0]&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] --(2)--&amp;gt; A(1, 0)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Needle rules:&lt;br /&gt;
Let C(x + 3) = A(x, x) = C:[x, 0, x].&lt;br /&gt;
Let a and b be non-negative integers satisfying x = (2a + 1) * 2^b.&lt;br /&gt;
C(x) --&amp;gt; C(2x - a - 3b - 1) if a &amp;gt; 0&lt;br /&gt;
C(x) --&amp;gt; *:[2x - 3b - 1, 0, 0] if a = 0&lt;br /&gt;
&lt;br /&gt;
START: C(5)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
They are similar to the [[BB(6)]] cryptid [[Space Needle]], which is also the [[Beaver Math Olympiad#Unsolved problems|BMO&#039;s 6th problem]].&lt;br /&gt;
&lt;br /&gt;
These were found by Shawn Ligocki as the only 6 remaining 8-instruction holdouts on 2 Oct 2026 with an initial analysis of &amp;lt;code&amp;gt;0+B_1-GC_2-AD_1+E_2+F_0-DB_1-AH_0-F*&amp;lt;/code&amp;gt; .&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555767330531967099]&amp;lt;/sup&amp;gt; Sheep noticed the connection to Space Needle,&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555825617197342816]&amp;lt;/sup&amp;gt; analyzed all 6 holdouts and discovered that they can be reduced down to just two behaviors (listed above).&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555896809208156202]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Larger Cryptids ===&lt;br /&gt;
These cryptids were constructed by hand, translating a previously known Cryptid-like mechanism into a register machine. Note that this does not include Rick Griffith&#039;s 85-instruction, 16-register machine which would have halted had Fermat&#039;s Last Theorem turned out to be false,&amp;lt;sup&amp;gt;[https://web.archive.org/web/20120612014351/http://www.cantabgold.net/users/m.y.becker.98/part2projects/rickdissertation.zip]&amp;lt;/sup&amp;gt; as the theorem had already been proven true&amp;lt;sup&amp;gt;[https://www.jstor.org/stable/2118559]&amp;lt;/sup&amp;gt; by the time Griffith&#039;s machine was constructed (2003).&lt;br /&gt;
&lt;br /&gt;
==== MBB(10): Hydra ====&lt;br /&gt;
[[Hydra]] was hand coded into a 10-instruction, 3-register register machine: &amp;lt;code&amp;gt;0-BF_1+C_1+D_0-EH_1+A_2+G_2+I_2-I*_0+J_1-IA&amp;lt;/code&amp;gt; which can be interpreted the following way:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1446694179337011325]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let S(h,w) = A:[h-3,0,w]&lt;br /&gt;
&lt;br /&gt;
Start: A:[0,0,0] = S(3,0)&lt;br /&gt;
S(2k,0) = A:[2k-3,0,0] -&amp;gt; Halt&lt;br /&gt;
S(2k,w+1) = A:[2k-3,0,w+1] -&amp;gt; A:[3k-3,0,w] = S(3k,w)&lt;br /&gt;
S(2k+1,w) = A:[2k-2,0,w] -&amp;gt; A:[3k-2,0,w+2] = S(3k+1,w+2)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== MBB(12,2): Convergence of 7 under the 5n + 1 map ====&lt;br /&gt;
The 5n + 1 map has also been hand coded into a 12-instruction, 2-register machine: &amp;lt;code&amp;gt;0+B_0+C_0+D_0+E_1-IF_1+G_0-HE_0-FJ_0+A_1-KL_0+J_0-H*&amp;lt;/code&amp;gt; which can be interpreted the following way:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555083694937604097]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
0+B_0+C_0+D_0+E_1-IF_1+G_0-HE_0-FJ_0+A_1-KL_0+J_0-H*&lt;br /&gt;
&lt;br /&gt;
Let A(x + 3) = F:[x, 0]&lt;br /&gt;
Assume x &amp;gt; 0.&lt;br /&gt;
A(4) --(10)--&amp;gt; *:[0, 0]&lt;br /&gt;
A(2k) --(5k - 2)--&amp;gt; A(k)&lt;br /&gt;
A(2k + 1) --(9k)--&amp;gt; A(5k + 3)&lt;br /&gt;
 &lt;br /&gt;
A:[0, 0] --(5)--&amp;gt; A(7)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== MBB(130): Riemann Hypothesis ====&lt;br /&gt;
The Riemann Hypothesis has been coded into a 130-instruction, 29-register machine.&amp;lt;sup&amp;gt;[https://www.sciencedirect.com/science/article/pii/S0304397519304633]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[Category:functions]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB2LC1RC_2LC---2RB_2LA0LB0RA&amp;diff=9751</id>
		<title>1RB2LC1RC 2LC---2RB 2LA0LB0RA</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB2LC1RC_2LC---2RB_2LA0LB0RA&amp;diff=9751"/>
		<updated>2026-10-28T14:50:05Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: Undo revision 9537 by Δ⁵ (talk)&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RB2LC1RC_2LC---2RB_2LA0LB0RA}} {{unsolved|Does this TM halt? If so, how many steps does it take to halt?}}&lt;br /&gt;
{{TM|1RB2LC1RC_2LC---2RB_2LA0LB0RA|undecided}} is a [[BB(3,3)]] [[holdout]] which appears to [[probviously]] halt. If it can be proven to halt, it will be the BB(3,3) champion in terms of both steps and tape symbols. However, it could also turn out to be a probviously halting [[Cryptid]]. &lt;br /&gt;
&lt;br /&gt;
This is holdout #758 on Justin&#039;s 3x3 mugshots. After about 1.8 million steps and up to some relabelling, it is equivalent to holdout #153: {{TM|1RB0LB0RC_2LC2LA1RA_1RA1LC---}}. And if you start in state C it is a [[permutation]] of the same machine. Together, they simulate a complex set of [[Collatz-like]] rules with two decreasing parameters. &lt;br /&gt;
&lt;br /&gt;
After active exploration on the #bb3x3 channel by LegionMammal and dyuan, LegionMammal found (and dyuan confirmed) a configuration A(1,c) (defined [https://discord.com/channels/960643023006490684/1259770474897080380/1259968221218607145 here]) which halts and for which a huge &amp;quot;wall&amp;quot; of previous A(1, c&#039;) values all reach it. This gives strong evidence that the TM probviosly halts since jumping over this wall is very &amp;quot;unlikely&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
The TM has been simulated for over 10&amp;lt;sup&amp;gt;27&amp;lt;/sup&amp;gt;&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1259770474897080380/1324065684677988505&amp;lt;/ref&amp;gt; steps, reaching A(1, 1059491543272883(~1e15)).&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1259770474897080380/1390819028137803829&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== dyuan01&#039;s Rules ==&lt;br /&gt;
https://discord.com/channels/960643023006490684/1084047886494470185/1224457633176486041&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
A_1(a, b, c) = 0^inf 1 2^a &amp;lt;C (22)^b (20)^c 0^inf&lt;br /&gt;
A_2(a, b, c) = 0^inf 1 2^a &amp;lt;A2 (22)^b (20)^c 0^inf&lt;br /&gt;
B(a, b) = 0^inf 1 2^a &amp;lt;B0 (20)^b 0^inf&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! From !! To&lt;br /&gt;
|-&lt;br /&gt;
| A&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(0, b, 2n) || A&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;(1, b+2n+1, 0)&lt;br /&gt;
|-&lt;br /&gt;
| A&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(0, b, 2n+1) || A&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(1, 0, b+2n+3)&lt;br /&gt;
|-&lt;br /&gt;
| A&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(m+1, b, 0) || A&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(m, 0, b+2)&lt;br /&gt;
|-&lt;br /&gt;
| A&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(m+1, b, n+1) || A&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;(m, b+1, n)&lt;br /&gt;
|-&lt;br /&gt;
| A&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;(0, b, 2n) || A&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(2b+3, 0, 2n+1)&lt;br /&gt;
|-&lt;br /&gt;
| A&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;(0, b, 2n+1) || A&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;(2b+3, 2n+1, 0)&lt;br /&gt;
|-&lt;br /&gt;
| A&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;(m+1, b, 0) || B(m, b+2)&lt;br /&gt;
|-&lt;br /&gt;
| A&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;(m+1, b, n+1) || A&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(m, b+2, n)&lt;br /&gt;
|-&lt;br /&gt;
| B(0, b) || Halt&lt;br /&gt;
|-&lt;br /&gt;
| B(m+1, 2n) || A&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;(m, 2n+1, 0)&lt;br /&gt;
|-&lt;br /&gt;
| B(m+1, 2n+1) || A&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(m, 0, 2n+3)&lt;br /&gt;
|}&lt;br /&gt;
Starting from A&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(0, 0, 1) (at step 2).&lt;br /&gt;
&lt;br /&gt;
== A(a, c) Rules and Timings ==&lt;br /&gt;
&lt;br /&gt;
Let A(a, c) = A&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(a, 0, c) = &amp;lt;code&amp;gt;0^∞ 1 2^a &amp;lt;C (20)^c 0^∞&amp;lt;/code&amp;gt;, where A&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;(a, b, c) comes from dyuan01&#039;s rules. Then the TM satisfies the following rules once it reaches A(0, 1) after 2 steps. Note that rules (a) and (g) aren&#039;t actually reachable from the initial condition.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align:left&amp;quot;&lt;br /&gt;
|+ Rules and associated step counts ([https://discord.com/channels/960643023006490684/1259770474897080380/1324065684677988505 source])&lt;br /&gt;
! !! style=&amp;quot;text-align:left&amp;quot; | A(a, c) → !! Conditions !! Step count&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (a)&lt;br /&gt;
| A(a−c−1, 3c/2+2) || c ≤ a−1, c ≡ 0 (mod 2) || 3c&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;+8c+5&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (b)&lt;br /&gt;
| A(a−c−2, 3(c−1)/2+5) || c ≤ a−2, c ≡ 1 (mod 4) || (6c&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;+31c+37)/2&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (c)&lt;br /&gt;
| A(a−c−4, 3(c−1)/2+8) || c ≤ a−4, c ≡ 3 (mod 4) || 3c&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;+29c+65&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (d)&lt;br /&gt;
| Halt(3(c−1)/2+7) || c = a−3, c ≡ 3 (mod 4) || (6c&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;+43c+75)/2&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (e)&lt;br /&gt;
| A(3c+8, 1) || c = a−2, c ≡ 3 (mod 4) || (6c&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;+37c+63)/2&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (f)&lt;br /&gt;
| Halt(3(c−1)/2+4) || c = a−1, c ≡ 1 (mod 2) || 3c&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;+8c+6&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (g)&lt;br /&gt;
| Halt(a/2+c+4) || c ≥ a, a ≡ 0, c ≡ 0 (mod 2) || 3a&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;+5a+9c+24&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (h)&lt;br /&gt;
| A(1, a/2+c+2) || c ≥ a, a ≡ 0, c ≡ 1 (mod 2) || 3a&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;+3a+5c+11&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (i)&lt;br /&gt;
| A(3a, c−a+4) || c ≥ a, a ≡ 1, c ≡ 0 (mod 2) || 3a&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;−9a+14c+30&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (j)&lt;br /&gt;
| A(3a+2, c−a+1) || c ≥ a, a ≡ 1, c ≡ 1 (mod 2) || 3a&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;+5c+6&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Large-scale behavior ==&lt;br /&gt;
&lt;br /&gt;
Consider the behavior of this machine starting at A(0, 1). If we start a new line every time rule (h) is applied, we find that it follows &#039;&#039;chains&#039;&#039; of steps, each starting from a config of form A(1, &#039;&#039;c&#039;&#039;):&lt;br /&gt;
&lt;br /&gt;
     A(0,1)&lt;br /&gt;
 -h&amp;gt; &#039;&#039;&#039;A(1,3)&#039;&#039;&#039; -j&amp;gt; A(5,3) -e&amp;gt; A(17,1) -b&amp;gt; A(14,5)&lt;br /&gt;
     -b&amp;gt; A(7,11) -j&amp;gt; A(23,5) -b&amp;gt; A(16,11) -c&amp;gt; A(1,23)&lt;br /&gt;
     -j&amp;gt; A(5,23) -j&amp;gt; A(17,19) -j&amp;gt; A(53,3) -c&amp;gt; A(46,11)&lt;br /&gt;
     -c&amp;gt; A(31,23) -c&amp;gt; A(4,41)&lt;br /&gt;
 -h&amp;gt; &#039;&#039;&#039;A(1,45)&#039;&#039;&#039; -j&amp;gt; A(5,45) -j&amp;gt; A(17,41) -j&amp;gt; A(53,25)&lt;br /&gt;
     -b&amp;gt; A(26,41)&lt;br /&gt;
 -h&amp;gt; &#039;&#039;&#039;A(1,56)&#039;&#039;&#039; -i&amp;gt; A(3,59) -j&amp;gt; A(11,57) -j&amp;gt; A(35,47)&lt;br /&gt;
     -j&amp;gt; A(107,13) -b&amp;gt; A(92,23) -c&amp;gt; A(65,41) -b&amp;gt; A(22,65)&lt;br /&gt;
 -h&amp;gt; &#039;&#039;&#039;A(1,78)&#039;&#039;&#039; -i&amp;gt; A(3,81) -j&amp;gt; A(11,79) -j&amp;gt; A(35,69)&lt;br /&gt;
     -j&amp;gt; A(107,35) -c&amp;gt; A(68,59) -c&amp;gt; A(5,95) -j&amp;gt; A(17,91)&lt;br /&gt;
     -j&amp;gt; A(53,75) -j&amp;gt; A(161,23) -c&amp;gt; A(134,41) -b&amp;gt; A(91,65)&lt;br /&gt;
     -b&amp;gt; A(24,101)&lt;br /&gt;
 -h&amp;gt; &#039;&#039;&#039;A(1,115)&#039;&#039;&#039; -j&amp;gt; A(5,115) -j&amp;gt; A(17,111) -j&amp;gt; A(53,95)&lt;br /&gt;
     -j&amp;gt; A(161,43) -c&amp;gt; A(114,71) -c&amp;gt; A(39,113) -j&amp;gt; A(119,75)&lt;br /&gt;
     -c&amp;gt; A(40,119)&lt;br /&gt;
 -h&amp;gt; &#039;&#039;&#039;A(1,141)&#039;&#039;&#039; -j&amp;gt; A(5,141) -j&amp;gt; A(17,137) -j&amp;gt; A(53,121)&lt;br /&gt;
     -j&amp;gt; A(161,69) -b&amp;gt; A(90,107)&lt;br /&gt;
 -h&amp;gt; &#039;&#039;&#039;A(1,154)&#039;&#039;&#039; -i&amp;gt; ...&lt;br /&gt;
&lt;br /&gt;
If we look at the sequence of applied rule labels, we can see the overall structure of these chains:&lt;br /&gt;
&lt;br /&gt;
 A(0,1) h&lt;br /&gt;
 A(1,3) jebbjbcjjjccch&lt;br /&gt;
 A(1,45) jjjbh&lt;br /&gt;
 A(1,56) ijjjbcbh&lt;br /&gt;
 A(1,78) ijjjccjjjcbbh&lt;br /&gt;
 A(1,115) jjjjccjch&lt;br /&gt;
 A(1,141) jjjjbh&lt;br /&gt;
 A(1,154) ijjjjbccbbbjch&lt;br /&gt;
 A(1,194) ijjjjbcbh&lt;br /&gt;
 A(1,218) ijjjjbcjccbcjbcbbjjjcbjcbch&lt;br /&gt;
 A(1,298) ijjjjbh&lt;br /&gt;
 A(1,315) jjjjjccch&lt;br /&gt;
 A(1,341) jjjjjbcjcbbbjch&lt;br /&gt;
 A(1,381) jjjjjbcjbh&lt;br /&gt;
 A(1,405) jjjjjbcjjbh&lt;br /&gt;
 A(1,431) jjjjjch&lt;br /&gt;
 A(1,448) ijjjjch&lt;br /&gt;
 A(1,467) jjjjjch&lt;br /&gt;
 A(1,484) ijjjjjbcbbbcch&lt;br /&gt;
 A(1,524) ijjjjjbcccch&lt;br /&gt;
 A(1,561) jjjjjbh&lt;br /&gt;
 A(1,576) ijjjjjbbbcjjcbjjbcjbbjch&lt;br /&gt;
 A(1,640) ijjjjjbbbh&lt;br /&gt;
 A(1,664) ijjjjjbbch&lt;br /&gt;
 A(1,690) ijjjjjccjbccbjccch&lt;br /&gt;
&lt;br /&gt;
Following a possible (i) and an initial run of (j), the chain alternates between runs of (b)/(c) and runs of (j). Each run of (b)/(c) is of even length, except for the final run which is of odd length. Starting from A(1, &#039;&#039;c&#039;&#039;), the length of the initial run of (j) approaches (log&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt; &#039;&#039;c&#039;&#039; − 1). Rules (d), (f), and (h) can only occur after an odd-length run of (b)/(c), while rule (e) can only occur after an even-length run.&lt;br /&gt;
&lt;br /&gt;
[[File:758 chain lengths.png|thumb|400px|right|alt=A 2D plot of blue and orange points. The values are organized into branching trees of intervals that become progressively smaller until they turn into scattered clouds of points.|Chain lengths starting at A(1, &#039;&#039;c&#039;&#039;) configs. Blue points correspond to &#039;&#039;c&#039;&#039; odd, orange points to &#039;&#039;c&#039;&#039; even. The log scale for &#039;&#039;c&#039;&#039; illustrates the recursive structure.]]&lt;br /&gt;
&lt;br /&gt;
Notice how in the sequence of A(1, &#039;&#039;c&#039;&#039;) configs, the next &#039;&#039;c&#039;&#039; value is always greater than the previous &#039;&#039;c&#039;&#039; value, but not extraordinarily greater. In fact, the difference Δ&#039;&#039;c&#039;&#039; over the course of a chain is roughly proportional to the length of the chain. We can see this if we reparameterize the rules in terms of &#039;&#039;t&#039;&#039; = &#039;&#039;a&#039;&#039;+2&#039;&#039;c&#039;&#039; and &#039;&#039;d&#039;&#039; = (&#039;&#039;c&#039;&#039;−1)/2, with the invariant that 0 ≤ &#039;&#039;d&#039;&#039; ≤ (&#039;&#039;t&#039;&#039;−2)/4 at all times (&amp;lt;code&amp;gt;T(t,d) = A(t-4d-2, 2d+1))&amp;lt;/code&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align:left&amp;quot;&lt;br /&gt;
|+ Rules for T(t, d)&lt;br /&gt;
! !! style=&amp;quot;text-align:left&amp;quot; | T(t, d) → !! Conditions&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (b)&lt;br /&gt;
| T(t+5, 3d/2+2) || 6d ≤ t−5, d ≡ 0 (mod 2)&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (c)&lt;br /&gt;
| T(t+9, 3(d−1)/2+5) || 6d ≤ t−7, d ≡ 1 (mod 2)&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (d)&lt;br /&gt;
| Halt(3d+7) || 6d = t−6, d ≡ 1 (mod 2)&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (e)&lt;br /&gt;
| T(t+8, 0) || 6d = t−5, d ≡ 1 (mod 2)&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (f)&lt;br /&gt;
| Halt(3d+4) || 6d = t−4&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (h)&lt;br /&gt;
| T(t+5, (t−2)/4+1) || 6d ≥ t−2, t ≡ 2 (mod 4)&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (hi)&lt;br /&gt;
| T(t+13, t/4+2) || 6d ≥ t−2, t ≡ 0 (mod 4)&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (j)&lt;br /&gt;
| T(t+4, 3d−(t−1)/2+1) || 6d ≥ t−3, t ≡ 1 (mod 2)&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
In this form, each step increases &#039;&#039;t&#039;&#039; by a small positive value, so this explains why Δ&#039;&#039;c&#039;&#039; between A(1, &#039;&#039;c&#039;&#039;) configs depends on the number of steps in the chain.&lt;br /&gt;
&lt;br /&gt;
What determines the number of steps in the chain? As the plot shows, the chain lengths follow a sort of fractal pattern depending on the magnitude of &#039;&#039;c&#039;&#039;. To derive this pattern, we first start with our T(&#039;&#039;t&#039;&#039;, &#039;&#039;d&#039;&#039;) parameterization, combine steps so that &#039;&#039;t&#039;&#039; is always odd, and let &#039;&#039;u&#039;&#039; = (&#039;&#039;t&#039;&#039;−1)/2, so that 0 ≤ &#039;&#039;d&#039;&#039; ≤ (&#039;&#039;u&#039;&#039;−1)/2. Looking at rules (b), (c), and (j), we find (&amp;lt;code&amp;gt;U(u,d) = T(2u+1, d))&amp;lt;/code&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align:left&amp;quot;&lt;br /&gt;
|+ Rules for U(u, d)&lt;br /&gt;
! !! style=&amp;quot;text-align:left&amp;quot; | U(u, d) → !! Conditions&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (bb)&lt;br /&gt;
| U(u+5, (9d+20)/4) || 0 ≤ d ≤ (2u−12)/9, d ≡ 0 (mod 4)&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (cc)&lt;br /&gt;
| U(u+9, (9d+35)/4) || 0 ≤ d ≤ (2u−19)/9, d ≡ 1 (mod 4)&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (bc)&lt;br /&gt;
| U(u+7, (9d+26)/4) || 0 ≤ d ≤ (2u−12)/9, d ≡ 2 (mod 4)&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (cb)&lt;br /&gt;
| U(u+7, (9d+29)/4) || 0 ≤ d ≤ (2u−17)/9, d ≡ 3 (mod 4)&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;text-align:right&amp;quot; | (j)&lt;br /&gt;
| U(u+2, 3d−u+1) || (u−1)/3 ≤ d ≤ (u−1)/2&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
[[File:758 fractal.png|thumb|400px|right|alt=A fractal pattern similar to the ternary Cantor set. A single line appears at the top, followed by 2 shorter lines below it, followed by 4 even shorter lines below those, and so on recursively.|The fractal pattern followed by rules (b), (c), (j). The depth of a given point corresponds to the number of steps before hitting rule (h).]]&lt;br /&gt;
&lt;br /&gt;
Broadly, it maps &#039;&#039;d&#039;&#039; → 9&#039;&#039;d&#039;&#039;/4 when 0 &amp;lt; &#039;&#039;d&#039;&#039; &amp;lt; 2&#039;&#039;u&#039;&#039;/9; hits rule (h) and resets when 2&#039;&#039;u&#039;&#039;/9 &amp;lt; &#039;&#039;d&#039;&#039; &amp;lt; &#039;&#039;u&#039;&#039;/3; and maps &#039;&#039;d&#039;&#039; → 3&#039;&#039;d&#039;&#039;−&#039;&#039;u&#039;&#039; when &#039;&#039;u&#039;&#039;/3 &amp;lt; &#039;&#039;d&#039;&#039; &amp;lt; &#039;&#039;u&#039;&#039;/2. These three subcases form an [[wikipedia:iterated function system|iterated function system]] describing a fractal pattern analogous to the ternary Cantor set. The machine checks which interval the ratio 2&#039;&#039;d&#039;&#039;/&#039;&#039;u&#039;&#039; lies in: if it lies in the middle interval, rule (h) applies, but if it lies in the left or right interval, rules (b), (c), (j) expand its position within that interval, then recursively repeat the check. Similarly to the Cantor set, the fractal has Lebesgue measure 0, so almost all initial points should eventually hit rule (h). As a corollary, the number of steps after the initial (j) run should follow a geometric distribution, so the expected chain length should approach log&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt; &#039;&#039;c&#039;&#039; plus a constant.&lt;br /&gt;
&lt;br /&gt;
The machine halts if the chain ends at rules (d) or (f), which reside at the right edge of the left intervals within the fractal. Certain configs A(1, &#039;&#039;c&#039;&#039;) hit one of these rules before hitting rule (h), and these values of &#039;&#039;c&#039;&#039; are called &#039;&#039;halting values&#039;&#039;. The first few halting values are:&lt;br /&gt;
&lt;br /&gt;
 A(1,12)   -&amp;gt; Halt(40)   via ijjccjcd&lt;br /&gt;
 A(1,14)   -&amp;gt; Halt(40)   via ijjbcjcd&lt;br /&gt;
 A(1,71)   -&amp;gt; Halt(100)  via jjjebbccbf&lt;br /&gt;
 A(1,73)   -&amp;gt; Halt(100)  via jjjjbbccbf&lt;br /&gt;
 A(1,131)  -&amp;gt; Halt(148)  via jjjjcd&lt;br /&gt;
 A(1,133)  -&amp;gt; Halt(148)  via jjjjbd&lt;br /&gt;
 A(1,2331) -&amp;gt; Halt(2377) via jjjjjjjcbccccjbf&lt;br /&gt;
 A(1,2333) -&amp;gt; Halt(2377) via jjjjjjjbbccccjbf&lt;br /&gt;
 A(1,2583) -&amp;gt; Halt(2620) via jjjjjjjccbcjbf&lt;br /&gt;
 A(1,2585) -&amp;gt; Halt(2620) via jjjjjjjbcbcjbf&lt;br /&gt;
&lt;br /&gt;
As a rule, halting values always come in pairs with a difference of 2, except in the unlikely case that a chain hits rule (e) before halting. They are common for small values of &#039;&#039;c&#039;&#039;, but soon become exponentially rare. In fact, there only exist 64 total halting values up to &#039;&#039;c&#039;&#039; = 3.4×10&amp;lt;sup&amp;gt;15&amp;lt;/sup&amp;gt;, and the first 58 are known not to be reached by the forward iteration.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;First 64 halting values&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&amp;lt;pre style=&amp;quot;overflow:scroll;white-space:pre&amp;quot;&amp;gt;&lt;br /&gt;
1. A(1,12) -&amp;gt; Halt(40) via ijjccjcd&lt;br /&gt;
2. A(1,14) -&amp;gt; Halt(40) via ijjbcjcd&lt;br /&gt;
3. A(1,71) -&amp;gt; Halt(100) via jjjebbccbf&lt;br /&gt;
4. A(1,73) -&amp;gt; Halt(100) via jjjjbbccbf&lt;br /&gt;
5. A(1,131) -&amp;gt; Halt(148) via jjjjcd&lt;br /&gt;
6. A(1,133) -&amp;gt; Halt(148) via jjjjbd&lt;br /&gt;
7. A(1,2331) -&amp;gt; Halt(2377) via jjjjjjjcbccccjbf&lt;br /&gt;
8. A(1,2333) -&amp;gt; Halt(2377) via jjjjjjjbbccccjbf&lt;br /&gt;
9. A(1,2583) -&amp;gt; Halt(2620) via jjjjjjjccbcjbf&lt;br /&gt;
10. A(1,2585) -&amp;gt; Halt(2620) via jjjjjjjbcbcjbf&lt;br /&gt;
11. A(1,3195) -&amp;gt; Halt(3241) via jjjjjjjcbjbbccjcf&lt;br /&gt;
12. A(1,3197) -&amp;gt; Halt(3241) via jjjjjjjbbjbbccjcf&lt;br /&gt;
13. A(1,6306) -&amp;gt; Halt(6358) via ijjjjjjjcbjcccbcd&lt;br /&gt;
14. A(1,6308) -&amp;gt; Halt(6358) via ijjjjjjjbbjcccbcd&lt;br /&gt;
15. A(1,7167) -&amp;gt; Halt(7204) via jjjjjjjjcbcbbd&lt;br /&gt;
16. A(1,7169) -&amp;gt; Halt(7204) via jjjjjjjjbbcbbd&lt;br /&gt;
17. A(1,11787) -&amp;gt; Halt(11812) via jjjjjjjjcd&lt;br /&gt;
18. A(1,11789) -&amp;gt; Halt(11812) via jjjjjjjjbd&lt;br /&gt;
19. A(1,13624) -&amp;gt; Halt(13672) via ijjjjjjjjccbbbccf&lt;br /&gt;
20. A(1,13626) -&amp;gt; Halt(13672) via ijjjjjjjjbcbbbccf&lt;br /&gt;
21. A(1,43122) -&amp;gt; Halt(43165) via ijjjjjjjjjcccbbf&lt;br /&gt;
22. A(1,43124) -&amp;gt; Halt(43165) via ijjjjjjjjjbccbbf&lt;br /&gt;
23. A(1,905235) -&amp;gt; Halt(905284) via jjjjjjjjjjjjccjjbbjbf&lt;br /&gt;
24. A(1,905237) -&amp;gt; Halt(905284) via jjjjjjjjjjjjbcjjbbjbf&lt;br /&gt;
25. A(1,956563) -&amp;gt; Halt(956596) via jjjjjjjjjjjjcd&lt;br /&gt;
26. A(1,956565) -&amp;gt; Halt(956596) via jjjjjjjjjjjjbd&lt;br /&gt;
27. A(1,1712679) -&amp;gt; Halt(1712746) via jjjjjjjjjjjjjcbcbbcjccjcf&lt;br /&gt;
28. A(1,1712681) -&amp;gt; Halt(1712746) via jjjjjjjjjjjjjbbcbbcjccjcf&lt;br /&gt;
29. A(1,49818027) -&amp;gt; Halt(49818118) via jjjjjjjjjjjjjjjjccbbjbcccccjcbcd&lt;br /&gt;
30. A(1,49818029) -&amp;gt; Halt(49818118) via jjjjjjjjjjjjjjjjbcbbjbcccccjcbcd&lt;br /&gt;
31. A(1,77484059) -&amp;gt; Halt(77484100) via jjjjjjjjjjjjjjjjcd&lt;br /&gt;
32. A(1,77484061) -&amp;gt; Halt(77484100) via jjjjjjjjjjjjjjjjbd&lt;br /&gt;
33. A(1,106744976) -&amp;gt; Halt(106745041) via ijjjjjjjjjjjjjjjjccccjjjbf&lt;br /&gt;
34. A(1,106744978) -&amp;gt; Halt(106745041) via ijjjjjjjjjjjjjjjjbcccjjjbf&lt;br /&gt;
35. A(1,659939159) -&amp;gt; Halt(659939224) via jjjjjjjjjjjjjjjjjjccjjcbjbd&lt;br /&gt;
36. A(1,659939161) -&amp;gt; Halt(659939224) via jjjjjjjjjjjjjjjjjjbcjjcbjbd&lt;br /&gt;
37. A(1,3822354579) -&amp;gt; Halt(3822354640) via jjjjjjjjjjjjjjjjjjjjccbbcf&lt;br /&gt;
38. A(1,3822354581) -&amp;gt; Halt(3822354640) via jjjjjjjjjjjjjjjjjjjjbcbbcf&lt;br /&gt;
39. A(1,6276211875) -&amp;gt; Halt(6276211924) via jjjjjjjjjjjjjjjjjjjjcd&lt;br /&gt;
40. A(1,6276211877) -&amp;gt; Halt(6276211924) via jjjjjjjjjjjjjjjjjjjjbd&lt;br /&gt;
41. A(1,16380092275) -&amp;gt; Halt(16380092362) via jjjjjjjjjjjjjjjjjjjjjccjcbjjjjbbbbcd&lt;br /&gt;
42. A(1,16380092277) -&amp;gt; Halt(16380092362) via jjjjjjjjjjjjjjjjjjjjjbcjcbjjjjbbbbcd&lt;br /&gt;
43. A(1,404671372119) -&amp;gt; Halt(404671372210) via jjjjjjjjjjjjjjjjjjjjjjjjcbjcccccccf&lt;br /&gt;
44. A(1,404671372121) -&amp;gt; Halt(404671372210) via jjjjjjjjjjjjjjjjjjjjjjjjbbjcccccccf&lt;br /&gt;
45. A(1,508373165611) -&amp;gt; Halt(508373165668) via jjjjjjjjjjjjjjjjjjjjjjjjcd&lt;br /&gt;
46. A(1,508373165613) -&amp;gt; Halt(508373165668) via jjjjjjjjjjjjjjjjjjjjjjjjbd&lt;br /&gt;
47. A(1,3957690125931) -&amp;gt; Halt(3957690126046) via jjjjjjjjjjjjjjjjjjjjjjjjjjcbjcbjjccjjcbbbbcjcd&lt;br /&gt;
48. A(1,3957690125933) -&amp;gt; Halt(3957690126046) via jjjjjjjjjjjjjjjjjjjjjjjjjjbbjcbjjccjjcbbbbcjcd&lt;br /&gt;
49. A(1,4444131579443) -&amp;gt; Halt(4444131579553) via jjjjjjjjjjjjjjjjjjjjjjjjjjcbjjjbbbcbbbbccbccf&lt;br /&gt;
50. A(1,4444131579445) -&amp;gt; Halt(4444131579553) via jjjjjjjjjjjjjjjjjjjjjjjjjjbbjjjbbbcbbbbccbccf&lt;br /&gt;
51. A(1,8359489573703) -&amp;gt; Halt(8359489573780) via jjjjjjjjjjjjjjjjjjjjjjjjjjjcccbbd&lt;br /&gt;
52. A(1,8359489573705) -&amp;gt; Halt(8359489573780) via jjjjjjjjjjjjjjjjjjjjjjjjjjjbccbbd&lt;br /&gt;
53. A(1,26358811020231) -&amp;gt; Halt(26358811020352) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjcbcbjcbcbbccbbcbcjbf&lt;br /&gt;
54. A(1,26358811020233) -&amp;gt; Halt(26358811020352) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjbbcbjcbcbbccbbcbcjbf&lt;br /&gt;
55. A(1,41178226418867) -&amp;gt; Halt(41178226418932) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjcd&lt;br /&gt;
56. A(1,41178226418869) -&amp;gt; Halt(41178226418932) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjbd&lt;br /&gt;
57. A(1,81795441578679) -&amp;gt; Halt(81795441578764) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjjcbccjcd&lt;br /&gt;
58. A(1,81795441578681) -&amp;gt; Halt(81795441578764) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjjbbccjcd&lt;br /&gt;
59. A(1,1326438094216110) -&amp;gt; Halt(1326438094216285) via ijjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjccbcbbjccjcbjcbjccbbcccccccccf&lt;br /&gt;
60. A(1,1326438094216112) -&amp;gt; Halt(1326438094216285) via ijjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjbcbcbbjccjcbjcbjccbbcccccccccf&lt;br /&gt;
61. A(1,2031355966425479) -&amp;gt; Halt(2031355966425562) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjcbbcbf&lt;br /&gt;
62. A(1,2031355966425481) -&amp;gt; Halt(2031355966425562) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjbbbcbf&lt;br /&gt;
63. A(1,3335436339933243) -&amp;gt; Halt(3335436339933316) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjcd&lt;br /&gt;
64. A(1,3335436339933245) -&amp;gt; Halt(3335436339933316) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjbd&lt;br /&gt;
&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
To determine which halting &#039;&#039;c&#039;&#039; values should get reached by the forward iteration, we can employ a form of backward reasoning. By the nature of this machine, Δ&#039;&#039;c&#039;&#039; depends on both the initial (j) run length and the chain length following the run. For longer chains, the length is effectively pseudorandom, so any two sequences of A(1, &#039;&#039;c&#039;&#039;) values should eventually hit each other, after which they will have the same values.&lt;br /&gt;
&lt;br /&gt;
If we can find a sufficiently long stretch of consecutive A(1, &#039;&#039;c&#039;&#039;) configs that all reach the same halting value, we know that any sequence that reaches that stretch will halt. Conversely, if we find a sufficiently long stretch of A(1, &#039;&#039;c&#039;&#039;) configs that skip past a halting value, we know that any sequence that reaches that stretch will skip past the halting value. In the first case, we say that the halting value &#039;&#039;explodes&#039;&#039; in terms of how many A(1, &#039;&#039;c&#039;&#039;) configs can reach it; in the second case, we say that the halting value &#039;&#039;dies out&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
The first and currently only known halting value that does not die out is &#039;&#039;H&#039;&#039; = (3&amp;lt;sup&amp;gt;307&amp;lt;/sup&amp;gt;−8282708212)/13959275. It it reachable from a very long stretch of consecutive A(1, &#039;&#039;c&#039;&#039;) configs up to &#039;&#039;c&#039;&#039; ≤ &#039;&#039;H&#039;&#039;−3,403,055. The lower bound of this stretch is not known, but it goes at least to H-8,000,000 ≤ c thus this stretch is well over 4 million long. Thus, assuming the forward iteration reaches this very long stretch, it will halt at A(1, &#039;&#039;H&#039;&#039;), unless it has already reached some earlier halting value.&lt;br /&gt;
&lt;br /&gt;
However, we cannot prove that the forward iteration reaches this long stretch instead of skipping past it. Statistically, the expectation is that Δ&#039;&#039;c&#039;&#039; = log&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt; &#039;&#039;c&#039;&#039; + O(1), but we cannot place any easy bound on how long the chain can become: in principle, there could be an undiscovered A(1, &#039;&#039;c&#039;&#039;) config that goes on for 10&amp;lt;sup&amp;gt;1000&amp;lt;/sup&amp;gt; steps or more. So if we want to fully prove that this machine halts at or before A(1, &#039;&#039;H&#039;&#039;), we must place an upper bound on Δ&#039;&#039;c&#039;&#039; for every step leading up to it. But given the size of &#039;&#039;H&#039;&#039;, there is no known practical method to compute such an upper bound.&lt;br /&gt;
&lt;br /&gt;
== Equivalence to 1RB0LB0RC_2LC2LA1RA_1RA1LC--- ==&lt;br /&gt;
{{TM|1RB0LB0RC_2LC2LA1RA_1RA1LC---}}, #153, eventually becomes equivalent to this machine. As found by [https://discord.com/channels/960643023006490684/1259770474897080380/1260244842999709726 @Legion], after running the #153 machine for 1,790,901 steps, if one permutes the states A,C, and B and exchanges 1 for 2 and L for R, it has the same configuration as TM #758 after it has run 1,841,608 steps.&lt;br /&gt;
&lt;br /&gt;
== History ==&lt;br /&gt;
LegionMammal&#039;s rough timeline of this TM on 30 Apr 2025 ([https://discord.com/channels/960643023006490684/1259770474897080380/1367340727859679322 Discord link]):&lt;br /&gt;
&lt;br /&gt;
# The machine (and its sibling) passed straight through various rounds of cleverly-written deciders&lt;br /&gt;
# dyuan posted his set of rules and looked into it a bit, Justin noted that he&#039;d briefly looked at it some time back&lt;br /&gt;
# Shawn and savask wrote up some acceleration schemes, found empirical evidence that it repeatedly comes close to halting, and speculated that it might actually halt after some period of time&lt;br /&gt;
# I took a crack at it myself, this time in terms of chains starting from &amp;lt;code&amp;gt;A(1,c)&amp;lt;/code&amp;gt; configs, found some &amp;lt;code&amp;gt;c&amp;lt;/code&amp;gt; values leading to a halt (showing that there&#039;s no obvious structural barrier), and conjectured some heuristics for how long it should take to reach such a halting &amp;lt;code&amp;gt;c&amp;lt;/code&amp;gt; value&lt;br /&gt;
# dyuan and I nailed down the ideas of &#039;halter families&#039; (collections of infinitely many halting &amp;lt;code&amp;gt;c&amp;lt;/code&amp;gt; values so we don&#039;t have to brute-force them) and &#039;reachability analysis&#039; (obtaining a strong probvious guess of whether a &amp;lt;code&amp;gt;c&amp;lt;/code&amp;gt; value will or won&#039;t occur in the machine&#039;s actual forward behavior, assuming it hasn&#039;t halted beforehand)&lt;br /&gt;
# dyuan and I raced to find a halting &amp;lt;code&amp;gt;c&amp;lt;/code&amp;gt; value that &#039;explodes&#039; (passes the reachability analysis), first within the &#039;trivial&#039; halter family to no avail, then within all halter families (writing a program to enumerate halter families is extremely fiddly, at this point I treat some of my own code as a black box not to be touched)&lt;br /&gt;
# By dint of a somewhat more performant program, I found (and dyuan confirmed) the &amp;lt;math&amp;gt;c = \frac{3^{307}-8\,282\,708\,212}{13\,959\,275}&amp;lt;/math&amp;gt; we all know and love, probviously sealing the machine&#039;s fate&lt;br /&gt;
&lt;br /&gt;
== savask&#039;s Rules ==&lt;br /&gt;
https://discord.com/channels/960643023006490684/1084047886494470185/1254085725138190336&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;code&amp;gt;(m, b, n) = A2(m, b, n) = 0^inf 1 2^m &amp;lt;A2 (22)^b (20)^n 0^inf&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
(0, b, n) -&amp;gt; (2b+2, 1, n) if n is even&lt;br /&gt;
          -&amp;gt; (2b, 1, n+3) if n is odd&lt;br /&gt;
&lt;br /&gt;
(1, b, 0) -&amp;gt; Halt&lt;br /&gt;
&lt;br /&gt;
(2, b, 0) -&amp;gt; (0, b+3, 0) if b is even&lt;br /&gt;
          -&amp;gt; (0, 1, b+5) if b is odd&lt;br /&gt;
&lt;br /&gt;
(m, b, 0) -&amp;gt; (m-2, b+3, 0) if b is even&lt;br /&gt;
          -&amp;gt; (m-3, 1, b+3) if b is odd&lt;br /&gt;
&lt;br /&gt;
(1, b, n) -&amp;gt; (0, 1, n+b+2) if n is even&lt;br /&gt;
          -&amp;gt; Halt if n is odd&lt;br /&gt;
&lt;br /&gt;
(2, b, 1) -&amp;gt; Halt if b is even&lt;br /&gt;
          -&amp;gt; (0, 1, b+5) if b is odd&lt;br /&gt;
&lt;br /&gt;
(m, b, 1) -&amp;gt; (m-3, 1, b+3)&lt;br /&gt;
&lt;br /&gt;
(m, b, n) -&amp;gt; (m-2, b+3, n-2)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
https://discord.com/channels/960643023006490684/1084047886494470185/1254306301786198116&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
step (A2 0 b n) | even n = A2 (2*b+2) 1 n&lt;br /&gt;
                | otherwise = A2 (2*b) 1 (n+3)&lt;br /&gt;
-- From now on m &amp;gt; 0&lt;br /&gt;
step (A2 1 b 0) = error $ &amp;quot;Halt A2 1 &amp;quot; ++ show b ++ &amp;quot; 0&amp;quot;&lt;br /&gt;
step (A2 2 b 0) | even b = A2 0 (b+3) 0&lt;br /&gt;
                | otherwise = A2 0 1 (b+5)&lt;br /&gt;
step (A2 m b 0) | even b = A2 (m-2) (b+3) 0&lt;br /&gt;
                | otherwise = A2 (m-3) 1 (b+3)&lt;br /&gt;
-- From now on n &amp;gt; 0&lt;br /&gt;
step (A2 1 b n) | even n = A2 0 1 (n+b+2)&lt;br /&gt;
                | otherwise = error $ &amp;quot;Halt A2 1 &amp;quot; ++ show b ++ &amp;quot; &amp;quot; ++ show n&lt;br /&gt;
step (A2 2 b 1) | even b = error $ &amp;quot;Halt A2 2 &amp;quot; ++ show b ++ &amp;quot; 1&amp;quot;&lt;br /&gt;
                | otherwise = A2 0 1 (b+5)&lt;br /&gt;
step (A2 m b 1) = A2 (m-3) 1 (b+3)&lt;br /&gt;
-- Here m &amp;gt; 1, n &amp;gt; 1&lt;br /&gt;
step (A2 m b n) = let d2 = (min m n) `div` 2 in A2 (m - 2*d2) (b + 3*d2) (n - 2*d2) -- Accelerated&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Shawn&#039;s Rules ==&lt;br /&gt;
https://discord.com/channels/960643023006490684/1084047886494470185/1254307091863048264&lt;br /&gt;
&lt;br /&gt;
We can reduce the set of rules from savask&#039;s list a bit by noticing that we can evaluate so that all rules end with c even: &lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
  (0, b, 2c)    -&amp;gt; (2b+2, 1, 2c)&lt;br /&gt;
&lt;br /&gt;
  (1, b, 0) -&amp;gt; Halt&lt;br /&gt;
  (1, 2b,   2c)  -&amp;gt; (0, 1, 2(b+c+1))&lt;br /&gt;
  (1, 2b+1, 2c)  -&amp;gt; (2, 1, 2(b+c+3))&lt;br /&gt;
&lt;br /&gt;
  (a, 2b,   0)  -&amp;gt; (a-2, 2b+3, 0)&lt;br /&gt;
  (2, 2b+1, 0)  -&amp;gt; (0, 1, 2b+6)&lt;br /&gt;
  (a, 2b+1, 0)  -&amp;gt; (a-3, 1, 2b+4)&lt;br /&gt;
&lt;br /&gt;
  (a, b, c) -&amp;gt; (a-2, b+3, c-2)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Phases ===&lt;br /&gt;
We can think of this going through two different phases. &amp;quot;Even Phase&amp;quot; (where &amp;lt;code&amp;gt;a&amp;lt;/code&amp;gt; is even) and &amp;quot;Odd Phase&amp;quot; (where &amp;lt;code&amp;gt;a&amp;lt;/code&amp;gt; is odd).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Even Phase: a,c even:&lt;br /&gt;
  (0, b, 2c) -&amp;gt; (2b+2, 1, 2c)&lt;br /&gt;
  (2a+2, 2b, 0) -&amp;gt; (2a, 2b+3, 0)&lt;br /&gt;
  (2, 2b+1, 0) -&amp;gt; (0, 1, 2(b+3))&lt;br /&gt;
&lt;br /&gt;
  To Odd Phase:&lt;br /&gt;
    (2a+4, 2b+1, 0) -&amp;gt; (2a+1, 1, 2b+4)&lt;br /&gt;
 &lt;br /&gt;
Odd Phase: a odd, c even&lt;br /&gt;
  To Halt:&lt;br /&gt;
    (1, b, 0) -&amp;gt; Halt&lt;br /&gt;
    (3, 2b, 0) -&amp;gt; (1, 2b+3, 0) -&amp;gt; Halt&lt;br /&gt;
&lt;br /&gt;
  To Even Phase:&lt;br /&gt;
    (1, 2b, 2c+2) -&amp;gt; (0, 1, 2(b+c+2))&lt;br /&gt;
    (1, 2b+1, 2c+2) -&amp;gt; (0, 1, 2b+2c+5) -&amp;gt; (2, 1, 2(b+c+4))&lt;br /&gt;
    &lt;br /&gt;
    (2a+5, 2b, 0) -&amp;gt; (2a+3, 2b+3, 0) -&amp;gt; (2a, 1, 2b+6)&lt;br /&gt;
    (2a+3, 2b+1, 0)  -&amp;gt; (2a, 1, 2b+4)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
So the only way for this to halt is if it is in &amp;quot;Even Phase&amp;quot; and hits (2k+8, 2k+1, 0) or (4k+12, 4k+3, 0)  (which will lead to (1, b, 0) or (3, 2b, 0) eventually).&lt;br /&gt;
If &amp;lt;code&amp;gt;a&amp;lt;/code&amp;gt; is bigger or smaller, then &amp;quot;Odd Phase&amp;quot; will end going back to &amp;quot;Even Phase&amp;quot; again.&lt;br /&gt;
&lt;br /&gt;
=== Repeated (0, b, 2c) ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;f(n) = 3n+4&amp;lt;/math&amp;gt;, then&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;(0, b, 2c) \to (0, f(b), 2(c - b - 1))&amp;lt;/math&amp;gt; Let&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;h(n) = f^n(1) + 1 = 3^{n+1} - 1&amp;lt;/math&amp;gt;&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;g(n) = \sum_{k=0}^{n-1} h(k) = \frac{3}{2} (3^n - 1) - n&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Then if &amp;lt;math&amp;gt;c &amp;gt; g(n)&amp;lt;/math&amp;gt;:&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;(0, 1, 2c) \to (0, f^n(1), 2 (c-g(n))) \to (2 h(n), 1, 2 (c-g(n)))&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Repeated (0, 1, 2c) ===&lt;br /&gt;
https://discord.com/channels/960643023006490684/1084047886494470185/1254635277020954705&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;C(n) = (0, 1, 2n)&amp;lt;/math&amp;gt; = &amp;lt;code&amp;gt;0^inf 1 &amp;lt;A2 22 (20)^2n 0^inf&amp;lt;/code&amp;gt;&lt;br /&gt;
    &lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;C(g(n) + 8k+1) \to C(g(n) + 8k+1 + n+9)&amp;lt;/math&amp;gt;&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\forall k: \frac{h(n) - 45}{65} &amp;lt; k &amp;lt; \frac{h(n) - 22}{38}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Notably, when 8 divides (n+1) then this rule can potentially be applied repeatedly.&lt;br /&gt;
&lt;br /&gt;
Ex: if n = 7, then we get:&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\forall k \in [101, 172]: C(3273 + 8k) \to C(3273 + 8(k+2))&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
And we see this starting with &amp;lt;math&amp;gt;C(4137) = C(3273 + 8 \cdot 108)&amp;lt;/math&amp;gt; which repeats this rule until we get to &amp;lt;math&amp;gt;C(4665) = C(3273 + 8 \cdot 174)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
And as n gets way bigger, these ranges of repeat will increase exponentially.&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
[[Category:BB(3,3)]][[Category:Potential Cryptids]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Talk:Champions&amp;diff=9750</id>
		<title>Talk:Champions</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Talk:Champions&amp;diff=9750"/>
		<updated>2026-10-28T14:47:56Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Should we even count llm-&amp;quot;&amp;quot;&amp;quot;discovered&amp;quot;&amp;quot;&amp;quot; champions? */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== What did Jeff even do? ==&lt;br /&gt;
Seriously. What did Jeff do? AFAICT he did nothing except ask LLMs to write programs for him. And run them. And no, &amp;quot;prompt engineering&amp;quot; is not real work. So why should we say Jeff + [LLM] instead of [LLM]? -- [[User:Δ⁵|Δ⁵]] ([[User talk:Δ⁵|talk]]) 03:30, 26 October 2026 (UTC)&lt;br /&gt;
:As a standard, there should always be a human&#039;s name or username attached to a machine. --[[User:Loader3229|Loader3229]] ([[User talk:Loader3229|talk]]) 03:32, 26 October 2026 (UTC)&lt;br /&gt;
::Why? [[User:Δ⁵|Δ⁵]] ([[User talk:Δ⁵|talk]]) 04:07, 26 October 2026 (UTC) ΔΔΔΔΔ&lt;br /&gt;
:::Please stop this edit war Δ⁵! This is the standard of our community. All results should have a human&#039;s name attached. Who do you ask if you want more information? You have to ask the human. I cannot ask my Claude what Jeff&#039;s Claude was talking about, they are different instances and don&#039;t have shared memory. Why do we have attribution? It is not for bragging rights, it is for being able to figure out who to talk to and where to look for more information. By removing the human name it makes it harder to figure out what this is about. Including just the AI name also seems to imply that it might have been the company itself. [[User:Sligocki|sligocki]] ([[User talk:Sligocki|talk]]) 14:32, 28 October 2026 (UTC)&lt;br /&gt;
&lt;br /&gt;
== Should we even count llm-&amp;quot;discovered&amp;quot; champions? ==&lt;br /&gt;
The recent BB(8) and BB(9) champions were discovered by LLMs. Although this might seem like a good thing (more champions = better, right?), we have to think about the future of the community. Right now, there is still a place for humans to contribute. But what will happen when AI is infinitely better than humans? Then there will be nothing left to do except to constantly refresh an automatically updated wiki page as AI automatically solves all BB values and variants. I do not want to live in such a dystopia. I want this community to be a place where math enthusiasts and professionals can do new, novel research and compute the uncomputable. Please keep this community alive. -- [[User:Δ⁵|Δ⁵]] ([[User talk:Δ⁵|talk]]) 03:40, 9 October 2026 (UTC)&lt;br /&gt;
:You&#039;re really overestimating how good LLMs are at doing this. Sure, they may be able to create large champions but for verifying large busybeaver values, using AI would be incredibly expensive. There will always be significant human intervention in this community. [[User:Etalon|Etalon]] ([[User talk:Etalon|talk]]) 17:28, 12 October 2026 (UTC)&lt;br /&gt;
::I believe that LLMs will keep improving exponentially to the point of largely surpassing humans in mathematics, like the best chess bots compared to human grandmasters. One year ago, frontier models could not solve any open math problem on their own. Now, they solve hundreds of problems every month. But in my opinion, maths is discovered and the most interesting part is not merely to solve open problems. It is to actually understand theorems, results, and proofs. [[User:Azerty|Azerty]] ([[User talk:Azerty|talk]]) 06:13, 13 October 2026 (UTC)&lt;br /&gt;
&lt;br /&gt;
Δ⁵, do you have an alternative suggestion? I&#039;m not convinced that it&#039;s even possible for us to say no LLM-discoveries are allowed. Once they are discovered should we all just close our eyes to them? If a human sees some post about a champion and analyzes it (but it turns out that champion was found by LLM) should that count? I don&#039;t think there are practical options here aside from maybe discouraging LLMs socially. That said, I do no t currently see this as a dystopia for Busy Beaver specifically. BB has always been heavily tool assisted, using computer programs to help find champions and reduce holdouts. Deciders like [[CTL]] find proofs that are hard (if not impossible) for humans to really conceptualize without the computer. To me, most of the things I love about BB are about discovering how this works which is held back by having too many holdouts or too much unexplored variation of BB. So I&#039;m currently feeling welcoming of LLM contribution b/c it will help us explore more and see the bigger patterns. In my personal experience with LLMs, it is not just a push button process. You can&#039;t just ask them to solve BB(6). Instead when I use them it is a very back-and-forth process, I ask it to work on a problem, it suggests some approaches, I suggest some alternatives (it is overly praising of my ideas, lol) and we work together to produce results. But I&#039;m sure everyone&#039;s experiences are different. If you find that LLMs are reducing your joy in BB, I&#039;m sorry to hear that. Maybe we can figure out some way to help support your joy. [[User:Sligocki|sligocki]] ([[User talk:Sligocki|talk]]) 14:47, 28 October 2026 (UTC)&lt;br /&gt;
&lt;br /&gt;
== Self-Reporting and Verification ==&lt;br /&gt;
This champions page has ended up with a lot of self reported and (I assume) not independently verified champions. I&#039;m conflicted about this: On the one hand I want this wiki to have an encyclopedic/Wikipedia style: it would include things which are known, established and verified. On the other hand, I don&#039;t want to stifle innovation or gatekeep what counts as proper verification. As a compromise I have updated the table to add a &amp;quot;Verification&amp;quot; column. The idea here is to indicate which results have been independently verified by another contributor. My idea is that that verification should include some sort of write-up (wiki page, blog post, etc) describing the TM and how it is known to run this long. I have linked to examples of my own for Pavel&#039;s BB(6) and Daniel&#039;s BB(16) champions. I would love to see some independent analyses of other TMs here (especially smaller ones like Racheline&#039;s BB(14) &amp;gt; Graham champion). [[User:Sligocki|Sligocki]] ([[User talk:Sligocki|talk]]) 16:19, 10 December 2024 (UTC)&lt;br /&gt;
:Particularly interesting is Racheline&#039;s BB(14) &amp;gt; Graham champion. --[[User:Konkhra|Konkhra]] ([[User talk:Konkhra|talk]]) 01:53, 12 December 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
==Larger champions==&lt;br /&gt;
What are the known two-symbol champions beyond BB(16)? Vielhaber, Chacón, and Ceballos&#039;s paper &amp;quot;[https://arxiv.org/abs/2303.02855v1 Friedman&#039;s &#039;Long Finite Sequences&#039;: The End of the Busy Beaver Contest]&amp;quot; gives a 2450-state two-symbol busy beaver halting after at least n(4) steps, where n is Friedman&#039;s [https://googology.miraheze.org/wiki/Block_subsequence_theorem block subsequence function], but this is a very large jump up in state count from 14 states for f&amp;lt;sub&amp;gt;&amp;amp;omega;+1&amp;lt;/sub&amp;gt;(65536). (This paper has some mistakes with their (symbol,state count) notation for TMs, for example referring to Aaronson&#039;s and Yedidia&#039;s machine as a (7910,2) machine rather than a (2,7910) machine, so maybe the machine whose state count I wrote here is the wrong one.) [[User:C7X|C7X]] ([[User talk:C7X|talk]]) 22:00, 17 August 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
:Today i found some bounds on BB(20) and BB(21), though i&#039;m not sure if they&#039;re new. &amp;lt;math&amp;gt;\Sigma(20) &amp;gt; f_{\omega+2}^2(21)&amp;lt;/math&amp;gt; due to {{TM|1LR0LR_0RJ1RG_0RD1LC_1RQ1RE_1LO0RQ_1LH1LF_0LC1LH_0LI0LF_1RD0LF_---0RK_0LM1LL_0LL1LM_1LE1LN_0LF0LM_0RP1LO_0LF0RQ_1RB1RQ_0RS1LA_1LT1RS_0LP0RR|halt}} and &amp;lt;math&amp;gt;\Sigma(21) &amp;gt; f_{\omega^2}^2(4 \uparrow\uparrow 341)&amp;lt;/math&amp;gt; due to {{TM|0LI0LF_0RJ1RG_0RD1LC_1RH1RE_1LO0RH_1LA1LF_0LC1LA_1RB1RH_1RD0LF_1LP0RK_0LM1LL_0LL1LM_1LE1LN_0RQ0LM_0RP1LO_1LR0RH_1LF1RQ_---0LS_1LH0LT_1LH1LU_0LE1LR|halt}}.&lt;br /&gt;
:The old googology wiki claims [https://googology.fandom.com/wiki/Busy_beaver_function#Larger_values some other bounds], two of which are already implied by the bounds mentioned above, but &amp;lt;math&amp;gt;\Sigma(85)&amp;gt;f_{\varepsilon_0}(1907)&amp;lt;/math&amp;gt; and the bounds for more than 2 symbols seem to still be the best known.&lt;br /&gt;
:[[User:Racheline|Racheline]] ([[User talk:Racheline|talk]]) 23:08, 17 August 2024 (UTC)&lt;br /&gt;
::Racheline, congratulations on discovering a TM that crushes Graham&#039;s number. I was very impressed. but I think that in reality BB(8,2) will beat Graham&#039;s number. But it is unrealistic for a human to build such a machine. Only to search in the wild. Unfortunately. Nevertheless, congratulations again and further success!!! --[[User:Konkhra|Konkhra]] ([[User talk:Konkhra|talk]]) 03:29, 18 August 2024 (UTC)&lt;br /&gt;
:::And how about an article about BB(14)?--[[User:Konkhra|Konkhra]] ([[User talk:Konkhra|talk]]) 03:30, 18 August 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
IMHO, beyond Graham&#039;s number I think we should only list highlights (if anything). Like first TM bigger than blah for various notable blah. Otherwise the churn on this page will be high and the quality low. But I&#039;m open to other points of view. If we do extend this much further, I think maybe we should have a more rigorous process for getting new results demonstrated before they are added. --[[User:Sligocki|sligocki]] ([[User talk:Sligocki|talk]]) 02:57, 18 August 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
Can you design very large champions as beat the &amp;lt;math&amp;gt;f_{\psi(\varepsilon_{\Omega+1})}(1000)&amp;lt;/math&amp;gt;, and beat the &amp;lt;math&amp;gt;f_{\psi(\Omega_\omega)}(1000)&amp;lt;/math&amp;gt;, limit for [https://googology.fandom.com/wiki/Bashicu_matrix_system BMS] or beat [https://googology.fandom.com/wiki/Loader%27s_number Loader&#039;s number]? --[[User:Jacobzheng|Jacobzheng]] ([[User talk:Jacobzheng|talk]]) 00:45, 17 September 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
: Later today I can try writing one (or at least starting to write one today), but my machine would likely have thousands of states. [[User:C7X|C7X]] ([[User talk:C7X|talk]]) 15:50, 16 September 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
:: I now have two-symbol machines with the following running times. In order to squeeze the best possible results out of Bashicu matrix system, some machines have a different function applied to &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; at each step (this function is what Bashicu calls the &amp;quot;activation function&amp;quot;), although at this scale it doesn&#039;t make too much of a difference.&lt;br /&gt;
&lt;br /&gt;
:: {| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ Busy Beaver lower bounds using BM4&lt;br /&gt;
|-&lt;br /&gt;
! State count !! Running time !! Activation function&lt;br /&gt;
|-&lt;br /&gt;
| 5889 || &amp;lt;math&amp;gt; &amp;gt;f_{\psi(\varepsilon_{\Omega+1})}(1000)&amp;lt;/math&amp;gt; (using BMS to define FSes) || &amp;lt;math&amp;gt;n\mapsto n+1&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 5894 || &amp;lt;math&amp;gt; &amp;gt;f_{\psi_0(\Omega_\omega)}(1000)&amp;lt;/math&amp;gt; (using BMS to define FSes) || &amp;lt;math&amp;gt;n\mapsto n+1&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 5908 || &amp;lt;math&amp;gt; &amp;gt;(0,0,0,0,0)(1,1,1,1,1)[2]&amp;lt;/math&amp;gt; || &amp;lt;math&amp;gt;n\mapsto n+2&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 5923 || &amp;lt;math&amp;gt; &amp;gt;(0,0,0,0,0)(1,1,1,1,1)[5]&amp;lt;/math&amp;gt; || &amp;lt;math&amp;gt;n\mapsto n+1&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 5941 || &amp;lt;math&amp;gt; &amp;gt;(0,0,0,0,0,0,0,0,0,0)(1,1,1,1,1,1,1,1,1,1)[10]&amp;lt;/math&amp;gt; || &amp;lt;math&amp;gt;n\mapsto n+1&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 5978 || &amp;lt;math&amp;gt; &amp;gt;(\underbrace{0,0,\ldots,0,0}_{889})(\underbrace{1,1,\ldots,1,1}_{889})[894]&amp;lt;/math&amp;gt; || &amp;lt;math&amp;gt;n\mapsto n+6&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 6020 || &amp;lt;math&amp;gt; &amp;gt;(\underbrace{0,0,\ldots,0,0}_{N})(\underbrace{1,1,\ldots,1,1}_{N})[N]&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;N&amp;lt;/math&amp;gt; is &amp;lt;math&amp;gt;2^{2^{2^{2059}}}&amp;lt;/math&amp;gt; || &amp;lt;math&amp;gt;n\mapsto n+5&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
:: &#039;&#039;&#039;Edit:&#039;&#039;&#039; It turns out CatIsFluffy [https://github.com/CatsAreFluffy/metamath-turing-machines beat me to it]! I don&#039;t know how many states the BMS machine has, but [https://cosearch.bbchallenge.org/contribution/m5k4ulm8 BB(1094) &amp;gt; Loader&#039;s number], now down to [https://github.com/CatsAreFluffy/metamath-turing-machines/commit/85948b04fc4aeb983ca6d63d6aee5ad6ef308bfe BB(1015)]. [[User:C7X|C7X]] ([[User talk:C7X|talk]]) 11:37, 4 October 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
Who can design a [https://googology.fandom.com/wiki/Laver_table Laver table] q function level machine. --[[User:Jacobzheng|Jacobzheng]] ([[User talk:Jacobzheng|talk]]) 06:57, 13 February 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
: Me, probably. This 67-state TM should leave over q&amp;lt;sup&amp;gt;81&amp;lt;/sup&amp;gt;(q(5)-2) 1s on the tape (maybe i have an off-by-one or off-by-two error in the exponent of q but it&#039;s still iterated quite a few times):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
M = (&lt;br /&gt;
    ((1, 1, 1), (0, -1, 3)),&lt;br /&gt;
    ((0, -1, 2), (0, 1, 1)),&lt;br /&gt;
    ((1, 1, 0), (1, -1, 2)),&lt;br /&gt;
    ((0, -1, 4), (1, -1, 0)),&lt;br /&gt;
    ((0, -1, 2), (1, -1, 5)),&lt;br /&gt;
    ((0, 1, 26), (0, 1, 5)),&lt;br /&gt;
    ((1, -1, 57), (0, 1, 26)),&lt;br /&gt;
    ((0, 1, 38), (1, 1, 8)),&lt;br /&gt;
    ((0, 1, 9), (1, 1, 8)),&lt;br /&gt;
    ((0, 1, 62), (0, 1, 10)),&lt;br /&gt;
    ((0, -1, 16), (0, -1, 11)),&lt;br /&gt;
    ((1, -1, 12), (1, -1, 11)),&lt;br /&gt;
    ((0, 1, 15), (0, 1, 13)),&lt;br /&gt;
    ((1, 1, 14), (1, 1, 13)),&lt;br /&gt;
    ((0, -1, 16), (0, -1, 11)),&lt;br /&gt;
    ((0, 1, 10), (1, 1, 15)),&lt;br /&gt;
    ((1, -1, 33), (0, -1, 17)),&lt;br /&gt;
    ((1, -1, 18), (1, -1, 17)),&lt;br /&gt;
    ((0, -1, 19), (1, -1, 18)),&lt;br /&gt;
    ((0, -1, 20), (1, -1, 19)),&lt;br /&gt;
    ((0, 1, 22), (1, -1, 21)),&lt;br /&gt;
    ((1, 1, 21), (0, 1, 22)),&lt;br /&gt;
    ((0, 1, 23), (1, 1, 22)),&lt;br /&gt;
    ((1, -1, 24), (1, 1, 23)),&lt;br /&gt;
    ((1, -1, 30), (0, 1, 25)),&lt;br /&gt;
    ((1, -1, 26), (1, 1, 25)),&lt;br /&gt;
    ((0, 1, 6), (0, -1, 27)),&lt;br /&gt;
    ((0, -1, 28), (1, -1, 27)),&lt;br /&gt;
    ((0, -1, 29), (1, -1, 28)),&lt;br /&gt;
    ((1, -1, 20), (1, -1, 29)),&lt;br /&gt;
    ((1, 1, 32), (0, -1, 31)),&lt;br /&gt;
    ((1, -1, 32), (1, -1, 31)),&lt;br /&gt;
    ((0, 1, 7), (0, -1, 30)),&lt;br /&gt;
    ((0, -1, 34), (0, -1, 33)),&lt;br /&gt;
    ((0, -1, 34), (0, -1, 35)),&lt;br /&gt;
    ((0, 1, 37), (1, 1, 36)),&lt;br /&gt;
    ((0, 1, 36), (1, -1, 16)),&lt;br /&gt;
    ((0, 1, 37), (0, 1, 7)),&lt;br /&gt;
    ((0, 1, 39), (0, 1, 7)),&lt;br /&gt;
    ((0, -1, 44), (0, -1, 40)),&lt;br /&gt;
    ((0, -1, 41), (1, -1, 40)),&lt;br /&gt;
    ((1, 1, 42), (1, -1, 41)),&lt;br /&gt;
    ((0, 1, 43), (1, 1, 42)),&lt;br /&gt;
    ((1, 1, 39), (1, 1, 43)),&lt;br /&gt;
    ((0, -1, 45), (1, -1, 44)),&lt;br /&gt;
    ((0, -1, 47), (0, -1, 46)),&lt;br /&gt;
    ((1, -1, 45), (1, -1, 46)),&lt;br /&gt;
    ((1, -1, 47), (1, 1, 48)),&lt;br /&gt;
    ((0, -1, 49), (1, 1, 48)),&lt;br /&gt;
    ((0, 1, 56), (0, -1, 50)),&lt;br /&gt;
    ((0, 1, 49), (0, 1, 51)),&lt;br /&gt;
    ((1, 1, 52), (1, 1, 51)),&lt;br /&gt;
    ((0, -1, 55), (0, -1, 53)),&lt;br /&gt;
    ((1, -1, 54), (1, -1, 53)),&lt;br /&gt;
    ((0, 1, 51), (0, 1, 51)),&lt;br /&gt;
    ((0, -1, 50), (1, -1, 55)),&lt;br /&gt;
    ((1, -1, 57), (1, 1, 56)),&lt;br /&gt;
    ((1, -1, 61), (0, -1, 58)),&lt;br /&gt;
    ((1, 1, 59), (1, -1, 58)),&lt;br /&gt;
    ((0, -1, 60), (0, 1, 56)),&lt;br /&gt;
    ((1, 1, 61), (1, -1, 60)),&lt;br /&gt;
    ((1, -1, 66), (0, 1, 7)),&lt;br /&gt;
    ((0, 1, 63), (0, 1, 62)),&lt;br /&gt;
    ((0, 1, 63), (0, 1, 64)),&lt;br /&gt;
    ((0, -1, 65), (1, 1, -1)),&lt;br /&gt;
    ((0, -1, 65), (1, -1, 66)),&lt;br /&gt;
    ((0, -1, 40), (1, -1, 66))&lt;br /&gt;
)&lt;br /&gt;
&lt;br /&gt;
(start from state 0)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
: It could probably be optimized a bit more, because there are two parts that do basically the same thing and could probably be joined together, but it would cost a few extra states to then differentiate between which of them it was supposed to be, and i don&#039;t have time to do that right now.--[[User:Racheline|Racheline]] ([[User talk:Racheline|talk]]) 18:56, 13 February 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
== BB(51) epsilon_0 champion ==&lt;br /&gt;
Can you show the transitions of BB(51) on [[Large champions transitions]] page? --[[User:Jacobzheng|Jacobzheng]] ([[User talk:Jacobzheng|talk]]) 03:24, 3 September 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
: Here are the transitions and description from Racheline:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Σ(51) &amp;gt; (f_ε0)^8(f_ω^ω^3(a lot)) &amp;gt; f_ε0+1(8)&lt;br /&gt;
M = (&lt;br /&gt;
0:     ((1, -1, 0), (0, -1, 1)),&lt;br /&gt;
1:     ((1, -1, 0), (1, 1, 2)),&lt;br /&gt;
2:     ((1, -1, 2), (0, -1, 4)),&lt;br /&gt;
3:     ((0, -1, 10), (1, -1, 4)),&lt;br /&gt;
4:     ((0, -1, 3), (0, -1, 5)),&lt;br /&gt;
5:     ((1, -1, 4), (1, 1, 6)),&lt;br /&gt;
6:     ((1, -1, 7), (0, -1, 15)),&lt;br /&gt;
7:     ((0, -1, 8), (1, -1, 7)),&lt;br /&gt;
8:     ((0, -1, 9), (1, -1, 7)),&lt;br /&gt;
9:     ((1, 1, 11), (1, -1, 9)),&lt;br /&gt;
10:    ((0, -1, 20), (0, -1, 17)),&lt;br /&gt;
11:    ((0, 1, 12), (1, 1, 11)),&lt;br /&gt;
12:    ((0, 1, 13), (1, 1, 13)),&lt;br /&gt;
13:    ((1, -1, 14), (1, 1, 12)),&lt;br /&gt;
14:    ((0, -1, 6), (1, -1, 10)),&lt;br /&gt;
15:    ((0, -1, 16), (1, -1, 16)),&lt;br /&gt;
16:    ((1, -1, 20), (1, -1, 15)),&lt;br /&gt;
17:    ((0, -1, 18), (1, -1, 18)),&lt;br /&gt;
18:    ((1, 1, 19), (1, -1, 17)),&lt;br /&gt;
19:    ((1, -1, 19), (1, -1, 20)),&lt;br /&gt;
20:    ((0, -1, 50), (0, -1, 21)),&lt;br /&gt;
21:    ((0, 1, 43), (0, -1, 9)),&lt;br /&gt;
22:    ((0, 1, 22), (1, 1, 23)),&lt;br /&gt;
23:    ((1, 1, 26), (0, -1, 24)),&lt;br /&gt;
24:    ((1, -1, 25), (0, -1, 24)),&lt;br /&gt;
25:    ((1, 1, 25), (1, 1, 22)),&lt;br /&gt;
26:    ((0, 1, 50), (0, 1, 27)),&lt;br /&gt;
27:    ((1, 1, 26), (1, -1, 35)),&lt;br /&gt;
28:    ((0, 1, 29), (0, 1, 30)),&lt;br /&gt;
29:    ((0, -1, 4), (1, 1, 28)),&lt;br /&gt;
30:    ((1, -1, 31), (1, -1, 0)),&lt;br /&gt;
31:    ((0, -1, 32), (1, -1, 33)),&lt;br /&gt;
32:    ((0, -1, 33), (1, -1, 31)),&lt;br /&gt;
33:    ((0, -1, 34), (0, -1, 35)),&lt;br /&gt;
34:    ((0, -1, 37), (1, -1, 33)),&lt;br /&gt;
35:    ((1, 1, 36), (1, 1, 38)),&lt;br /&gt;
36:    ((0, 1, 37), (1, 1, 28)),&lt;br /&gt;
37:    ((0, -1, 29), (1, 1, 36)),&lt;br /&gt;
38:    ((1, 1, 38), (1, 1, 39)),&lt;br /&gt;
39:    ((0, 1, 38), (1, 1, 40)),&lt;br /&gt;
40:    ((0, 1, 41), (1, -1, 42)),&lt;br /&gt;
41:    ((1, -1, 49), (1, 1, 40)),&lt;br /&gt;
42:    ((1, 1, 36), (0, -1, 42)),&lt;br /&gt;
43:    ((0, 1, 44), (1, 1, 44)),&lt;br /&gt;
44:    ((1, -1, 45), (1, 1, 43)),&lt;br /&gt;
45:    ((0, -1, 46), (1, -1, 46)),&lt;br /&gt;
46:    ((0, 1, 22), (1, -1, 45)),&lt;br /&gt;
47:    ((1, -1, 41), (1, -1, 47)),&lt;br /&gt;
48:    ((0, -1, 47), (0, -1, 49)),&lt;br /&gt;
49:    ((1, -1, 22), (1, -1, 48)),&lt;br /&gt;
50:    ((0, -1, 48), (1, 1, halt))&lt;br /&gt;
)&lt;br /&gt;
 &lt;br /&gt;
(start from state 30)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
: I haven&#039;t investigated it yet. [[User:Sligocki|Sligocki]] ([[User talk:Sligocki|talk]]) 14:27, 3 September 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
:: It directly simulates Address Notation, which is a different way to write Primitive Sequence System (PrSS for short, it&#039;s 1-row Bashicu Matrix System). Here are the expansion rules of Address Notation:&lt;br /&gt;
::: Given a sequence &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; of natural numbers, to compute its expansion, start by letting &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt; be the last element of &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt;. If &amp;lt;math&amp;gt;c=0&amp;lt;/math&amp;gt;, then &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; is a successor and its predecessor is &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; without the last element. Otherwise, find the last element &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt; of &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; which is less than &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;. Decrease &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt; by &amp;lt;math&amp;gt;1&amp;lt;/math&amp;gt;, and let &amp;lt;math&amp;gt;B&amp;lt;/math&amp;gt; be everything in this new sequence after &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt;. Append infinitely many copies of &amp;lt;math&amp;gt;B&amp;lt;/math&amp;gt;.&lt;br /&gt;
:: Since the sequences are ordered lexicographically and each element decreases by &amp;lt;math&amp;gt;1&amp;lt;/math&amp;gt; until it is &amp;lt;math&amp;gt;0&amp;lt;/math&amp;gt;, for any fundamental sequence system where each &amp;lt;math&amp;gt;S[n]&amp;lt;/math&amp;gt; is formed by taking an initial subsequence of the expansion of &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; and changing the last element of that subsequence to a smaller or equal natural number, the ordinal notation given by the fundamental sequence system is the same. If i remember correctly, the TM simulates a variant &amp;lt;math&amp;gt;h&amp;lt;/math&amp;gt; of the Hardy Hierarchy with a fundamental sequence system where the FS of each standard &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; contains all sequences longer than &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; formed this way from its expansion (except for the first one or two).&lt;br /&gt;
:: Specifically,&lt;br /&gt;
::: &amp;lt;math&amp;gt;h_0(n)=n+c_0&amp;lt;/math&amp;gt;&lt;br /&gt;
::: &amp;lt;math&amp;gt;h_{\alpha+1}(n)=h_\alpha(n+c_1)&amp;lt;/math&amp;gt;&lt;br /&gt;
::: &amp;lt;math&amp;gt;h_\alpha(n)=h_{\alpha[n]}(c_2)&amp;lt;/math&amp;gt; for limit &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt;&lt;br /&gt;
::: &amp;lt;math&amp;gt;h_{\varepsilon_0}(n) = h_{(0,\lfloor\frac{n+c_3}{2}\rfloor)}(c_4) = h_{\omega\uparrow\uparrow\lfloor\frac{n+c_3}{2}\rfloor}(c_4)&amp;lt;/math&amp;gt;&lt;br /&gt;
:: for some constants &amp;lt;math&amp;gt;c_0,c_1,c_2,c_3,c_4&amp;lt;/math&amp;gt; for which the hierarchy is not degenerate (the constants can be deduced easily from the TM&#039;s space-time diagram). In particular, the non-degeneracy means that for most FGHs &amp;lt;math&amp;gt;f&amp;lt;/math&amp;gt; with &amp;quot;natural&amp;quot; FS systems, we will have &amp;lt;math&amp;gt;f_{\alpha+1}(n)&amp;lt;h_{\omega^{\alpha+1}}(n+k)&amp;lt;/math&amp;gt; for some small constant &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; (depending on &amp;lt;math&amp;gt;f&amp;lt;/math&amp;gt;), and as long as the FGH&#039;s FS system has &amp;lt;math&amp;gt;\varepsilon_0[n]\le\omega\uparrow\uparrow(n+c)&amp;lt;/math&amp;gt; for some constant &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;, we have &amp;lt;math&amp;gt;f_{\varepsilon_0}(n)&amp;lt;h_{\varepsilon_0}(2(n+c)+k)&amp;lt;/math&amp;gt; for some small constant &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; (also depending on &amp;lt;math&amp;gt;f&amp;lt;/math&amp;gt;. For example, the Wainer Hierarchy is one of these &amp;quot;natural&amp;quot; FGHs (and one of the most well-known ones at this level), and if we extend it to include &amp;lt;math&amp;gt;f_{\varepsilon_0}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;f_{\varepsilon_0+1}&amp;lt;/math&amp;gt; with the FS &amp;lt;math&amp;gt;\varepsilon_0[n]=\omega\uparrow\uparrow n&amp;lt;/math&amp;gt;, it does indeed satisfy &amp;lt;math&amp;gt;f_{\varepsilon_0}(n)&amp;lt;h_{\varepsilon_0}(2n+k)&amp;lt;/math&amp;gt; for small &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt;, which means that since the TM computes &amp;lt;math&amp;gt;h_{\varepsilon_0}^8(n)&amp;lt;/math&amp;gt; for a large &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;, its output is larger than &amp;lt;math&amp;gt;f_{\varepsilon_0+1}(8)&amp;lt;/math&amp;gt;. [[User:Racheline|Racheline]] ([[User talk:Racheline|talk]]) 19:06, 3 September 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
I think the bbchallenge can search BB(7) and BB(4,3) in the wild. --[[User:Jacobzheng|Jacobzheng]] ([[User talk:Jacobzheng|talk]]) 14:56, 30 October 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
: I have thought about writing a program that searches for Ackermann&#039;s worm-like behavior of TMs (or at least a program for exponential behavior), but I wouldn&#039;t be sure how to do it. [[User:C7X|C7X]] ([[User talk:C7X|talk]]) 22:07, 30 October 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
== Cloud search for busy beavers ==&lt;br /&gt;
We still lack a website for cloud search busy beaver functions. --[[User:Jacobzheng|Jacobzheng]] ([[User talk:Jacobzheng|talk]]) 07:07, 15 December 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
: In the case of distributed computing projects like Catalogue and Great Internet Mersenne Prime Search, it seems like those are distributed to divvy up a large finite amount of computation. I don&#039;t know much about searching for Busy Beavers (e.g. if there is such a thing as an automated process for finding accelerated simulators) but would distributed finite computation be able to help reduce holdout lists? [[User:C7X|C7X]] ([[User talk:C7X|talk]]) 09:05, 15 December 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
It may be able to search the busy beaver domain BB(7) or even larger more quickly. [[User:Jacobzheng|Jacobzheng]] ([[User talk:Jacobzheng|talk]]) 13:38, 15 December 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
: Certainly it could do something like direct simulation quickly, but is there a known way to automate more advanced techniques to look for long-running machines? [[User:C7X|C7X]] ([[User talk:C7X|talk]]) 22:17, 15 December 2024 (UTC)&lt;br /&gt;
::questions like these should be asked on discord. Few people look at this page.--[[User:Konkhra|Konkhra]] ([[User talk:Konkhra|talk]]) 06:10, 16 December 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
: Setup a BOINC project for bbchallenge, and use this for reducing holdouts list? -- [[User:Loader3229|Loader3229]] ([[User talk:Loader3229|talk]]) 13:34, 22 September 2026 (UTC)&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Talk:Champions&amp;diff=9749</id>
		<title>Talk:Champions</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Talk:Champions&amp;diff=9749"/>
		<updated>2026-10-28T14:33:46Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* What did Jeff even do? */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== What did Jeff even do? ==&lt;br /&gt;
Seriously. What did Jeff do? AFAICT he did nothing except ask LLMs to write programs for him. And run them. And no, &amp;quot;prompt engineering&amp;quot; is not real work. So why should we say Jeff + [LLM] instead of [LLM]? -- [[User:Δ⁵|Δ⁵]] ([[User talk:Δ⁵|talk]]) 03:30, 26 October 2026 (UTC)&lt;br /&gt;
:As a standard, there should always be a human&#039;s name or username attached to a machine. --[[User:Loader3229|Loader3229]] ([[User talk:Loader3229|talk]]) 03:32, 26 October 2026 (UTC)&lt;br /&gt;
::Why? [[User:Δ⁵|Δ⁵]] ([[User talk:Δ⁵|talk]]) 04:07, 26 October 2026 (UTC) ΔΔΔΔΔ&lt;br /&gt;
:::Please stop this edit war Δ⁵! This is the standard of our community. All results should have a human&#039;s name attached. Who do you ask if you want more information? You have to ask the human. I cannot ask my Claude what Jeff&#039;s Claude was talking about, they are different instances and don&#039;t have shared memory. Why do we have attribution? It is not for bragging rights, it is for being able to figure out who to talk to and where to look for more information. By removing the human name it makes it harder to figure out what this is about. Including just the AI name also seems to imply that it might have been the company itself. [[User:Sligocki|sligocki]] ([[User talk:Sligocki|talk]]) 14:32, 28 October 2026 (UTC)&lt;br /&gt;
&lt;br /&gt;
== Should we even count llm-&amp;quot;&amp;quot;&amp;quot;discovered&amp;quot;&amp;quot;&amp;quot; champions? ==&lt;br /&gt;
The recent BB(8) and BB(9) champions were discovered by LLMs. Although this might seem like a good thing (more champions = better, right?), we have to think about the future of the community. Right now, there is still a place for humans to contribute. But what will happen when AI is infinitely better than humans? Then there will be nothing left to do except to constantly refresh an automatically updated wiki page as AI automatically solves all BB values and variants. I do not want to live in such a dystopia. I want this community to be a place where math enthusiasts and professionals can do new, novel research and compute the uncomputable. Please keep this community alive. -- [[User:Δ⁵|Δ⁵]] ([[User talk:Δ⁵|talk]]) 03:40, 9 October 2026 (UTC)&lt;br /&gt;
:You&#039;re really overestimating how good LLMs are at doing this. Sure, they may be able to create large champions but for verifying large busybeaver values, using AI would be incredibly expensive. There will always be significant human intervention in this community. [[User:Etalon|Etalon]] ([[User talk:Etalon|talk]]) 17:28, 12 October 2026 (UTC)&lt;br /&gt;
:I believe that LLMs will keep improving exponentially to the point of largely surpassing humans in mathematics, like the best chess bots compared to human grandmasters. One year ago, frontier models could not solve any open math problem on their own. Now, they solve hundreds of problems every month. But in my opinion, maths is discovered and the most interesting part is not merely to solve open problems. It is to actually understand theorems, results, and proofs. [[User:Azerty|Azerty]] ([[User talk:Azerty|talk]]) 06:13, 13 October 2026 (UTC)&lt;br /&gt;
&lt;br /&gt;
== Self-Reporting and Verification ==&lt;br /&gt;
This champions page has ended up with a lot of self reported and (I assume) not independently verified champions. I&#039;m conflicted about this: On the one hand I want this wiki to have an encyclopedic/Wikipedia style: it would include things which are known, established and verified. On the other hand, I don&#039;t want to stifle innovation or gatekeep what counts as proper verification. As a compromise I have updated the table to add a &amp;quot;Verification&amp;quot; column. The idea here is to indicate which results have been independently verified by another contributor. My idea is that that verification should include some sort of write-up (wiki page, blog post, etc) describing the TM and how it is known to run this long. I have linked to examples of my own for Pavel&#039;s BB(6) and Daniel&#039;s BB(16) champions. I would love to see some independent analyses of other TMs here (especially smaller ones like Racheline&#039;s BB(14) &amp;gt; Graham champion). [[User:Sligocki|Sligocki]] ([[User talk:Sligocki|talk]]) 16:19, 10 December 2024 (UTC)&lt;br /&gt;
:Particularly interesting is Racheline&#039;s BB(14) &amp;gt; Graham champion. --[[User:Konkhra|Konkhra]] ([[User talk:Konkhra|talk]]) 01:53, 12 December 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
==Larger champions==&lt;br /&gt;
What are the known two-symbol champions beyond BB(16)? Vielhaber, Chacón, and Ceballos&#039;s paper &amp;quot;[https://arxiv.org/abs/2303.02855v1 Friedman&#039;s &#039;Long Finite Sequences&#039;: The End of the Busy Beaver Contest]&amp;quot; gives a 2450-state two-symbol busy beaver halting after at least n(4) steps, where n is Friedman&#039;s [https://googology.miraheze.org/wiki/Block_subsequence_theorem block subsequence function], but this is a very large jump up in state count from 14 states for f&amp;lt;sub&amp;gt;&amp;amp;omega;+1&amp;lt;/sub&amp;gt;(65536). (This paper has some mistakes with their (symbol,state count) notation for TMs, for example referring to Aaronson&#039;s and Yedidia&#039;s machine as a (7910,2) machine rather than a (2,7910) machine, so maybe the machine whose state count I wrote here is the wrong one.) [[User:C7X|C7X]] ([[User talk:C7X|talk]]) 22:00, 17 August 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
:Today i found some bounds on BB(20) and BB(21), though i&#039;m not sure if they&#039;re new. &amp;lt;math&amp;gt;\Sigma(20) &amp;gt; f_{\omega+2}^2(21)&amp;lt;/math&amp;gt; due to {{TM|1LR0LR_0RJ1RG_0RD1LC_1RQ1RE_1LO0RQ_1LH1LF_0LC1LH_0LI0LF_1RD0LF_---0RK_0LM1LL_0LL1LM_1LE1LN_0LF0LM_0RP1LO_0LF0RQ_1RB1RQ_0RS1LA_1LT1RS_0LP0RR|halt}} and &amp;lt;math&amp;gt;\Sigma(21) &amp;gt; f_{\omega^2}^2(4 \uparrow\uparrow 341)&amp;lt;/math&amp;gt; due to {{TM|0LI0LF_0RJ1RG_0RD1LC_1RH1RE_1LO0RH_1LA1LF_0LC1LA_1RB1RH_1RD0LF_1LP0RK_0LM1LL_0LL1LM_1LE1LN_0RQ0LM_0RP1LO_1LR0RH_1LF1RQ_---0LS_1LH0LT_1LH1LU_0LE1LR|halt}}.&lt;br /&gt;
:The old googology wiki claims [https://googology.fandom.com/wiki/Busy_beaver_function#Larger_values some other bounds], two of which are already implied by the bounds mentioned above, but &amp;lt;math&amp;gt;\Sigma(85)&amp;gt;f_{\varepsilon_0}(1907)&amp;lt;/math&amp;gt; and the bounds for more than 2 symbols seem to still be the best known.&lt;br /&gt;
:[[User:Racheline|Racheline]] ([[User talk:Racheline|talk]]) 23:08, 17 August 2024 (UTC)&lt;br /&gt;
::Racheline, congratulations on discovering a TM that crushes Graham&#039;s number. I was very impressed. but I think that in reality BB(8,2) will beat Graham&#039;s number. But it is unrealistic for a human to build such a machine. Only to search in the wild. Unfortunately. Nevertheless, congratulations again and further success!!! --[[User:Konkhra|Konkhra]] ([[User talk:Konkhra|talk]]) 03:29, 18 August 2024 (UTC)&lt;br /&gt;
:::And how about an article about BB(14)?--[[User:Konkhra|Konkhra]] ([[User talk:Konkhra|talk]]) 03:30, 18 August 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
IMHO, beyond Graham&#039;s number I think we should only list highlights (if anything). Like first TM bigger than blah for various notable blah. Otherwise the churn on this page will be high and the quality low. But I&#039;m open to other points of view. If we do extend this much further, I think maybe we should have a more rigorous process for getting new results demonstrated before they are added. --[[User:Sligocki|sligocki]] ([[User talk:Sligocki|talk]]) 02:57, 18 August 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
Can you design very large champions as beat the &amp;lt;math&amp;gt;f_{\psi(\varepsilon_{\Omega+1})}(1000)&amp;lt;/math&amp;gt;, and beat the &amp;lt;math&amp;gt;f_{\psi(\Omega_\omega)}(1000)&amp;lt;/math&amp;gt;, limit for [https://googology.fandom.com/wiki/Bashicu_matrix_system BMS] or beat [https://googology.fandom.com/wiki/Loader%27s_number Loader&#039;s number]? --[[User:Jacobzheng|Jacobzheng]] ([[User talk:Jacobzheng|talk]]) 00:45, 17 September 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
: Later today I can try writing one (or at least starting to write one today), but my machine would likely have thousands of states. [[User:C7X|C7X]] ([[User talk:C7X|talk]]) 15:50, 16 September 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
:: I now have two-symbol machines with the following running times. In order to squeeze the best possible results out of Bashicu matrix system, some machines have a different function applied to &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; at each step (this function is what Bashicu calls the &amp;quot;activation function&amp;quot;), although at this scale it doesn&#039;t make too much of a difference.&lt;br /&gt;
&lt;br /&gt;
:: {| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ Busy Beaver lower bounds using BM4&lt;br /&gt;
|-&lt;br /&gt;
! State count !! Running time !! Activation function&lt;br /&gt;
|-&lt;br /&gt;
| 5889 || &amp;lt;math&amp;gt; &amp;gt;f_{\psi(\varepsilon_{\Omega+1})}(1000)&amp;lt;/math&amp;gt; (using BMS to define FSes) || &amp;lt;math&amp;gt;n\mapsto n+1&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 5894 || &amp;lt;math&amp;gt; &amp;gt;f_{\psi_0(\Omega_\omega)}(1000)&amp;lt;/math&amp;gt; (using BMS to define FSes) || &amp;lt;math&amp;gt;n\mapsto n+1&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 5908 || &amp;lt;math&amp;gt; &amp;gt;(0,0,0,0,0)(1,1,1,1,1)[2]&amp;lt;/math&amp;gt; || &amp;lt;math&amp;gt;n\mapsto n+2&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 5923 || &amp;lt;math&amp;gt; &amp;gt;(0,0,0,0,0)(1,1,1,1,1)[5]&amp;lt;/math&amp;gt; || &amp;lt;math&amp;gt;n\mapsto n+1&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 5941 || &amp;lt;math&amp;gt; &amp;gt;(0,0,0,0,0,0,0,0,0,0)(1,1,1,1,1,1,1,1,1,1)[10]&amp;lt;/math&amp;gt; || &amp;lt;math&amp;gt;n\mapsto n+1&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 5978 || &amp;lt;math&amp;gt; &amp;gt;(\underbrace{0,0,\ldots,0,0}_{889})(\underbrace{1,1,\ldots,1,1}_{889})[894]&amp;lt;/math&amp;gt; || &amp;lt;math&amp;gt;n\mapsto n+6&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| 6020 || &amp;lt;math&amp;gt; &amp;gt;(\underbrace{0,0,\ldots,0,0}_{N})(\underbrace{1,1,\ldots,1,1}_{N})[N]&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;N&amp;lt;/math&amp;gt; is &amp;lt;math&amp;gt;2^{2^{2^{2059}}}&amp;lt;/math&amp;gt; || &amp;lt;math&amp;gt;n\mapsto n+5&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
:: &#039;&#039;&#039;Edit:&#039;&#039;&#039; It turns out CatIsFluffy [https://github.com/CatsAreFluffy/metamath-turing-machines beat me to it]! I don&#039;t know how many states the BMS machine has, but [https://cosearch.bbchallenge.org/contribution/m5k4ulm8 BB(1094) &amp;gt; Loader&#039;s number], now down to [https://github.com/CatsAreFluffy/metamath-turing-machines/commit/85948b04fc4aeb983ca6d63d6aee5ad6ef308bfe BB(1015)]. [[User:C7X|C7X]] ([[User talk:C7X|talk]]) 11:37, 4 October 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
Who can design a [https://googology.fandom.com/wiki/Laver_table Laver table] q function level machine. --[[User:Jacobzheng|Jacobzheng]] ([[User talk:Jacobzheng|talk]]) 06:57, 13 February 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
: Me, probably. This 67-state TM should leave over q&amp;lt;sup&amp;gt;81&amp;lt;/sup&amp;gt;(q(5)-2) 1s on the tape (maybe i have an off-by-one or off-by-two error in the exponent of q but it&#039;s still iterated quite a few times):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
M = (&lt;br /&gt;
    ((1, 1, 1), (0, -1, 3)),&lt;br /&gt;
    ((0, -1, 2), (0, 1, 1)),&lt;br /&gt;
    ((1, 1, 0), (1, -1, 2)),&lt;br /&gt;
    ((0, -1, 4), (1, -1, 0)),&lt;br /&gt;
    ((0, -1, 2), (1, -1, 5)),&lt;br /&gt;
    ((0, 1, 26), (0, 1, 5)),&lt;br /&gt;
    ((1, -1, 57), (0, 1, 26)),&lt;br /&gt;
    ((0, 1, 38), (1, 1, 8)),&lt;br /&gt;
    ((0, 1, 9), (1, 1, 8)),&lt;br /&gt;
    ((0, 1, 62), (0, 1, 10)),&lt;br /&gt;
    ((0, -1, 16), (0, -1, 11)),&lt;br /&gt;
    ((1, -1, 12), (1, -1, 11)),&lt;br /&gt;
    ((0, 1, 15), (0, 1, 13)),&lt;br /&gt;
    ((1, 1, 14), (1, 1, 13)),&lt;br /&gt;
    ((0, -1, 16), (0, -1, 11)),&lt;br /&gt;
    ((0, 1, 10), (1, 1, 15)),&lt;br /&gt;
    ((1, -1, 33), (0, -1, 17)),&lt;br /&gt;
    ((1, -1, 18), (1, -1, 17)),&lt;br /&gt;
    ((0, -1, 19), (1, -1, 18)),&lt;br /&gt;
    ((0, -1, 20), (1, -1, 19)),&lt;br /&gt;
    ((0, 1, 22), (1, -1, 21)),&lt;br /&gt;
    ((1, 1, 21), (0, 1, 22)),&lt;br /&gt;
    ((0, 1, 23), (1, 1, 22)),&lt;br /&gt;
    ((1, -1, 24), (1, 1, 23)),&lt;br /&gt;
    ((1, -1, 30), (0, 1, 25)),&lt;br /&gt;
    ((1, -1, 26), (1, 1, 25)),&lt;br /&gt;
    ((0, 1, 6), (0, -1, 27)),&lt;br /&gt;
    ((0, -1, 28), (1, -1, 27)),&lt;br /&gt;
    ((0, -1, 29), (1, -1, 28)),&lt;br /&gt;
    ((1, -1, 20), (1, -1, 29)),&lt;br /&gt;
    ((1, 1, 32), (0, -1, 31)),&lt;br /&gt;
    ((1, -1, 32), (1, -1, 31)),&lt;br /&gt;
    ((0, 1, 7), (0, -1, 30)),&lt;br /&gt;
    ((0, -1, 34), (0, -1, 33)),&lt;br /&gt;
    ((0, -1, 34), (0, -1, 35)),&lt;br /&gt;
    ((0, 1, 37), (1, 1, 36)),&lt;br /&gt;
    ((0, 1, 36), (1, -1, 16)),&lt;br /&gt;
    ((0, 1, 37), (0, 1, 7)),&lt;br /&gt;
    ((0, 1, 39), (0, 1, 7)),&lt;br /&gt;
    ((0, -1, 44), (0, -1, 40)),&lt;br /&gt;
    ((0, -1, 41), (1, -1, 40)),&lt;br /&gt;
    ((1, 1, 42), (1, -1, 41)),&lt;br /&gt;
    ((0, 1, 43), (1, 1, 42)),&lt;br /&gt;
    ((1, 1, 39), (1, 1, 43)),&lt;br /&gt;
    ((0, -1, 45), (1, -1, 44)),&lt;br /&gt;
    ((0, -1, 47), (0, -1, 46)),&lt;br /&gt;
    ((1, -1, 45), (1, -1, 46)),&lt;br /&gt;
    ((1, -1, 47), (1, 1, 48)),&lt;br /&gt;
    ((0, -1, 49), (1, 1, 48)),&lt;br /&gt;
    ((0, 1, 56), (0, -1, 50)),&lt;br /&gt;
    ((0, 1, 49), (0, 1, 51)),&lt;br /&gt;
    ((1, 1, 52), (1, 1, 51)),&lt;br /&gt;
    ((0, -1, 55), (0, -1, 53)),&lt;br /&gt;
    ((1, -1, 54), (1, -1, 53)),&lt;br /&gt;
    ((0, 1, 51), (0, 1, 51)),&lt;br /&gt;
    ((0, -1, 50), (1, -1, 55)),&lt;br /&gt;
    ((1, -1, 57), (1, 1, 56)),&lt;br /&gt;
    ((1, -1, 61), (0, -1, 58)),&lt;br /&gt;
    ((1, 1, 59), (1, -1, 58)),&lt;br /&gt;
    ((0, -1, 60), (0, 1, 56)),&lt;br /&gt;
    ((1, 1, 61), (1, -1, 60)),&lt;br /&gt;
    ((1, -1, 66), (0, 1, 7)),&lt;br /&gt;
    ((0, 1, 63), (0, 1, 62)),&lt;br /&gt;
    ((0, 1, 63), (0, 1, 64)),&lt;br /&gt;
    ((0, -1, 65), (1, 1, -1)),&lt;br /&gt;
    ((0, -1, 65), (1, -1, 66)),&lt;br /&gt;
    ((0, -1, 40), (1, -1, 66))&lt;br /&gt;
)&lt;br /&gt;
&lt;br /&gt;
(start from state 0)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
: It could probably be optimized a bit more, because there are two parts that do basically the same thing and could probably be joined together, but it would cost a few extra states to then differentiate between which of them it was supposed to be, and i don&#039;t have time to do that right now.--[[User:Racheline|Racheline]] ([[User talk:Racheline|talk]]) 18:56, 13 February 2025 (UTC)&lt;br /&gt;
&lt;br /&gt;
== BB(51) epsilon_0 champion ==&lt;br /&gt;
Can you show the transitions of BB(51) on [[Large champions transitions]] page? --[[User:Jacobzheng|Jacobzheng]] ([[User talk:Jacobzheng|talk]]) 03:24, 3 September 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
: Here are the transitions and description from Racheline:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Σ(51) &amp;gt; (f_ε0)^8(f_ω^ω^3(a lot)) &amp;gt; f_ε0+1(8)&lt;br /&gt;
M = (&lt;br /&gt;
0:     ((1, -1, 0), (0, -1, 1)),&lt;br /&gt;
1:     ((1, -1, 0), (1, 1, 2)),&lt;br /&gt;
2:     ((1, -1, 2), (0, -1, 4)),&lt;br /&gt;
3:     ((0, -1, 10), (1, -1, 4)),&lt;br /&gt;
4:     ((0, -1, 3), (0, -1, 5)),&lt;br /&gt;
5:     ((1, -1, 4), (1, 1, 6)),&lt;br /&gt;
6:     ((1, -1, 7), (0, -1, 15)),&lt;br /&gt;
7:     ((0, -1, 8), (1, -1, 7)),&lt;br /&gt;
8:     ((0, -1, 9), (1, -1, 7)),&lt;br /&gt;
9:     ((1, 1, 11), (1, -1, 9)),&lt;br /&gt;
10:    ((0, -1, 20), (0, -1, 17)),&lt;br /&gt;
11:    ((0, 1, 12), (1, 1, 11)),&lt;br /&gt;
12:    ((0, 1, 13), (1, 1, 13)),&lt;br /&gt;
13:    ((1, -1, 14), (1, 1, 12)),&lt;br /&gt;
14:    ((0, -1, 6), (1, -1, 10)),&lt;br /&gt;
15:    ((0, -1, 16), (1, -1, 16)),&lt;br /&gt;
16:    ((1, -1, 20), (1, -1, 15)),&lt;br /&gt;
17:    ((0, -1, 18), (1, -1, 18)),&lt;br /&gt;
18:    ((1, 1, 19), (1, -1, 17)),&lt;br /&gt;
19:    ((1, -1, 19), (1, -1, 20)),&lt;br /&gt;
20:    ((0, -1, 50), (0, -1, 21)),&lt;br /&gt;
21:    ((0, 1, 43), (0, -1, 9)),&lt;br /&gt;
22:    ((0, 1, 22), (1, 1, 23)),&lt;br /&gt;
23:    ((1, 1, 26), (0, -1, 24)),&lt;br /&gt;
24:    ((1, -1, 25), (0, -1, 24)),&lt;br /&gt;
25:    ((1, 1, 25), (1, 1, 22)),&lt;br /&gt;
26:    ((0, 1, 50), (0, 1, 27)),&lt;br /&gt;
27:    ((1, 1, 26), (1, -1, 35)),&lt;br /&gt;
28:    ((0, 1, 29), (0, 1, 30)),&lt;br /&gt;
29:    ((0, -1, 4), (1, 1, 28)),&lt;br /&gt;
30:    ((1, -1, 31), (1, -1, 0)),&lt;br /&gt;
31:    ((0, -1, 32), (1, -1, 33)),&lt;br /&gt;
32:    ((0, -1, 33), (1, -1, 31)),&lt;br /&gt;
33:    ((0, -1, 34), (0, -1, 35)),&lt;br /&gt;
34:    ((0, -1, 37), (1, -1, 33)),&lt;br /&gt;
35:    ((1, 1, 36), (1, 1, 38)),&lt;br /&gt;
36:    ((0, 1, 37), (1, 1, 28)),&lt;br /&gt;
37:    ((0, -1, 29), (1, 1, 36)),&lt;br /&gt;
38:    ((1, 1, 38), (1, 1, 39)),&lt;br /&gt;
39:    ((0, 1, 38), (1, 1, 40)),&lt;br /&gt;
40:    ((0, 1, 41), (1, -1, 42)),&lt;br /&gt;
41:    ((1, -1, 49), (1, 1, 40)),&lt;br /&gt;
42:    ((1, 1, 36), (0, -1, 42)),&lt;br /&gt;
43:    ((0, 1, 44), (1, 1, 44)),&lt;br /&gt;
44:    ((1, -1, 45), (1, 1, 43)),&lt;br /&gt;
45:    ((0, -1, 46), (1, -1, 46)),&lt;br /&gt;
46:    ((0, 1, 22), (1, -1, 45)),&lt;br /&gt;
47:    ((1, -1, 41), (1, -1, 47)),&lt;br /&gt;
48:    ((0, -1, 47), (0, -1, 49)),&lt;br /&gt;
49:    ((1, -1, 22), (1, -1, 48)),&lt;br /&gt;
50:    ((0, -1, 48), (1, 1, halt))&lt;br /&gt;
)&lt;br /&gt;
 &lt;br /&gt;
(start from state 30)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
: I haven&#039;t investigated it yet. [[User:Sligocki|Sligocki]] ([[User talk:Sligocki|talk]]) 14:27, 3 September 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
:: It directly simulates Address Notation, which is a different way to write Primitive Sequence System (PrSS for short, it&#039;s 1-row Bashicu Matrix System). Here are the expansion rules of Address Notation:&lt;br /&gt;
::: Given a sequence &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; of natural numbers, to compute its expansion, start by letting &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt; be the last element of &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt;. If &amp;lt;math&amp;gt;c=0&amp;lt;/math&amp;gt;, then &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; is a successor and its predecessor is &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; without the last element. Otherwise, find the last element &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt; of &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; which is less than &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;. Decrease &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt; by &amp;lt;math&amp;gt;1&amp;lt;/math&amp;gt;, and let &amp;lt;math&amp;gt;B&amp;lt;/math&amp;gt; be everything in this new sequence after &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt;. Append infinitely many copies of &amp;lt;math&amp;gt;B&amp;lt;/math&amp;gt;.&lt;br /&gt;
:: Since the sequences are ordered lexicographically and each element decreases by &amp;lt;math&amp;gt;1&amp;lt;/math&amp;gt; until it is &amp;lt;math&amp;gt;0&amp;lt;/math&amp;gt;, for any fundamental sequence system where each &amp;lt;math&amp;gt;S[n]&amp;lt;/math&amp;gt; is formed by taking an initial subsequence of the expansion of &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; and changing the last element of that subsequence to a smaller or equal natural number, the ordinal notation given by the fundamental sequence system is the same. If i remember correctly, the TM simulates a variant &amp;lt;math&amp;gt;h&amp;lt;/math&amp;gt; of the Hardy Hierarchy with a fundamental sequence system where the FS of each standard &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; contains all sequences longer than &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; formed this way from its expansion (except for the first one or two).&lt;br /&gt;
:: Specifically,&lt;br /&gt;
::: &amp;lt;math&amp;gt;h_0(n)=n+c_0&amp;lt;/math&amp;gt;&lt;br /&gt;
::: &amp;lt;math&amp;gt;h_{\alpha+1}(n)=h_\alpha(n+c_1)&amp;lt;/math&amp;gt;&lt;br /&gt;
::: &amp;lt;math&amp;gt;h_\alpha(n)=h_{\alpha[n]}(c_2)&amp;lt;/math&amp;gt; for limit &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt;&lt;br /&gt;
::: &amp;lt;math&amp;gt;h_{\varepsilon_0}(n) = h_{(0,\lfloor\frac{n+c_3}{2}\rfloor)}(c_4) = h_{\omega\uparrow\uparrow\lfloor\frac{n+c_3}{2}\rfloor}(c_4)&amp;lt;/math&amp;gt;&lt;br /&gt;
:: for some constants &amp;lt;math&amp;gt;c_0,c_1,c_2,c_3,c_4&amp;lt;/math&amp;gt; for which the hierarchy is not degenerate (the constants can be deduced easily from the TM&#039;s space-time diagram). In particular, the non-degeneracy means that for most FGHs &amp;lt;math&amp;gt;f&amp;lt;/math&amp;gt; with &amp;quot;natural&amp;quot; FS systems, we will have &amp;lt;math&amp;gt;f_{\alpha+1}(n)&amp;lt;h_{\omega^{\alpha+1}}(n+k)&amp;lt;/math&amp;gt; for some small constant &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; (depending on &amp;lt;math&amp;gt;f&amp;lt;/math&amp;gt;), and as long as the FGH&#039;s FS system has &amp;lt;math&amp;gt;\varepsilon_0[n]\le\omega\uparrow\uparrow(n+c)&amp;lt;/math&amp;gt; for some constant &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;, we have &amp;lt;math&amp;gt;f_{\varepsilon_0}(n)&amp;lt;h_{\varepsilon_0}(2(n+c)+k)&amp;lt;/math&amp;gt; for some small constant &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; (also depending on &amp;lt;math&amp;gt;f&amp;lt;/math&amp;gt;. For example, the Wainer Hierarchy is one of these &amp;quot;natural&amp;quot; FGHs (and one of the most well-known ones at this level), and if we extend it to include &amp;lt;math&amp;gt;f_{\varepsilon_0}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;f_{\varepsilon_0+1}&amp;lt;/math&amp;gt; with the FS &amp;lt;math&amp;gt;\varepsilon_0[n]=\omega\uparrow\uparrow n&amp;lt;/math&amp;gt;, it does indeed satisfy &amp;lt;math&amp;gt;f_{\varepsilon_0}(n)&amp;lt;h_{\varepsilon_0}(2n+k)&amp;lt;/math&amp;gt; for small &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt;, which means that since the TM computes &amp;lt;math&amp;gt;h_{\varepsilon_0}^8(n)&amp;lt;/math&amp;gt; for a large &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;, its output is larger than &amp;lt;math&amp;gt;f_{\varepsilon_0+1}(8)&amp;lt;/math&amp;gt;. [[User:Racheline|Racheline]] ([[User talk:Racheline|talk]]) 19:06, 3 September 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
I think the bbchallenge can search BB(7) and BB(4,3) in the wild. --[[User:Jacobzheng|Jacobzheng]] ([[User talk:Jacobzheng|talk]]) 14:56, 30 October 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
: I have thought about writing a program that searches for Ackermann&#039;s worm-like behavior of TMs (or at least a program for exponential behavior), but I wouldn&#039;t be sure how to do it. [[User:C7X|C7X]] ([[User talk:C7X|talk]]) 22:07, 30 October 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
== Cloud search for busy beavers ==&lt;br /&gt;
We still lack a website for cloud search busy beaver functions. --[[User:Jacobzheng|Jacobzheng]] ([[User talk:Jacobzheng|talk]]) 07:07, 15 December 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
: In the case of distributed computing projects like Catalogue and Great Internet Mersenne Prime Search, it seems like those are distributed to divvy up a large finite amount of computation. I don&#039;t know much about searching for Busy Beavers (e.g. if there is such a thing as an automated process for finding accelerated simulators) but would distributed finite computation be able to help reduce holdout lists? [[User:C7X|C7X]] ([[User talk:C7X|talk]]) 09:05, 15 December 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
It may be able to search the busy beaver domain BB(7) or even larger more quickly. [[User:Jacobzheng|Jacobzheng]] ([[User talk:Jacobzheng|talk]]) 13:38, 15 December 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
: Certainly it could do something like direct simulation quickly, but is there a known way to automate more advanced techniques to look for long-running machines? [[User:C7X|C7X]] ([[User talk:C7X|talk]]) 22:17, 15 December 2024 (UTC)&lt;br /&gt;
::questions like these should be asked on discord. Few people look at this page.--[[User:Konkhra|Konkhra]] ([[User talk:Konkhra|talk]]) 06:10, 16 December 2024 (UTC)&lt;br /&gt;
&lt;br /&gt;
: Setup a BOINC project for bbchallenge, and use this for reducing holdouts list? -- [[User:Loader3229|Loader3229]] ([[User talk:Loader3229|talk]]) 13:34, 22 September 2026 (UTC)&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;diff=9748</id>
		<title>Lambda Calculus</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;diff=9748"/>
		<updated>2026-10-28T14:22:19Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Champions */ mathify&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Lambda calculus&#039;&#039;&#039; is a model of computation developed by Alonzo Church (of Church-Turing thesis fame) in 1932. If you are not familiar with lambda calculus and beta-reduction, it is recommended to start with [[wikipedia:Lambda_calculus|this article]].&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;BBλ&#039;&#039;&#039; is the [[Busy Beaver]] function for lambda calculus, where BBλ(n) is the maximum normal form size of any closed lambda term of size n (or 0 if no closed term of size n exists). Size is measured in bits using [https://tromp.github.io/cl/Binary_lambda_calculus.html Binary Lambda Calculus], a binary prefix-free encoding for all closed lambda calculus terms. Pioneered by John Tromp, BBλ is uncomputable, and therefore grows faster than any computable function. &lt;br /&gt;
&lt;br /&gt;
== Analogy to Turing machines ==&lt;br /&gt;
We evaluate terms by applying &#039;&#039;beta-reductions&#039;&#039; until they reach a &#039;&#039;normal form&#039;&#039;. As an analogy to [[Turing machines]]:&lt;br /&gt;
* &#039;&#039;Lambda terms&#039;&#039; are like TM configurations (tape + state + position).&lt;br /&gt;
* Applying &#039;&#039;beta-reduction&#039;&#039; to a term is like taking a TM step.&lt;br /&gt;
* A term is in &#039;&#039;normal form&#039;&#039; if no beta-reductions can be applied. This is like saying the term has halted.&lt;br /&gt;
* A term may or may not be reducible to a normal form. If it is, this is like saying the term halts.&lt;br /&gt;
* Determining whether a term is reducible to a normal form is an undecidable problem equivalent to the halting problem.&lt;br /&gt;
&lt;br /&gt;
Note: That unlike for Turing machines, evaluating lambda terms is non-deterministic. Specifically, there may be multiple beta-reductions possible in a given term. However, if a term can be reduced to a normal form, that normal form is unique. It is not possible to reduce the original term to any different normal form. A term is &#039;&#039;&#039;strongly normalizing&#039;&#039;&#039; if every beta-reduction sequence leads to this normal form and &#039;&#039;&#039;weakly normalizing&#039;&#039;&#039; if some sequence does (while others may diverge).&lt;br /&gt;
&lt;br /&gt;
== Proof of Uncomputability ==&lt;br /&gt;
The proof that BBλ(n) is uncomputable is very similar to Radó&#039;s original proof that Σ(n) is uncomputable. Proof by contradiction:&lt;br /&gt;
&lt;br /&gt;
Assume BBλ is computable and so there exists a term &#039;&#039;f&#039;&#039; which computes it on [[wikipedia:Church_encoding|Church numerals]]. In other words: for all &amp;lt;math&amp;gt;n \in \N&amp;lt;/math&amp;gt;: &amp;lt;math&amp;gt;(f \; C_n)&amp;lt;/math&amp;gt; beta reduces to normal form &amp;lt;math&amp;gt;C_{BB\lambda(n)}&amp;lt;/math&amp;gt; (where &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; denotes the Church numeral &#039;&#039;n&#039;&#039;). Denote the binary lambda encoded size of &#039;&#039;f&#039;&#039; as &#039;&#039;k&#039;&#039;. Consider the term &amp;lt;math&amp;gt;f \; (C_2 \; C_n)&amp;lt;/math&amp;gt; which has size &amp;lt;math&amp;gt;2+k+2+(5\times2+6)+(5n+6) = 5n + k + 26&amp;lt;/math&amp;gt; bits. This term reduces to &amp;lt;math&amp;gt;C_{BB\lambda(n^2)}&amp;lt;/math&amp;gt; which has size &amp;lt;math&amp;gt;5 \cdot BB\lambda(n^2) + 6&amp;lt;/math&amp;gt; bits. But for sufficiently large n, &amp;lt;math&amp;gt;n^2 &amp;gt; 5n + k + 26&amp;lt;/math&amp;gt; and so BBλ(5n+k+26) ≥ 5×BBλ(n²)+6 &amp;gt; BBλ(5n+k+26). But this is a contradiction, we&#039;ve found a &amp;lt;math&amp;gt;5n + k + 26&amp;lt;/math&amp;gt; bit term which reduces to a normal form larger than &amp;lt;math&amp;gt;BB\lambda(5n + k + 26)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Thus BBλ(n) is uncomputable. A variation of this argument shows that BBλ(n) eventually dominates all computable functions.&lt;br /&gt;
&lt;br /&gt;
== Binary Lambda Encoding ==&lt;br /&gt;
A lambda term using [https://en.wikipedia.org/wiki/De_Bruijn_indices De Bruijn indexes] is defined inductively as:&lt;br /&gt;
* Variables: For any &amp;lt;math&amp;gt;n \in \mathbb{Z}^+&amp;lt;/math&amp;gt;, Var(&#039;&#039;n&#039;&#039;) is a term. It represents a variable bound by the lambda expression &#039;&#039;n&#039;&#039; above this one (the De Bruijn index). It is typically written simply as &amp;lt;code&amp;gt;n&amp;lt;/code&amp;gt;.&lt;br /&gt;
* Lambdas: For any term &#039;&#039;T&#039;&#039;, Lam(&#039;&#039;T&#039;&#039;) is a term. It represents a unary function with function body &#039;&#039;T&#039;&#039;. It is typically written &amp;lt;math&amp;gt;\lambda T&amp;lt;/math&amp;gt; or &amp;lt;code&amp;gt;\T&amp;lt;/code&amp;gt;.&lt;br /&gt;
* Applications: For any terms &#039;&#039;T, U&#039;&#039;, App(&#039;&#039;T, U&#039;&#039;) is a term. It represents applying function &#039;&#039;T&#039;&#039; to argument &#039;&#039;U&#039;&#039;. It is typically written &amp;lt;code&amp;gt;(T U)&amp;lt;/code&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
We can think of this as a tree where each variable is a leaf, a lambda is a node with one child and applications are nodes with 2 children. A term is &#039;&#039;&#039;closed&#039;&#039;&#039; if every variable is bound. In other words, for every Var(&#039;&#039;n&#039;&#039;) leaf node, there exists &#039;&#039;n&#039;&#039; Lam() nodes above it in the tree of the term.&lt;br /&gt;
&lt;br /&gt;
Encoding (&#039;&#039;blc()&#039;&#039;) is defined recursively:&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{l}&lt;br /&gt;
  blc(Var(n)) &amp;amp; = &amp;amp; 1^n 0 \\&lt;br /&gt;
  blc(Lam(T)) &amp;amp; = &amp;amp; 00 \; blc(T) \\&lt;br /&gt;
  blc(App(T, U)) &amp;amp; = &amp;amp; 01 \; blc(T) \; blc(U) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For example, the [https://en.wikipedia.org/wiki/Church_encoding#Church_numerals Church numeral] 2: &amp;lt;math&amp;gt;\lambda f x. (f \; (f \; x))&amp;lt;/math&amp;gt; =  &amp;lt;code&amp;gt;\\(2 (2 1))&amp;lt;/code&amp;gt; = &amp;lt;code&amp;gt;Lam(Lam(App(Var(2), App(Var(2), Var(1))))&amp;lt;/code&amp;gt; is encoded as &amp;lt;code&amp;gt;00 00 01 110 01 110 10&amp;lt;/code&amp;gt; or simply &amp;lt;code&amp;gt;0000011100111010&amp;lt;/code&amp;gt; (spaces are not part of the encoding, only used for demonstration purposes) and thus has size 16 bits.&lt;br /&gt;
&lt;br /&gt;
== Text Encoding conventions ==&lt;br /&gt;
For human readability, a text encoding and set of conventions is used in this article. As described earlier we encode a lambda term as:&lt;br /&gt;
* Var(&#039;&#039;n&#039;&#039;) -&amp;gt; &amp;lt;code&amp;gt;n&amp;lt;/code&amp;gt;&lt;br /&gt;
* Lam(&#039;&#039;T&#039;&#039;) -&amp;gt; &amp;lt;code&amp;gt;(\T)&amp;lt;/code&amp;gt;&lt;br /&gt;
* App(&#039;&#039;T, U&#039;&#039;) -&amp;gt; &amp;lt;code&amp;gt;(T U)&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
However, parentheses are also dropped in certain cases by convention:&lt;br /&gt;
* The outermost parentheses are dropped: &amp;lt;code&amp;gt;Lam(1)&amp;lt;/code&amp;gt; -&amp;gt; &amp;lt;code&amp;gt;\1&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;App(1, 2)&amp;lt;/code&amp;gt; -&amp;gt; &amp;lt;code&amp;gt;1 2&amp;lt;/code&amp;gt;.&lt;br /&gt;
* Parentheses are dropped immediately inside a Lam: &amp;lt;code&amp;gt;Lam(Lam(1))&amp;lt;/code&amp;gt; -&amp;gt; &amp;lt;code&amp;gt;\\1&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;Lam(App(1, 1))&amp;lt;/code&amp;gt; -&amp;gt; &amp;lt;code&amp;gt;\1 1&amp;lt;/code&amp;gt;.&lt;br /&gt;
* Parentheses are dropped in nested Apps using left associativity: &amp;lt;code&amp;gt;App(App(1, 2), 3)&amp;lt;/code&amp;gt; -&amp;gt; &amp;lt;code&amp;gt;1 2 3&amp;lt;/code&amp;gt;. (Note: parentheses are still required for &amp;lt;code&amp;gt;App(1, App(2, 3))&amp;lt;/code&amp;gt; -&amp;gt; &amp;lt;code&amp;gt;1 (2 3)&amp;lt;/code&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
This is the convention used in John Tromp&#039;s code and so is used here for consistency.&lt;br /&gt;
&lt;br /&gt;
== Champions ==&lt;br /&gt;
There are no closed lambda terms of size 0, 1, 2, 3 or 5 and so BBλ(n) = 0 for those values.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;C(n)&amp;lt;/math&amp;gt; denotes Church numeral &#039;&#039;n&#039;&#039; = &amp;lt;math&amp;gt;\lambda s\lambda z. s^n(z)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
In the last column, JT and BF abbreviate John Tromp and Bertram Felgenhauer.&lt;br /&gt;
&lt;br /&gt;
We use the ordinal collapsing functions defined by Buchholz (1986). It is suspected (though not yet confirmed) that we used the fundamental sequences described by Maksudov (2017), or, in the case of lim(BMS), the sequence lim(BMS)[n] = BMS((0)(1,1,...,1)) w/n 1s.&lt;br /&gt;
&lt;br /&gt;
The [https://discord.com/channels/960643023006490684/1355653587824283678/1493455967868817429 smallest cryptid currently known] (&amp;lt;code&amp;gt;\1111(\1)1(\\1))(\\\1(322222)&amp;lt;/code&amp;gt;) has 74 bits.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Small Champions&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!BBλ(n)&lt;br /&gt;
!Champion&lt;br /&gt;
!Normal form&lt;br /&gt;
!Discovered By&lt;br /&gt;
|-&lt;br /&gt;
| 4 || = 4 || &amp;lt;math&amp;gt;\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 6 || = 6 || &amp;lt;math&amp;gt;\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 7 || = 7 || &amp;lt;math&amp;gt;\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 8 || = 8 || &amp;lt;math&amp;gt;\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 9 || = 9 || &amp;lt;math&amp;gt;\lambda\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 10 || = 10 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 11 || = 11 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 12 || = 12 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 13 || = 13 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 14 || = 14 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 15 || = 15 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 16 || = 16 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 17 || = 17 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|18&lt;br /&gt;
|= 18&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|19&lt;br /&gt;
|= 19&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|20&lt;br /&gt;
|= 20&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!BBλ(n)&lt;br /&gt;
!Champion&lt;br /&gt;
!Normal form&lt;br /&gt;
!Discovered By&lt;br /&gt;
|-&lt;br /&gt;
|21 || = 22 || &amp;lt;math&amp;gt;\lambda(\lambda 1 1) (1 (\lambda 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda(1(\lambda 2))(1(\lambda 2))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|22 || = 24 || &amp;lt;math&amp;gt;\lambda(\lambda 1 1 1) (1 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda(1 1) (1 1) (1 1)&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|23 || = 26 || &amp;lt;math&amp;gt;\lambda(\lambda 1 1) (1 (\lambda\lambda 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda(1 (\lambda\lambda 2)) (1 (\lambda\lambda 2))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|24 || = 30 || &amp;lt;math&amp;gt;\lambda(\lambda 1 1 1) (1 (\lambda 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda(1 (\lambda 1)) (1 (\lambda 1)) (1 (\lambda 1))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|25 || = 42 || &amp;lt;math&amp;gt;\lambda(\lambda 1 1) (\lambda 1 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda 1 (\lambda 1 (2 1)) (1 (1 (\lambda 1 (2 1))))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|26 || = 52 || &amp;lt;math&amp;gt;(\lambda 1 1) (\lambda\lambda 2 (1 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda\lambda 2 (\lambda\lambda 2 (1 2)) (1 (2 (\lambda\lambda 2 (1 2))))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|27 || = 44 || &amp;lt;math&amp;gt;\lambda\lambda(\lambda 1 1) (\lambda 1 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda\lambda 1 (\lambda 1 (2 1)) (1 (1 (\lambda 1 (2 1))))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|28 || = 58 || &amp;lt;math&amp;gt;\lambda(\lambda 1 1) (\lambda 1 (2 (\lambda 2))))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda 1 (\lambda\lambda 1 (3 (\lambda 2))) (1 (\lambda 2 (\lambda\lambda 1 (4 (\lambda 2)))))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 29 || = 223|| &amp;lt;math&amp;gt;\lambda(\lambda 1 1) (\lambda 1 (1 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda B (B (1 B)) \text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;B = (A (A (1 A)))&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;A = (1 (\lambda 1 (1 (2 1))))&amp;lt;/math&amp;gt;&lt;br /&gt;
||JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|30&lt;br /&gt;
|= 160&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 1) (\lambda\lambda 2 (1 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
&amp;lt;math&amp;gt;\lambda\lambda 2 B A (1 (2 B A)) \text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;B = (\lambda\lambda 2 A (1 (2 A)))&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;A = (\lambda\lambda 2 (1 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|31&lt;br /&gt;
|= 267&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1) (\lambda\lambda 2 (2 (1 2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
&amp;lt;math&amp;gt;\lambda\lambda 2 A (2 A (C (2 A))) \text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;C = (2 A (2 A (1 B (2 A))))&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;B = (\lambda 3 A (3 A (1 (3 A))))&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;A = (\lambda\lambda 2 (2 (1 2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|32&lt;br /&gt;
|= 298&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda(\lambda 1 1) (\lambda 1 (1 (2 (\lambda 2))))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|33&lt;br /&gt;
|= 1812&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda(\lambda 1 1) (\lambda 1 (1 (1 (2 1))))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
&amp;lt;math&amp;gt;\lambda C (C (C (1 C))) \text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;C = (B (B (B (1 B)))&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;B = (A (A (A (1 A)))&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;A = (1 (\lambda 1 (1 (1 (2 1)))))&amp;lt;/math&amp;gt;&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|34 || = 327686&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;C(2^{2^{2^2}})&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|35 || &amp;lt;math&amp;gt;= 5 \cdot 3^{3^3} + 6&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt; &amp;gt; 3.8 \times 10^{13}&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1) (\lambda\lambda 2 (2 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;C(3^{3^3})&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|36 || &amp;lt;math&amp;gt;= 5 \cdot 2^{2^{2^3}} + 6 &amp;gt; 5.7 \times 10^{77}&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1) (\lambda 1 (1 (\lambda\lambda 2 (2 1))))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;C(2^{2^{2^3}})&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|37 || &amp;lt;math&amp;gt; = 2 + BB\lambda(35)&amp;lt;/math&amp;gt;&lt;br /&gt;
|  &amp;lt;math&amp;gt;\lambda(\lambda 1 1 1) (\lambda\lambda 2 (2 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda x. C(3^{3^3})&amp;lt;/math&amp;gt;||mxdys &amp;amp; JT &amp;amp; dyuan &amp;amp; sligocki&lt;br /&gt;
|-&lt;br /&gt;
|38 || &amp;lt;math&amp;gt;= 5\cdot{2^{2^{2^{2^2}}}} + 6 &amp;gt; 10^{19,729}&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1 1 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;C(2^{2^{2^{2^2}}})&amp;lt;/math&amp;gt;|| JT &amp;amp; BF &amp;amp; CppDS &amp;amp; mxdys &amp;amp; sligocki &amp;amp; dyuan &amp;amp; charles&lt;br /&gt;
|-&lt;br /&gt;
|39 || &amp;lt;math&amp;gt;= 5\cdot{3^{3^{3^3}}} + 6 &amp;gt; 10^{10^{12}}&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1 1) (\lambda\lambda 2 (2 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;C(3^{3^{3^3}})&amp;lt;/math&amp;gt;|| JT &amp;amp; BF &amp;amp; CppDS &amp;amp; mxdys &amp;amp; sligocki &amp;amp; dyuan &amp;amp; charles &amp;amp; 2014MELO &amp;amp; mammilaria&lt;br /&gt;
|-&lt;br /&gt;
|40 || &amp;lt;math&amp;gt; \approx 10 \uparrow\uparrow\uparrow 16&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1) (\lambda 1 (\lambda\lambda 2 (2 1)) 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda x.T(k)\text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;T(0)=x&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;T(n+1)=T(n)\;C(2)\;T(n)&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;k &amp;gt; (2\uparrow\uparrow)^{15} 33&amp;lt;/math&amp;gt;&lt;br /&gt;
|| mxdys &amp;amp; racheline&lt;br /&gt;
|-&lt;br /&gt;
|41 || &amp;lt;math&amp;gt;= 5 \times 3^{3^{85}} +6 &amp;gt; 10^{1.7 \times 10^{40}} \approx 10^{10^{40}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|  &amp;lt;math&amp;gt;(\lambda 1 (\lambda 1 1) 1) (\lambda\lambda 2 (2 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;C(3^{3^{85}})&amp;lt;/math&amp;gt;||mxdys&lt;br /&gt;
|-&lt;br /&gt;
|42 ||&amp;lt;math&amp;gt; \ge 2 + BB\lambda(40)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda(\lambda 1 1 1) (\lambda 1 (\lambda\lambda 2 (2 1)) 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
| ||&lt;br /&gt;
|-&lt;br /&gt;
|43 ||&amp;lt;math&amp;gt;&amp;gt; 2 \uparrow\uparrow\uparrow 2 \uparrow\uparrow\uparrow (\frac{2 \uparrow\uparrow 8}{2})&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1) (\lambda 1 (\lambda 1 (\lambda\lambda 2 (2 1)) 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda x.T(k)\text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;T(0)=x&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;T(n+1)=T(n)\;(\lambda y.y\;C(2)\;T(n))&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;k &amp;gt; 2 \uparrow\uparrow\uparrow 2 \uparrow\uparrow\uparrow (\frac{2 \uparrow\uparrow 8}{2})&amp;lt;/math&amp;gt;&lt;br /&gt;
||mxdys&lt;br /&gt;
|-&lt;br /&gt;
|44 || &amp;lt;math&amp;gt; &amp;gt; 10 \uparrow\uparrow\uparrow 10 \uparrow\uparrow\uparrow 16&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1 1) (\lambda 1 (\lambda\lambda 2 (2 1)) 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda x.T(k)\text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;T(0)=x&amp;lt;/math&amp;gt;,&lt;br /&gt;
&amp;lt;math&amp;gt;T(n+1)=T(n)\;C(2)\;T(n)&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;k &amp;gt; (2\uparrow\uparrow)^{(2\uparrow\uparrow)^{15} 33 - 1} 33&amp;lt;/math&amp;gt;&lt;br /&gt;
||&lt;br /&gt;
|-&lt;br /&gt;
|45 || &amp;lt;math&amp;gt; \ge 2 + BB\lambda(43)&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda(\lambda 1 1) (\lambda 1 (\lambda 1 (\lambda\lambda 2 (2 1)) 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
| ||&lt;br /&gt;
|-&lt;br /&gt;
|46 || &amp;lt;math&amp;gt; \ge 2 + BB\lambda(44)&amp;lt;/math&amp;gt;&lt;br /&gt;
|  &amp;lt;math&amp;gt;\lambda(\lambda 1 1 1 1) (\lambda 1 (\lambda\lambda 2 (2 1)) 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
| ||&lt;br /&gt;
|-&lt;br /&gt;
|47 || &amp;lt;math&amp;gt;&amp;gt; f_{\omega}\left(f_{5}\left(2\right)\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|  &amp;lt;math&amp;gt;(\lambda 1 1 1)(\lambda\lambda 1 (1 2) (\lambda\lambda 2 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
| ||50_ft_lock&lt;br /&gt;
|-&lt;br /&gt;
|48 || &amp;lt;math&amp;gt; &amp;gt; 10 \uparrow\uparrow\uparrow\uparrow 4&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1 1 1) (\lambda 1 (\lambda\lambda 2 (2 1)) 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda x.T(k)&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;T(0)=x,\;T(n+1)=T(n)\;C(2)\;T(n)&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;k &amp;gt; (2\uparrow\uparrow)^{(2\uparrow\uparrow)^{(2\uparrow\uparrow)^{15} 33 - 1} 33 - 1} 33&amp;lt;/math&amp;gt;||&lt;br /&gt;
|-&lt;br /&gt;
|49&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}\left(\frac{2 \uparrow\uparrow 6}{2}\right)&amp;lt;/math&amp;gt; &amp;gt; Graham&#039;s number&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1) (\lambda 1 (1 (\lambda\lambda 1 2 (\lambda\lambda 2 (2 1)))))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;C(f_{\omega+1}\left(\frac{2 \uparrow\uparrow 6}{2}\right) )&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/melo.lam Gustavo Melo]&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|61&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^{2 \uparrow\uparrow 18-1}}\left(2\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 1) (\lambda 1 (1 (\lambda\lambda\lambda 1 3 2 (\lambda\lambda 2 (2 1)))))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;C(f_{\omega^{2 \uparrow\uparrow 18-1}}\left(2\right) )&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://tromp.github.io/blog/2026/01/28/largest-number-revised 50_ft_lock]&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|70&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^{\omega}2}\left(f_{\omega^{\omega}}\left(f_{\omega^{\omega}}\left(3\right)\right)\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 (\lambda 1 (\lambda\lambda\lambda 1 3 2 5) 2) 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Gustavo Melo &amp;amp; 50_ft_lock &amp;amp; Sam Bolsover&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|74&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^{\omega}2 + 1}\left(7\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 1 (\lambda 1 (\lambda\lambda\lambda 1 3 2 5) 2) 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Gustavo Melo &amp;amp; 50_ft_lock &amp;amp; Sam Bolsover&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|76&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^{\omega^{3}}}(2)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda11(\lambda\lambda\lambda\lambda14321)1111)(\lambda\lambda2(21))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;C(f_{\omega^{\omega^{3}}}(2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|77&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^{\omega2}}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda1(\lambda\lambda\lambda\lambda14321)1111)(\lambda\lambda2(2(21)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;C(f_{\omega^{\omega2}}(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|80&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt;f_{\omega^{\omega^{14}}}(2)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda111(\lambda\lambda\lambda\lambda14321)1111)(\lambda\lambda2(21))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;C(f_{\omega^{\omega^{14}}}(2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|82&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^{\omega^{\omega}}}(2\uparrow\uparrow\uparrow\uparrow18)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda1(\lambda1(\lambda\lambda\lambda\lambda14321)1111)1)(\lambda\lambda2(21))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;C(f_{\omega^{\omega^{\omega}}}(2\uparrow\uparrow\uparrow\uparrow18))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|90&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\zeta_0}\left(15\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 (\lambda\lambda\lambda\lambda 1 4 4 4 3 2 1) 1 1 1 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|[https://docs.google.com/document/d/1xlzaEQGarqnCocf4R2UWfqE3ck8YF_P32CmYxGXLhAI/edit?tab=t.0 Patcail]&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|94&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi(\Omega_\omega)}\left(12\right)&amp;lt;/math&amp;gt; &amp;gt; TREE(G64)&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 1 (\lambda\lambda\lambda\lambda 1 4 4 4 3 2 1) 1 1 1 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|[https://docs.google.com/document/d/1xlzaEQGarqnCocf4R2UWfqE3ck8YF_P32CmYxGXLhAI/edit?tab=t.0 Patcail]&lt;br /&gt;
|-&lt;br /&gt;
|95&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi(\Omega_\omega)}\left(23\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 (\lambda\lambda\lambda\lambda 1 4 4 4 3 2 1) 1 1 1 1) (\lambda\lambda 2 (2 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|[https://docs.google.com/document/d/1xlzaEQGarqnCocf4R2UWfqE3ck8YF_P32CmYxGXLhAI/edit?tab=t.0 Patcail]&lt;br /&gt;
|-&lt;br /&gt;
|96&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi(\Omega_\omega)}\left(f_{\omega^{\omega^{2}}}\left(2\right)\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 (\lambda 1 (\lambda\lambda\lambda\lambda 1 4 4 4 3 2 1) 1 1 1 1) 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|[https://docs.google.com/document/d/1xlzaEQGarqnCocf4R2UWfqE3ck8YF_P32CmYxGXLhAI/edit?tab=t.0 Patcail]&lt;br /&gt;
|- ||||||-&lt;br /&gt;
|100&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi(\Omega_\omega)+1}\left(4\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 (\lambda 1 (\lambda\lambda\lambda\lambda 1 4 4 4 3 2 1) 1 1 1 1) 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|[https://docs.google.com/document/d/1xlzaEQGarqnCocf4R2UWfqE3ck8YF_P32CmYxGXLhAI/edit?tab=t.0 Patcail]&lt;br /&gt;
|- ||||||-&lt;br /&gt;
|201&lt;br /&gt;
| &amp;gt; q(5) &lt;br /&gt;
|too large to show&lt;br /&gt;
|q is only proven to exceed all functions provably recursive in PA; the true value is likely much larger based on informal analysis&lt;br /&gt;
|[https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/laver.lam JT &amp;amp; BF &amp;amp; 50_ft_lock]&lt;br /&gt;
|- ||||||-&lt;br /&gt;
|331&lt;br /&gt;
| &amp;gt; f&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt;&amp;lt;sub&amp;gt;lim(BMS)&amp;lt;/sub&amp;gt;(5)&lt;br /&gt;
|too large to show&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/bms.lam Patcail &amp;amp; JT &amp;amp; 50_ft_lock]&lt;br /&gt;
|- ||||||-&lt;br /&gt;
|1797&lt;br /&gt;
|&amp;gt; D⁵(99) = Loader&#039;s number&lt;br /&gt;
|too large to show&lt;br /&gt;
|&lt;br /&gt;
|[https://codegolf.stackexchange.com/questions/176966/golf-a-number-bigger-than-loaders-number/274634#274634 JT &amp;amp; BF &amp;amp; DropperAUGL]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Optimal Busy Beaver ==&lt;br /&gt;
&lt;br /&gt;
A closely related BBλ2 function, defined as OEIS sequence (A361211)[https://oeis.org/A361211], allows the lambda term access to (undelimited) raw binary data, which suffices to make it an optimal busy beaver function amongst all binary self-delimiting ones.&lt;br /&gt;
&lt;br /&gt;
== Oracle Busy Beaver ==&lt;br /&gt;
While BBλ grows uncomputably fast, one can define functions that grow much faster.&lt;br /&gt;
&lt;br /&gt;
Let&#039;s define a higher order busy beaver function BBλ&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; by providing oracle access to BBλ.&lt;br /&gt;
&lt;br /&gt;
This is done by enriching the set of terms and possible reduction steps considered in the BB definition.&lt;br /&gt;
&lt;br /&gt;
A 1-closed term is a term in de Bruijn notation that is closed with 1 additional lambda in front. Any variable bound to that lambda is a free variable &#039;&#039;&#039;f&#039;&#039;&#039; in the term.&lt;br /&gt;
&lt;br /&gt;
An oracle reduction step reduces &#039;&#039;&#039;f&#039;&#039;&#039; t, where t is a closed normal form of size s, to Church numeral BBλ(s).&lt;br /&gt;
&lt;br /&gt;
Note that this is almost identical to the oracle steps in Barendregt and Klop&#039;s &amp;quot;Applications of infinitary lambda calculus&amp;quot;, except that they require t itself to be a church numeral. Allowing arbitrary closed t makes oracle steps more widely applicable while aligning with BBλ&#039;s focus on term sizes.&lt;br /&gt;
&lt;br /&gt;
Now let BBλ&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; be the maximum beta/oracle normal form size of any 1-closed lambda term of size n, or 0 if no 1-closed term of size n exists. This appears as sequence [[oeis:A385712|A385712]]  in the OEIS.&lt;br /&gt;
&lt;br /&gt;
The following table shows values of BBλ&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; up to 22 plus a lower bound for 28, with larger values expressed in terms of function &amp;lt;math&amp;gt;f(n) = 6 + 5 \times BB \lambda(n)&amp;lt;/math&amp;gt;: &lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!Champion&lt;br /&gt;
!BBλ&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|1&lt;br /&gt;
|&lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|2&lt;br /&gt;
|&amp;lt;math&amp;gt;1&amp;lt;/math&amp;gt;&lt;br /&gt;
|1&lt;br /&gt;
|-&lt;br /&gt;
|3&lt;br /&gt;
|&lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|4&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|4&lt;br /&gt;
|-&lt;br /&gt;
|5&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|5&lt;br /&gt;
|-&lt;br /&gt;
|6&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda \lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|6&lt;br /&gt;
|-&lt;br /&gt;
|7&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda \lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|7&lt;br /&gt;
|-&lt;br /&gt;
|8&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f(4) = 26&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|9&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda \lambda \lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|9&lt;br /&gt;
|-&lt;br /&gt;
|10&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda \lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f(6) = 36&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|11&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda \lambda 2)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f(7) = 41&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|12&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (\lambda 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^{2}(4) = 266&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|13&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda \lambda 2)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f(9) = 51&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|14&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (\lambda \lambda 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^{2}(6) = f(36) = 25 \times 2^{2^{2^{3}}}+36 &amp;gt; 2.85 \times 10^{78}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|15&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (\lambda \lambda 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^{2}(7) = f(41) = 25 \times 3^{3^{85}}+36 &amp;gt; 10^{10^{40}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|16&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (1 (\lambda 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^{3}(4) = f(266)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|17&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (\lambda \lambda \lambda 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^2(9) = f(51)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|18&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda 1) 1 (\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^4(4) &amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|19&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (1 (\lambda \lambda 2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^3(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|20&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda \lambda 1) 1 (\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^6(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|21&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda \lambda 2) 1 (\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^7(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|22&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (\lambda 1)) 1 (\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^{26}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|28&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda 1) 1 (\lambda 1) 1 (\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\ge f^{BB \lambda(f^3(4))}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|29&lt;br /&gt;
|&amp;lt;math&amp;gt;1(\lambda 1)(\lambda 1 2 1)(\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\ge f^{BB \lambda(f^{BB \lambda(f^4(4))+4}(4))+BB \lambda(f^4(4))+5}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
We can generalize BBλ&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; to BBλ&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt; for ordinals α by using oracle function BBλ&amp;lt;sub&amp;gt;α-1&amp;lt;/sub&amp;gt; for successor ordinal α, and oracle function (\n -&amp;gt; BBλ&amp;lt;sub&amp;gt;α[n]&amp;lt;/sub&amp;gt;(n)) for limit ordinal α, assuming well-defined fundamental sequences up to α. Because of limited oracle inputs, all oracle busy beavers have identical values up to n=11.&lt;br /&gt;
&lt;br /&gt;
== See Also ==&lt;br /&gt;
* [[Busy Beaver for SKI calculus|SKI calculus]]&lt;br /&gt;
* [[De Bruijn index]]&lt;br /&gt;
* https://oeis.org/A333479&lt;br /&gt;
* [https://www.mdpi.com/1099-4300/28/5/494 The Largest Number Representable in 64 Bits]. 26 Apr 2026. John Tromp.&lt;br /&gt;
* [https://gist.github.com/tromp/86b3184f852f65bfb814e3ab0987d861 Binary Lambda Calculus]. John Tromp.&lt;br /&gt;
* https://github.com/tromp/AIT/tree/master/BB&lt;br /&gt;
* https://github.com/ccz181078/BLC.git&lt;br /&gt;
* https://docs.google.com/spreadsheets/d/1jZ6TK9m3xmXUlC69727T-8WwvhALcsp8FrK6DzgThtw&lt;br /&gt;
* Buchholz, W. (1986). A new system of proof-theoretic ordinal functions. &#039;&#039;Annals of Pure and Applied Logic, 32&#039;&#039;, 195-207. https://doi.org/10.1016/0168-0072(86)90052-7&lt;br /&gt;
* Maksudov, D. (2017, April). &#039;&#039;Travelling To The Infinity - The extended Wilfried Buchholz&#039;s functions.&#039;&#039; Travelling To The Infinity. https://sites.google.com/site/travelingtotheinfinity/the-extension-of-buchholz-s-function&lt;br /&gt;
[[category:Functions]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Register_machine&amp;diff=9747</id>
		<title>Register machine</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Register_machine&amp;diff=9747"/>
		<updated>2026-10-28T14:17:00Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* MBB(8): Space Needle variants */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Register machines&#039;&#039;&#039;, also known as &#039;&#039;&#039;Minsky machines&#039;&#039;&#039;, are a [[Turing complete|Turing-complete]] model of computation.&lt;br /&gt;
&lt;br /&gt;
Register machines contain a set of instructions and a set of registers. The instructions are labelled A, B, C, and so on. The registers are numbered 0, 1, 2, and so on. There are 2 types of instructions:&lt;br /&gt;
&lt;br /&gt;
* inc(c, n) adds 1 to the register c then jumps to instruction n.&lt;br /&gt;
* dec(c, n, m) jumps to instruction m if register c equals 0, else subtract 1 to the register c then jump to instruction n.&lt;br /&gt;
&lt;br /&gt;
The program halts if it reaches an undefined instruction. Here we label an undefined instruction with &amp;lt;code&amp;gt;*&amp;lt;/code&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
== Register Busy Beaver ==&lt;br /&gt;
The Register Busy Beaver function, denoted MBB(n,r), returns the maximum number of instructions executed by a register machine with n instructions and r registers when started in instruction A and all registers initialized to 0. MBB(n) = MBB(n,n) (unlimited registers).&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Domain&lt;br /&gt;
!Halting Time&lt;br /&gt;
!Champion&lt;br /&gt;
|-&lt;br /&gt;
|MBB(1)&lt;br /&gt;
|1&lt;br /&gt;
|&amp;lt;code&amp;gt;0+*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(2)&lt;br /&gt;
|3&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(3)&lt;br /&gt;
|5&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0-C*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(4)&lt;br /&gt;
|10&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1+C_0-BD_1-C*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(5)&lt;br /&gt;
|24&lt;br /&gt;
|&amp;lt;code&amp;gt;0-DB_0+C_1-ED_1+A_1-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(6)&lt;br /&gt;
|49&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1-FC_1+D_0-CE_0+A_1-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(7)&lt;br /&gt;
|231&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_0+D_1-GE_1+F_0-EC_1-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(8)&lt;br /&gt;
|≥ 3,394&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_1-GD_1+E_0-DF_2-HG_2+A_2-D*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(9)&lt;br /&gt;
|&amp;gt; 4.493 × 10&amp;lt;sup&amp;gt;74&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_0+C_1-HD_0-EG_0-FI_1+D_2+H_0+A_2-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(10)&lt;br /&gt;
|&amp;gt; 10↑↑4.03&lt;br /&gt;
|&amp;lt;code&amp;gt;0+B_1-AC_2-ED_1+E_1+F_0-DG_2-JH_2+I_1-HE_2-A*&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|MBB(11)&lt;br /&gt;
|&amp;gt; 10↑↑17.74&lt;br /&gt;
|&amp;lt;code&amp;gt;0-KB_1-IC_1+D_1+E_2-CF_0-AG_0+H_1-GI_2+J_2+B_0-B*&amp;lt;/code&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Analysis ==&lt;br /&gt;
MBB(7):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(x) = A:[x, 0]&lt;br /&gt;
A(2x) -&amp;gt; 9x+20 -&amp;gt; A(3x+4)&lt;br /&gt;
A(2x+1) -&amp;gt; 9x+27 -&amp;gt; halt&lt;br /&gt;
&lt;br /&gt;
A(0) -&amp;gt; 20 -&amp;gt; A(4) -&amp;gt; 38 -&amp;gt; A(10) -&amp;gt; 65 -&amp;gt; A(19) -&amp;gt; 108 -&amp;gt; halt&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(8):&lt;br /&gt;
&amp;lt;pre&amp;gt;Let S(z) = F:[0, 2z+1, z]&lt;br /&gt;
S(2k) -&amp;gt; 44k+19 -&amp;gt; S(5k+2)&lt;br /&gt;
S(2k+1) -&amp;gt; 4k+2 -&amp;gt; halt&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] -&amp;gt; 44 -&amp;gt; S(4) -&amp;gt; 107 -&amp;gt; S(12) -&amp;gt; 283 -&amp;gt; S(32) -&amp;gt; 723 -&amp;gt;  S(82) -&amp;gt; 1823 -&amp;gt; S(207) -&amp;gt; 414 -&amp;gt; halt&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(9):&lt;br /&gt;
&amp;lt;pre&amp;gt;Let A(x, y) = D:[x, 0, y]&lt;br /&gt;
A(2k, y) --(7k + 6)--&amp;gt; A(3k + 3, y + 1)&lt;br /&gt;
A(2k + 1, y + 1) --(7k + 5)--&amp;gt; A(3k + 1, y)&lt;br /&gt;
A(2k + 1, 0) --(3k + 3)--&amp;gt; *:[0, k, 0]&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0]&lt;br /&gt;
--(3)--&amp;gt; A(2, 0)&lt;br /&gt;
--(13)--&amp;gt; A(6, 1)&lt;br /&gt;
--(27)--&amp;gt; A(12, 2)&lt;br /&gt;
...&lt;br /&gt;
--(2753550047052785432549)--&amp;gt; A(1180092877308336613950, 31)&lt;br /&gt;
--(4130325070579178148831)--&amp;gt; A(1770139315962504920928, 32)&lt;br /&gt;
--(6195487605868767223254)--&amp;gt; A(2655208973943757381395, 33)&lt;br /&gt;
...&lt;br /&gt;
--(123361440505394191838159894807429323394336791980165278392551786831696080997)--&amp;gt; A(52869188788026082216354240631755424311858625134356547882522194356441177569, 0)&lt;br /&gt;
--(79303783182039123324531360947633136467787937701534821823783291534661766355)--&amp;gt; *[0, 26434594394013041108177120315877712155929312567178273941261097178220588784, 0]&lt;br /&gt;
MBB(9) ≥ 449388104698221698839011045369921106650798313642030657001438652029750007257&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(10):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(x) = E:[0, 0, x]&lt;br /&gt;
A(3k) --(28 × 2^k - 5k - 21)--&amp;gt; A(4 × 2^k - 2)&lt;br /&gt;
A(3k + 1) --(20 × 2^k - 5k - 16)--&amp;gt; *:[0, 4 × 2^k - 3, 0]&lt;br /&gt;
A(3k + 2) --(56 × 2^k - 5k - 23)--&amp;gt; A(8 × 2^k - 1)&lt;br /&gt;
&lt;br /&gt;
Let t3 = 2^5864062014807&lt;br /&gt;
Let t4 = 2^((t3 + 4) / 3)&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0]&lt;br /&gt;
--(20)--&amp;gt; A(5)&lt;br /&gt;
--(84)--&amp;gt; A(15)&lt;br /&gt;
--(850)--&amp;gt; A(126)&lt;br /&gt;
--(123145302310681)--&amp;gt; A(17592186044414)&lt;br /&gt;
--(7 × t3 - 29320310074043)--&amp;gt; A(t3 - 1)&lt;br /&gt;
--(5 × t4 - 5 / 3 × t3 - 38 / 3)--&amp;gt; *:[0, t4 - 3, 0]&lt;br /&gt;
MBB(10) ≥ 5 × t4 + 16 / 3 × t3 + 281474976712738 / 3 &amp;gt; 10^^4.03&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
MBB(11):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(x) = I:[x, 0, 0]&lt;br /&gt;
A(3k) --&amp;gt; A((20 * 4^k + 1)/3) if k ≥ 1&lt;br /&gt;
A(3k + 1) --&amp;gt; A((80 * 4^k + 1)/3) if k ≥ 1&lt;br /&gt;
A(3k + 2) --&amp;gt; *:[0, (20 * 4^k - 2)/3, 0] if k ≥ 1&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] --(140)--&amp;gt; A(27)&lt;br /&gt;
--&amp;gt; A((20 * 4^9 + 1) / 3) = A(1747627)&lt;br /&gt;
--&amp;gt; A((80 * 4^582542 + 1) / 3) ≡ A(4897384) mod 3^15&lt;br /&gt;
--&amp;gt; A((80 * 4^1632461 + 1) / 3) ≡ A(2637523) mod 3^14&lt;br /&gt;
--&amp;gt; A((80 * 4^879174 + 1) / 3) ≡ A(813591) mod 3^13&lt;br /&gt;
--&amp;gt; A((20 * 4^271197 + 1) / 3) ≡ A(72385) mod 3^12&lt;br /&gt;
--&amp;gt; A((80 * 4^24128 + 1) / 3) ≡ A(84526) mod 3^11&lt;br /&gt;
--&amp;gt; A((80 * 4^28175 + 1) / 3) ≡ A(35479) mod 3^10&lt;br /&gt;
--&amp;gt; A((80 * 4^11826 + 1) / 3) ≡ A(14202) mod 3^9&lt;br /&gt;
--&amp;gt; A((20 * 4^4734 + 1) / 3) ≡ A(268) mod 3^8&lt;br /&gt;
--&amp;gt; A((80 * 4^89 + 1) / 3) ≡ A(2077) mod 3^7&lt;br /&gt;
--&amp;gt; A((80 * 4^692 + 1) / 3) ≡ A(394) mod 3^6&lt;br /&gt;
--&amp;gt; A((80 * 4^131 + 1) / 3) ≡ A(235) mod 3^5&lt;br /&gt;
--&amp;gt; A((80 * 4^78 + 1) / 3) ≡ A(21) mod 3^4&lt;br /&gt;
--&amp;gt; A((20 * 4^7 + 1) / 3) ≡ A(12) mod 3^3&lt;br /&gt;
--&amp;gt; A((20 * 4^4 + 1) / 3) ≡ A(6) mod 3^2&lt;br /&gt;
--&amp;gt; A((20 * 4^2 + 1) / 3) ≡ A(2) mod 3^1&lt;br /&gt;
--&amp;gt; *:[0, (20 * 4^0 - 2) / 3, 0] ≡ *:[0, 0, 0] mod 3^0&lt;br /&gt;
MBB(11) &amp;gt; 10^^17.74&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
&lt;br /&gt;
=== &#039;&#039;&#039;Cryptids in the Wild&#039;&#039;&#039; ===&lt;br /&gt;
These cryptids were discovered through exhaustive enumeration of a domain, rather than being constructed by hand.&lt;br /&gt;
&lt;br /&gt;
==== MBB(8): Space Needle variants ====&lt;br /&gt;
Through the exhaustive search of the MBB(8) domain, all eight register machines have either been decided, or are equivalent to one of the two following potential [[cryptids]]: &amp;lt;code&amp;gt;0+B_1+C_2-AD_1-EH_2+F_1-DG_0-EB_2-C*&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;0+B_1-FC_2-GD_0-EF_1+C_2+A_2-EH_1-B*&amp;lt;/code&amp;gt;, which may each be interpreted in the following ways:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
0+B_1+C_2-AD_1-EH_2+F_1-DG_0-EB_2-C*&lt;br /&gt;
&lt;br /&gt;
Let A(x, y) = D:[x, y, 0]&lt;br /&gt;
A(x, 0) --(2)--&amp;gt; *:[x, 0, 0]&lt;br /&gt;
A(x, 2k + 1) --(6x + 6k + 9)--&amp;gt; A(x + k + 1, x + k + 2)&lt;br /&gt;
A(x, 2k + 2) --(6k + 6)--&amp;gt; A(x + k, k)&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] --(3)--&amp;gt; A(1, 1)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Needle rules:&lt;br /&gt;
Let C(x + 3) = A(x, x + 1) = D:[x, x + 1, 0].&lt;br /&gt;
Let a and b be non-negative integers satisfying x = (2a + 1) * 2^b.&lt;br /&gt;
C(x) --&amp;gt; C(2x - a - 2b - 1) if a &amp;gt; 0&lt;br /&gt;
C(x) --&amp;gt; *:[2x - 2b - 3, 0, 0] if a = 0&lt;br /&gt;
&lt;br /&gt;
START: C(5)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
0+B_1-FC_2-GD_0-EF_1+C_2+A_2-EH_1-B*&lt;br /&gt;
&lt;br /&gt;
Let A(x, y) = C:[x, 0, y]&lt;br /&gt;
A(x, 2k) --(6x + 6k + 5)--&amp;gt; A(x + k + 1, x + k + 1)&lt;br /&gt;
A(x, 2k + 3) --(6k + 7)--&amp;gt; A(x + k, k)&lt;br /&gt;
A(x, 1) --(3)--&amp;gt; *:[x, 0, 0]&lt;br /&gt;
&lt;br /&gt;
A:[0, 0, 0] --(2)--&amp;gt; A(1, 0)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Needle rules:&lt;br /&gt;
Let C(x + 3) = A(x, x) = C:[x, 0, x].&lt;br /&gt;
Let a and b be non-negative integers satisfying x = (2a + 1) * 2^b.&lt;br /&gt;
C(x) --&amp;gt; C(2x - a - 3b - 1) if a &amp;gt; 0&lt;br /&gt;
C(x) --&amp;gt; *:[2x - 3b - 1, 0, 0] if a = 0&lt;br /&gt;
&lt;br /&gt;
START: C(5)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
They are similar to the [[BB(6)]] cryptid [[Space Needle]], which is also the [[Beaver Math Olympiad#Unsolved problems|BMO&#039;s 6th problem]].&lt;br /&gt;
&lt;br /&gt;
=== Larger Cryptids ===&lt;br /&gt;
These cryptids were constructed by hand, translating a previously known Cryptid-like mechanism into a register machine. Note that this does not include Rick Griffith&#039;s 85-instruction, 16-register machine which would have halted had Fermat&#039;s Last Theorem turned out to be false,&amp;lt;sup&amp;gt;[https://web.archive.org/web/20120612014351/http://www.cantabgold.net/users/m.y.becker.98/part2projects/rickdissertation.zip]&amp;lt;/sup&amp;gt; as the theorem had already been proven true&amp;lt;sup&amp;gt;[https://www.jstor.org/stable/2118559]&amp;lt;/sup&amp;gt; by the time Griffith&#039;s machine was constructed (2003).&lt;br /&gt;
&lt;br /&gt;
==== MBB(10): Hydra ====&lt;br /&gt;
[[Hydra]] was hand coded into a 10-instruction, 3-register register machine: &amp;lt;code&amp;gt;0-BF_1+C_1+D_0-EH_1+A_2+G_2+I_2-I*_0+J_1-IA&amp;lt;/code&amp;gt; which can be interpreted the following way:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1243312334907375676/1446694179337011325]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let S(h,w) = A:[h-3,0,w]&lt;br /&gt;
&lt;br /&gt;
Start: A:[0,0,0] = S(3,0)&lt;br /&gt;
S(2k,0) = A:[2k-3,0,0] -&amp;gt; Halt&lt;br /&gt;
S(2k,w+1) = A:[2k-3,0,w+1] -&amp;gt; A:[3k-3,0,w] = S(3k,w)&lt;br /&gt;
S(2k+1,w) = A:[2k-2,0,w] -&amp;gt; A:[3k-2,0,w+2] = S(3k+1,w+2)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== MBB(12,2): Convergence of 7 under the 5n + 1 map ====&lt;br /&gt;
The 5n + 1 map has also been hand coded into a 12-instruction, 2-register machine: &amp;lt;code&amp;gt;0+B_0+C_0+D_0+E_1-IF_1+G_0-HE_0-FJ_0+A_1-KL_0+J_0-H*&amp;lt;/code&amp;gt; which can be interpreted the following way:&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1552294888740098139/1555083694937604097]&amp;lt;/sup&amp;gt;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
0+B_0+C_0+D_0+E_1-IF_1+G_0-HE_0-FJ_0+A_1-KL_0+J_0-H*&lt;br /&gt;
&lt;br /&gt;
Let A(x + 3) = F:[x, 0]&lt;br /&gt;
Assume x &amp;gt; 0.&lt;br /&gt;
A(4) --(10)--&amp;gt; *:[0, 0]&lt;br /&gt;
A(2k) --(5k - 2)--&amp;gt; A(k)&lt;br /&gt;
A(2k + 1) --(9k)--&amp;gt; A(5k + 3)&lt;br /&gt;
 &lt;br /&gt;
A:[0, 0] --(5)--&amp;gt; A(7)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==== MBB(130): Riemann Hypothesis ====&lt;br /&gt;
The Riemann Hypothesis has been coded into a 130-instruction, 29-register machine.&amp;lt;sup&amp;gt;[https://www.sciencedirect.com/science/article/pii/S0304397519304633]&amp;lt;/sup&amp;gt;&lt;br /&gt;
[[Category:functions]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Pebble_Automaton&amp;diff=9659</id>
		<title>Pebble Automaton</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Pebble_Automaton&amp;diff=9659"/>
		<updated>2026-10-26T22:38:12Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Busy Beaver function */ All values are known up to 10. Enumerating 11 right now.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Stub}}&lt;br /&gt;
A pebble automaton is a type of [[cellular automaton]] introduced by AlephSquirrel, based on a Codeforces problem, also called Pebble Automaton.&amp;lt;ref&amp;gt;https://codeforces.com/gym/106465/problem/B&amp;lt;/ref&amp;gt; Each cell contains a non-negative number of pebbles, and the number of pebbles in the cell determines how many pebbles to push to each neighbor. Though in the original problem, the behavior of a cell also depended on the cell&#039;s location, the cellular automaton removes this dependence. Investigation so far has primarily focused on 1-dimensional pebble automata, but multi-dimensional pebble automata could be considered.&lt;br /&gt;
&lt;br /&gt;
Though it is unknown whether pebble automata are [[Turing-complete]], it is highly suspected that they are, since certain automata have been found to compute [[Collatz-like]] functions.&lt;br /&gt;
&lt;br /&gt;
== Definition ==&lt;br /&gt;
A 1D pebble automaton is defined by three integer functions L(n), S(n) and R(n), defined over non-negative integers n, under the constraints:&lt;br /&gt;
&lt;br /&gt;
* L(n) ≥ 0&lt;br /&gt;
* S(n) ≥ 0&lt;br /&gt;
* R(n) ≥ 0&lt;br /&gt;
* L(n) + S(n) + R(n) = n for all n&lt;br /&gt;
&lt;br /&gt;
A simulation of a pebble automaton is represented by p(x, t), the number of pebbles at position x and time t. The initial configuration (t=0) has all n pebbles at x=0 and each generation, the pebbles are moved around according to the L, S, R rules:&lt;br /&gt;
&lt;br /&gt;
* p(0, 0) = n&lt;br /&gt;
* p(x, 0) = 0 for x ≠ 0&lt;br /&gt;
* p(x, t+1) = R(p(x-1, t)) + S(p(x,t)) + L(p(x+1, t))&lt;br /&gt;
&lt;br /&gt;
Informally, when a cell has n pebbles, it pushes L(n) to its left neighbor, R(n) to its right neighbor and S(n) stay.&lt;br /&gt;
&lt;br /&gt;
Because the number of pebbles is preserved in each row, the maximum number of pebbles in one location is n. Therefore, a pebble automaton only needs to specify the function values up to n.&lt;br /&gt;
&lt;br /&gt;
== Busy Beaver function ==&lt;br /&gt;
We say a pebble automaton has stabilized if no pebbles are moving; for any k in the configuration, L(k) = R(k) = 0.&lt;br /&gt;
&lt;br /&gt;
Let us define peBBle(n) as the maximum number of steps it takes for any pebble automaton to stabilize, starting from an initial state of n pebbles in a single cell.&lt;br /&gt;
&lt;br /&gt;
Notation (long version): &amp;lt;code&amp;gt;&amp;lt;nowiki&amp;gt;n --&amp;gt; L(n) | S(n) | R(n)&amp;lt;/nowiki&amp;gt;&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;0 --&amp;gt; 0 | 0 | 0&amp;lt;/code&amp;gt; is omitted since it is forced by the definition.&lt;br /&gt;
&lt;br /&gt;
The short version sets the rules in increasing order, separated by underscores, and removes &amp;lt;code&amp;gt;S(n)&amp;lt;/code&amp;gt; since it can be obtained with the equation &amp;lt;code&amp;gt;S(N) = n - L(n) - R(n)&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If there are over 10 pebbles, lowercase letters are used for numbers greater than 9 (a=10, b=11, etc.)&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!peBBle(n)&lt;br /&gt;
!Champion&lt;br /&gt;
|-&lt;br /&gt;
|1&lt;br /&gt;
|= 0&lt;br /&gt;
|&amp;lt;code&amp;gt;00&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|2&lt;br /&gt;
|= 1&lt;br /&gt;
|&amp;lt;code&amp;gt;00_01&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|3&lt;br /&gt;
|= 3&lt;br /&gt;
|&amp;lt;code&amp;gt;00_01_20&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|4&lt;br /&gt;
|= 6&lt;br /&gt;
|&amp;lt;code&amp;gt;00_01_20_03&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|5&lt;br /&gt;
|= 11&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_04&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|6&lt;br /&gt;
|= 17&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_40_15&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|7&lt;br /&gt;
|= 28&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_10_33_61&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|8&lt;br /&gt;
|= 63&lt;br /&gt;
|&amp;lt;code&amp;gt;00_11_03_21_50_30_24_70&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|9&lt;br /&gt;
|= 63577&lt;br /&gt;
|&amp;lt;code&amp;gt;00_02_01_40_14_12_00_52_81&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|10&lt;br /&gt;
|= 5778&lt;br /&gt;
|&amp;lt;code&amp;gt;00_02_01_40_14_12_00_17_63_18&amp;lt;/code&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|11&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Analysis ==&lt;br /&gt;
&lt;br /&gt;
=== peBBle(5) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
.5.....&lt;br /&gt;
.14....&lt;br /&gt;
.311...&lt;br /&gt;
..41...&lt;br /&gt;
.212...&lt;br /&gt;
1.3.1..&lt;br /&gt;
1..31..&lt;br /&gt;
1...4..&lt;br /&gt;
1..211.&lt;br /&gt;
1.1.21.&lt;br /&gt;
1.11.2.&lt;br /&gt;
1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(6) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
...6.....&lt;br /&gt;
..1.5....&lt;br /&gt;
..141....&lt;br /&gt;
..312....&lt;br /&gt;
...5.1...&lt;br /&gt;
..41.1...&lt;br /&gt;
.212.1...&lt;br /&gt;
1.3.11...&lt;br /&gt;
1..311...&lt;br /&gt;
1...41...&lt;br /&gt;
1..212...&lt;br /&gt;
1.1.3.1..&lt;br /&gt;
1.1..31..&lt;br /&gt;
1.1...4..&lt;br /&gt;
1.1..211.&lt;br /&gt;
1.1.1.21.&lt;br /&gt;
1.1.11.2.&lt;br /&gt;
1.1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(7) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
..7.......&lt;br /&gt;
.6.1......&lt;br /&gt;
3.31......&lt;br /&gt;
.3.4......&lt;br /&gt;
..511.....&lt;br /&gt;
.1411.....&lt;br /&gt;
.3121.....&lt;br /&gt;
..5.2.....&lt;br /&gt;
.141.1....&lt;br /&gt;
.312.1....&lt;br /&gt;
..5.11....&lt;br /&gt;
.14.11....&lt;br /&gt;
.31111....&lt;br /&gt;
..4111....&lt;br /&gt;
.21211....&lt;br /&gt;
1.3.21....&lt;br /&gt;
1..4.2....&lt;br /&gt;
1.212.1...&lt;br /&gt;
11.3.11...&lt;br /&gt;
11..311...&lt;br /&gt;
11...41...&lt;br /&gt;
11..212...&lt;br /&gt;
11.1.3.1..&lt;br /&gt;
11.1..31..&lt;br /&gt;
11.1...4..&lt;br /&gt;
11.1..211.&lt;br /&gt;
11.1.1.21.&lt;br /&gt;
11.1.11.2.&lt;br /&gt;
11.1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(8) ===&lt;br /&gt;
&amp;lt;syntaxhighlight line=&amp;quot;1&amp;quot;&amp;gt;&lt;br /&gt;
.....8............&lt;br /&gt;
....71............&lt;br /&gt;
...215............&lt;br /&gt;
..1.7.............&lt;br /&gt;
..1214............&lt;br /&gt;
..2.411...........&lt;br /&gt;
.1.3121...........&lt;br /&gt;
.1..5.2...........&lt;br /&gt;
.1.5.1.1..........&lt;br /&gt;
.15..1.1..........&lt;br /&gt;
.6...1.1..........&lt;br /&gt;
33...1.1..........&lt;br /&gt;
.33..1.1..........&lt;br /&gt;
..33.1.1..........&lt;br /&gt;
...331.1..........&lt;br /&gt;
....34.1..........&lt;br /&gt;
....2411..........&lt;br /&gt;
...12221..........&lt;br /&gt;
...21212..........&lt;br /&gt;
..1.3.3.1.........&lt;br /&gt;
..1..3.31.........&lt;br /&gt;
..1...3.4.........&lt;br /&gt;
..1....511........&lt;br /&gt;
..1...5.11........&lt;br /&gt;
..1..5..11........&lt;br /&gt;
..1.5...11........&lt;br /&gt;
..15....11........&lt;br /&gt;
..6.....11........&lt;br /&gt;
.33.....11........&lt;br /&gt;
..33....11........&lt;br /&gt;
...33...11........&lt;br /&gt;
....33..11........&lt;br /&gt;
.....33.11........&lt;br /&gt;
......3311........&lt;br /&gt;
.......341........&lt;br /&gt;
.......242........&lt;br /&gt;
......12311.......&lt;br /&gt;
......2.141.......&lt;br /&gt;
.....1.1312.......&lt;br /&gt;
.....1.1.5.1......&lt;br /&gt;
.....1.15..1......&lt;br /&gt;
.....1.6...1......&lt;br /&gt;
.....133...1......&lt;br /&gt;
.....1.33..1......&lt;br /&gt;
.....1..33.1......&lt;br /&gt;
.....1...331......&lt;br /&gt;
.....1....34......&lt;br /&gt;
.....1....241.....&lt;br /&gt;
.....1...1222.....&lt;br /&gt;
.....1...21211....&lt;br /&gt;
.....1..1.3.21....&lt;br /&gt;
.....1..1..4.2....&lt;br /&gt;
.....1..1.212.1...&lt;br /&gt;
.....1..11.3.11...&lt;br /&gt;
.....1..11..311...&lt;br /&gt;
.....1..11...41...&lt;br /&gt;
.....1..11..212...&lt;br /&gt;
.....1..11.1.3.1..&lt;br /&gt;
.....1..11.1..31..&lt;br /&gt;
.....1..11.1...4..&lt;br /&gt;
.....1..11.1..211.&lt;br /&gt;
.....1..11.1.1.21.&lt;br /&gt;
.....1..11.1.11.2.&lt;br /&gt;
.....1..11.1.111.1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== peBBle(9) ===&lt;br /&gt;
The champion performs a [[Collatz-like]] function.&lt;br /&gt;
&lt;br /&gt;
Analysis:&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;text&amp;quot;&amp;gt;&lt;br /&gt;
A(n) := 6 0^n 3&lt;br /&gt;
B(n) := 6 0^n 21&lt;br /&gt;
&lt;br /&gt;
A(3k+1) -(20k+12)-&amp;gt; B(11k+5)&lt;br /&gt;
A(3k+2) -(8k+7)---&amp;gt; HALT&lt;br /&gt;
A(3k+3) -(20k+26)-&amp;gt; B(11k+12)&lt;br /&gt;
&lt;br /&gt;
B(3k)   -(8k+3)---&amp;gt; HALT&lt;br /&gt;
B(3k+1) -(20k+16)-&amp;gt; A(11k+7)&lt;br /&gt;
B(3k+2) -(20k+22)-&amp;gt; A(11k+11)&lt;br /&gt;
&lt;br /&gt;
9 -(8)-&amp;gt; B(4) -(36)-&amp;gt; A(18) -(126)-&amp;gt; B(67) -(456)-&amp;gt; A(249) -(1666)-&amp;gt; B(914) -(6102)-&amp;gt; A(3355) -(22372)-&amp;gt; B(12303) -(32811)-&amp;gt; HALT&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
&lt;br /&gt;
No cryptids have been found through exhaustive search, but there have been cryptids created by hand.&lt;br /&gt;
&lt;br /&gt;
A 12 pebble automaton has been created that is modeled by a [[Piecewise Affine Function]], similar to [[BMO1]]:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
00_00_00_40_10_00_00_08_41_11_00_a1&lt;br /&gt;
&lt;br /&gt;
Let A(u,v) := 1 0^(u-2) a 0^(v-1) 1&lt;br /&gt;
&lt;br /&gt;
A(u,v) -&amp;gt; A(4u-1, v-u) if u&amp;lt;v&lt;br /&gt;
A(u,v) -&amp;gt; A(u-v, 4v+1) if u&amp;gt;v+1&lt;br /&gt;
A(u,v) -&amp;gt; halt         if u=v+1 or u=v&lt;br /&gt;
&lt;br /&gt;
start: A(3,1)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
An 86 pebble automaton has been produced by hand to display [[Hydra]]-like behavior:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1 --&amp;gt; 0 | 1 | 0&lt;br /&gt;
2 --&amp;gt; 0 | 0 | 2&lt;br /&gt;
3 --&amp;gt; 0 | 0 | 3&lt;br /&gt;
5 --&amp;gt; 0 | 0 | 5&lt;br /&gt;
6 --&amp;gt; 0 | 6 | 0&lt;br /&gt;
7 --&amp;gt; 0 | 1 | 6&lt;br /&gt;
8 --&amp;gt; 0 | 2 | 6&lt;br /&gt;
9 --&amp;gt; 9 | 0 | 0&lt;br /&gt;
12 --&amp;gt; 12 | 0 | 0&lt;br /&gt;
14 --&amp;gt; 0 | 14 | 0&lt;br /&gt;
15 --&amp;gt; 6 | 9 | 0&lt;br /&gt;
17 --&amp;gt; 17 | 0 | 0&lt;br /&gt;
24 --&amp;gt; 0 | 24 | 0&lt;br /&gt;
25 --&amp;gt; 0 | 2 | 23&lt;br /&gt;
26 --&amp;gt; 0 | 1 | 25&lt;br /&gt;
27 --&amp;gt; 24 | 3 | 0&lt;br /&gt;
28 --&amp;gt; 26 | 2 | 0&lt;br /&gt;
29 --&amp;gt; 27 | 2 | 0&lt;br /&gt;
30 --&amp;gt; 27 | 3 | 0&lt;br /&gt;
32 --&amp;gt; 0 | 32 | 0&lt;br /&gt;
33 --&amp;gt; 0 | 33 | 0&lt;br /&gt;
35 --&amp;gt; 0 | 2 | 33&lt;br /&gt;
38 --&amp;gt; 0 | 3 | 35&lt;br /&gt;
39 --&amp;gt; 0 | 0 | 39&lt;br /&gt;
40 --&amp;gt; 0 | 0 | 40&lt;br /&gt;
41 --&amp;gt; 1 | 40 | 0&lt;br /&gt;
45 --&amp;gt; 0 | 39 | 6&lt;br /&gt;
78 --&amp;gt; 0 | 0 | 78&lt;br /&gt;
79 --&amp;gt; 0 | 79 | 0&lt;br /&gt;
84 --&amp;gt; 24 | 15 | 45&lt;br /&gt;
86 --&amp;gt; 1 | 1 | 84&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
It may be interpreted in the following way:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let C(x, y) = $ 1 0^y 1 0^x 84 $&lt;br /&gt;
C(2k, y) --&amp;gt; C(7k + 3, y + 2)&lt;br /&gt;
C(2k + 1, y + 1) --&amp;gt; C(7k + 10, y)&lt;br /&gt;
C(2k + 1, 0) --&amp;gt; HALT&lt;br /&gt;
&lt;br /&gt;
$$ --&amp;gt; C(0, 0) --&amp;gt; C(3, 2) --&amp;gt; C(17, 1) --&amp;gt; C(66, 0) --&amp;gt; C(234, 2)...&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Sources ==&lt;br /&gt;
&lt;br /&gt;
* Discord thread: https://discord.com/channels/960643023006490684/1535695107448381591&lt;br /&gt;
&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== External resources ==&lt;br /&gt;
&lt;br /&gt;
* [https://gist.github.com/AlephSquirrel/9ada4b14b675d18fe8755b200b20509d Uiua simulator]&lt;br /&gt;
* [https://github.com/AzertyWasTaken/Busy-Beaver/tree/main/Pebble%20Automaton Enumerator GitHub repo]&lt;br /&gt;
* [https://azertywastaken.github.io/Busy-Beaver/Website/pebble-automaton.html Simulator website]&lt;br /&gt;
&lt;br /&gt;
[[Category:Functions]]&lt;br /&gt;
[[Category:Stubs]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;diff=9658</id>
		<title>Lambda Calculus</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Lambda_Calculus&amp;diff=9658"/>
		<updated>2026-10-26T20:32:49Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* Champions */ Delete surpassed champion&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Lambda calculus&#039;&#039;&#039; is a model of computation developed by Alonzo Church (of Church-Turing thesis fame) in 1932. If you are not familiar with lambda calculus and beta-reduction, it is recommended to start with [[wikipedia:Lambda_calculus|this article]].&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;BBλ&#039;&#039;&#039; is the [[Busy Beaver]] function for lambda calculus, where BBλ(n) is the maximum normal form size of any closed lambda term of size n (or 0 if no closed term of size n exists). Size is measured in bits using [https://tromp.github.io/cl/Binary_lambda_calculus.html Binary Lambda Calculus], a binary prefix-free encoding for all closed lambda calculus terms. Pioneered by John Tromp, BBλ is uncomputable, and therefore grows faster than any computable function. &lt;br /&gt;
&lt;br /&gt;
== Analogy to Turing machines ==&lt;br /&gt;
We evaluate terms by applying &#039;&#039;beta-reductions&#039;&#039; until they reach a &#039;&#039;normal form&#039;&#039;. As an analogy to [[Turing machines]]:&lt;br /&gt;
* &#039;&#039;Lambda terms&#039;&#039; are like TM configurations (tape + state + position).&lt;br /&gt;
* Applying &#039;&#039;beta-reduction&#039;&#039; to a term is like taking a TM step.&lt;br /&gt;
* A term is in &#039;&#039;normal form&#039;&#039; if no beta-reductions can be applied. This is like saying the term has halted.&lt;br /&gt;
* A term may or may not be reducible to a normal form. If it is, this is like saying the term halts.&lt;br /&gt;
* Determining whether a term is reducible to a normal form is an undecidable problem equivalent to the halting problem.&lt;br /&gt;
&lt;br /&gt;
Note: That unlike for Turing machines, evaluating lambda terms is non-deterministic. Specifically, there may be multiple beta-reductions possible in a given term. However, if a term can be reduced to a normal form, that normal form is unique. It is not possible to reduce the original term to any different normal form. A term is &#039;&#039;&#039;strongly normalizing&#039;&#039;&#039; if every beta-reduction sequence leads to this normal form and &#039;&#039;&#039;weakly normalizing&#039;&#039;&#039; if some sequence does (while others may diverge).&lt;br /&gt;
&lt;br /&gt;
== Proof of Uncomputability ==&lt;br /&gt;
The proof that BBλ(n) is uncomputable is very similar to Radó&#039;s original proof that Σ(n) is uncomputable. Proof by contradiction:&lt;br /&gt;
&lt;br /&gt;
Assume BBλ is computable and so there exists a term &#039;&#039;f&#039;&#039; which computes it on [[wikipedia:Church_encoding|Church numerals]]. In other words: for all &amp;lt;math&amp;gt;n \in \N&amp;lt;/math&amp;gt;: &amp;lt;math&amp;gt;(f \; C_n)&amp;lt;/math&amp;gt; beta reduces to normal form &amp;lt;math&amp;gt;C_{BB\lambda(n)}&amp;lt;/math&amp;gt; (where &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; denotes the Church numeral &#039;&#039;n&#039;&#039;). Denote the binary lambda encoded size of &#039;&#039;f&#039;&#039; as &#039;&#039;k&#039;&#039;. Consider the term &amp;lt;math&amp;gt;f \; (C_2 \; C_n)&amp;lt;/math&amp;gt; which has size &amp;lt;math&amp;gt;2+k+2+(5\times2+6)+(5n+6) = 5n + k + 26&amp;lt;/math&amp;gt; bits. This term reduces to &amp;lt;math&amp;gt;C_{BB\lambda(n^2)}&amp;lt;/math&amp;gt; which has size &amp;lt;math&amp;gt;5 \cdot BB\lambda(n^2) + 6&amp;lt;/math&amp;gt; bits. But for sufficiently large n, &amp;lt;math&amp;gt;n^2 &amp;gt; 5n + k + 26&amp;lt;/math&amp;gt; and so BBλ(5n+k+26) ≥ 5×BBλ(n²)+6 &amp;gt; BBλ(5n+k+26). But this is a contradiction, we&#039;ve found a &amp;lt;math&amp;gt;5n + k + 26&amp;lt;/math&amp;gt; bit term which reduces to a normal form larger than &amp;lt;math&amp;gt;BB\lambda(5n + k + 26)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Thus BBλ(n) is uncomputable. A variation of this argument shows that BBλ(n) eventually dominates all computable functions.&lt;br /&gt;
&lt;br /&gt;
== Binary Lambda Encoding ==&lt;br /&gt;
A lambda term using [https://en.wikipedia.org/wiki/De_Bruijn_indices De Bruijn indexes] is defined inductively as:&lt;br /&gt;
* Variables: For any &amp;lt;math&amp;gt;n \in \mathbb{Z}^+&amp;lt;/math&amp;gt;, Var(&#039;&#039;n&#039;&#039;) is a term. It represents a variable bound by the lambda expression &#039;&#039;n&#039;&#039; above this one (the De Bruijn index). It is typically written simply as &amp;lt;code&amp;gt;n&amp;lt;/code&amp;gt;.&lt;br /&gt;
* Lambdas: For any term &#039;&#039;T&#039;&#039;, Lam(&#039;&#039;T&#039;&#039;) is a term. It represents a unary function with function body &#039;&#039;T&#039;&#039;. It is typically written &amp;lt;math&amp;gt;\lambda T&amp;lt;/math&amp;gt; or &amp;lt;code&amp;gt;\T&amp;lt;/code&amp;gt;.&lt;br /&gt;
* Applications: For any terms &#039;&#039;T, U&#039;&#039;, App(&#039;&#039;T, U&#039;&#039;) is a term. It represents applying function &#039;&#039;T&#039;&#039; to argument &#039;&#039;U&#039;&#039;. It is typically written &amp;lt;code&amp;gt;(T U)&amp;lt;/code&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
We can think of this as a tree where each variable is a leaf, a lambda is a node with one child and applications are nodes with 2 children. A term is &#039;&#039;&#039;closed&#039;&#039;&#039; if every variable is bound. In other words, for every Var(&#039;&#039;n&#039;&#039;) leaf node, there exists &#039;&#039;n&#039;&#039; Lam() nodes above it in the tree of the term.&lt;br /&gt;
&lt;br /&gt;
Encoding (&#039;&#039;blc()&#039;&#039;) is defined recursively:&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{l}&lt;br /&gt;
  blc(Var(n)) &amp;amp; = &amp;amp; 1^n 0 \\&lt;br /&gt;
  blc(Lam(T)) &amp;amp; = &amp;amp; 00 \; blc(T) \\&lt;br /&gt;
  blc(App(T, U)) &amp;amp; = &amp;amp; 01 \; blc(T) \; blc(U) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For example, the [https://en.wikipedia.org/wiki/Church_encoding#Church_numerals Church numeral] 2: &amp;lt;math&amp;gt;\lambda f x. (f \; (f \; x))&amp;lt;/math&amp;gt; =  &amp;lt;code&amp;gt;\\(2 (2 1))&amp;lt;/code&amp;gt; = &amp;lt;code&amp;gt;Lam(Lam(App(Var(2), App(Var(2), Var(1))))&amp;lt;/code&amp;gt; is encoded as &amp;lt;code&amp;gt;00 00 01 110 01 110 10&amp;lt;/code&amp;gt; or simply &amp;lt;code&amp;gt;0000011100111010&amp;lt;/code&amp;gt; (spaces are not part of the encoding, only used for demonstration purposes) and thus has size 16 bits.&lt;br /&gt;
&lt;br /&gt;
== Text Encoding conventions ==&lt;br /&gt;
For human readability, a text encoding and set of conventions is used in this article. As described earlier we encode a lambda term as:&lt;br /&gt;
* Var(&#039;&#039;n&#039;&#039;) -&amp;gt; &amp;lt;code&amp;gt;n&amp;lt;/code&amp;gt;&lt;br /&gt;
* Lam(&#039;&#039;T&#039;&#039;) -&amp;gt; &amp;lt;code&amp;gt;(\T)&amp;lt;/code&amp;gt;&lt;br /&gt;
* App(&#039;&#039;T, U&#039;&#039;) -&amp;gt; &amp;lt;code&amp;gt;(T U)&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
However, parentheses are also dropped in certain cases by convention:&lt;br /&gt;
* The outermost parentheses are dropped: &amp;lt;code&amp;gt;Lam(1)&amp;lt;/code&amp;gt; -&amp;gt; &amp;lt;code&amp;gt;\1&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;App(1, 2)&amp;lt;/code&amp;gt; -&amp;gt; &amp;lt;code&amp;gt;1 2&amp;lt;/code&amp;gt;.&lt;br /&gt;
* Parentheses are dropped immediately inside a Lam: &amp;lt;code&amp;gt;Lam(Lam(1))&amp;lt;/code&amp;gt; -&amp;gt; &amp;lt;code&amp;gt;\\1&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;Lam(App(1, 1))&amp;lt;/code&amp;gt; -&amp;gt; &amp;lt;code&amp;gt;\1 1&amp;lt;/code&amp;gt;.&lt;br /&gt;
* Parentheses are dropped in nested Apps using left associativity: &amp;lt;code&amp;gt;App(App(1, 2), 3)&amp;lt;/code&amp;gt; -&amp;gt; &amp;lt;code&amp;gt;1 2 3&amp;lt;/code&amp;gt;. (Note: parentheses are still required for &amp;lt;code&amp;gt;App(1, App(2, 3))&amp;lt;/code&amp;gt; -&amp;gt; &amp;lt;code&amp;gt;1 (2 3)&amp;lt;/code&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
This is the convention used in John Tromp&#039;s code and so is used here for consistency.&lt;br /&gt;
&lt;br /&gt;
== Champions ==&lt;br /&gt;
There are no closed lambda terms of size 0, 1, 2, 3 or 5 and so BBλ(n) = 0 for those values.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;C(n)&amp;lt;/math&amp;gt; denotes Church numeral &#039;&#039;n&#039;&#039; = &amp;lt;math&amp;gt;\lambda s\lambda z. s^n(z)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
In the last column, JT and BF abbreviate John Tromp and Bertram Felgenhauer.&lt;br /&gt;
&lt;br /&gt;
We use the ordinal collapsing functions defined by Buchholz (1986). It is suspected (though not yet confirmed) that we used the fundamental sequences described by Maksudov (2017), or, in the case of lim(BMS), the sequence lim(BMS)[n] = BMS((0)(1,1,...,1)) w/n 1s.&lt;br /&gt;
&lt;br /&gt;
The [https://discord.com/channels/960643023006490684/1355653587824283678/1493455967868817429 smallest cryptid currently known] (&amp;lt;code&amp;gt;\1111(\1)1(\\1))(\\\1(322222)&amp;lt;/code&amp;gt;) has 74 bits.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Small Champions&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!BBλ(n)&lt;br /&gt;
!Champion&lt;br /&gt;
!Normal form&lt;br /&gt;
!Discovered By&lt;br /&gt;
|-&lt;br /&gt;
| 4 || = 4 || &amp;lt;math&amp;gt;\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 6 || = 6 || &amp;lt;math&amp;gt;\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 7 || = 7 || &amp;lt;math&amp;gt;\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 8 || = 8 || &amp;lt;math&amp;gt;\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 9 || = 9 || &amp;lt;math&amp;gt;\lambda\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 10 || = 10 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 11 || = 11 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 12 || = 12 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 13 || = 13 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 14 || = 14 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 15 || = 15 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 16 || = 16 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 17 || = 17 || &amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|18&lt;br /&gt;
|= 18&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|19&lt;br /&gt;
|= 19&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda\lambda\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|20&lt;br /&gt;
|= 20&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda\lambda\lambda\lambda\lambda\lambda\lambda\lambda\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!BBλ(n)&lt;br /&gt;
!Champion&lt;br /&gt;
!Normal form&lt;br /&gt;
!Discovered By&lt;br /&gt;
|-&lt;br /&gt;
|21 || = 22 || &amp;lt;math&amp;gt;\lambda(\lambda 1 1) (1 (\lambda 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda(1(\lambda 2))(1(\lambda 2))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|22 || = 24 || &amp;lt;math&amp;gt;\lambda(\lambda 1 1 1) (1 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda(1 1) (1 1) (1 1)&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|23 || = 26 || &amp;lt;math&amp;gt;\lambda(\lambda 1 1) (1 (\lambda\lambda 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda(1 (\lambda\lambda 2)) (1 (\lambda\lambda 2))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|24 || = 30 || &amp;lt;math&amp;gt;\lambda(\lambda 1 1 1) (1 (\lambda 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda(1 (\lambda 1)) (1 (\lambda 1)) (1 (\lambda 1))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|25 || = 42 || &amp;lt;math&amp;gt;\lambda(\lambda 1 1) (\lambda 1 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda 1 (\lambda 1 (2 1)) (1 (1 (\lambda 1 (2 1))))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|26 || = 52 || &amp;lt;math&amp;gt;(\lambda 1 1) (\lambda\lambda 2 (1 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda\lambda 2 (\lambda\lambda 2 (1 2)) (1 (2 (\lambda\lambda 2 (1 2))))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|27 || = 44 || &amp;lt;math&amp;gt;\lambda\lambda(\lambda 1 1) (\lambda 1 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda\lambda 1 (\lambda 1 (2 1)) (1 (1 (\lambda 1 (2 1))))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|28 || = 58 || &amp;lt;math&amp;gt;\lambda(\lambda 1 1) (\lambda 1 (2 (\lambda 2))))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda 1 (\lambda\lambda 1 (3 (\lambda 2))) (1 (\lambda 2 (\lambda\lambda 1 (4 (\lambda 2)))))&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
| 29 || = 223|| &amp;lt;math&amp;gt;\lambda(\lambda 1 1) (\lambda 1 (1 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda B (B (1 B)) \text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;B = (A (A (1 A)))&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;A = (1 (\lambda 1 (1 (2 1))))&amp;lt;/math&amp;gt;&lt;br /&gt;
||JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|30&lt;br /&gt;
|= 160&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 1) (\lambda\lambda 2 (1 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
&amp;lt;math&amp;gt;\lambda\lambda 2 B A (1 (2 B A)) \text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;B = (\lambda\lambda 2 A (1 (2 A)))&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;A = (\lambda\lambda 2 (1 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|31&lt;br /&gt;
|= 267&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1) (\lambda\lambda 2 (2 (1 2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
&amp;lt;math&amp;gt;\lambda\lambda 2 A (2 A (C (2 A))) \text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;C = (2 A (2 A (1 B (2 A))))&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;B = (\lambda 3 A (3 A (1 (3 A))))&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;A = (\lambda\lambda 2 (2 (1 2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|32&lt;br /&gt;
|= 298&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda(\lambda 1 1) (\lambda 1 (1 (2 (\lambda 2))))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|33&lt;br /&gt;
|= 1812&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda(\lambda 1 1) (\lambda 1 (1 (1 (2 1))))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
&amp;lt;math&amp;gt;\lambda C (C (C (1 C))) \text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;C = (B (B (B (1 B)))&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;B = (A (A (A (1 A)))&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;A = (1 (\lambda 1 (1 (1 (2 1)))))&amp;lt;/math&amp;gt;&lt;br /&gt;
|JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|34 || = 327686&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;C(2^{2^{2^2}})&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|35 || &amp;lt;math&amp;gt;= 5 \cdot 3^{3^3} + 6&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt; &amp;gt; 3.8 \times 10^{13}&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1) (\lambda\lambda 2 (2 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;C(3^{3^3})&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|36 || &amp;lt;math&amp;gt;= 5 \cdot 2^{2^{2^3}} + 6 &amp;gt; 5.7 \times 10^{77}&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1) (\lambda 1 (1 (\lambda\lambda 2 (2 1))))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;C(2^{2^{2^3}})&amp;lt;/math&amp;gt;|| JT &amp;amp; BF&lt;br /&gt;
|-&lt;br /&gt;
|37 || &amp;lt;math&amp;gt; = 2 + BB\lambda(35)&amp;lt;/math&amp;gt;&lt;br /&gt;
|  &amp;lt;math&amp;gt;\lambda(\lambda 1 1 1) (\lambda\lambda 2 (2 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda x. C(3^{3^3})&amp;lt;/math&amp;gt;||mxdys &amp;amp; JT &amp;amp; dyuan &amp;amp; sligocki&lt;br /&gt;
|-&lt;br /&gt;
|38 || &amp;lt;math&amp;gt;= 5\cdot{2^{2^{2^{2^2}}}} + 6 &amp;gt; 10^{19,729}&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1 1 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;C(2^{2^{2^{2^2}}})&amp;lt;/math&amp;gt;|| JT &amp;amp; BF &amp;amp; CppDS &amp;amp; mxdys &amp;amp; sligocki &amp;amp; dyuan &amp;amp; charles&lt;br /&gt;
|-&lt;br /&gt;
|39 || &amp;lt;math&amp;gt;= 5\cdot{3^{3^{3^3}}} + 6 &amp;gt; 10^{10^{12}}&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1 1) (\lambda\lambda 2 (2 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;C(3^{3^{3^3}})&amp;lt;/math&amp;gt;|| JT &amp;amp; BF &amp;amp; CppDS &amp;amp; mxdys &amp;amp; sligocki &amp;amp; dyuan &amp;amp; charles &amp;amp; 2014MELO &amp;amp; mammilaria&lt;br /&gt;
|-&lt;br /&gt;
|40 || &amp;lt;math&amp;gt; \approx 10 \uparrow\uparrow\uparrow 16&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1) (\lambda 1 (\lambda\lambda 2 (2 1)) 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda x.T(k)\text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;T(0)=x&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;T(n+1)=T(n)\;C(2)\;T(n)&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;k &amp;gt; (2\uparrow\uparrow)^{15} 33&amp;lt;/math&amp;gt;&lt;br /&gt;
|| mxdys &amp;amp; racheline&lt;br /&gt;
|-&lt;br /&gt;
|41 || &amp;lt;math&amp;gt;= 5 \times 3^{3^{85}} +6 &amp;gt; 10^{1.7 \times 10^{40}} \approx 10^{10^{40}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|  &amp;lt;math&amp;gt;(\lambda 1 (\lambda 1 1) 1) (\lambda\lambda 2 (2 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;C(3^{3^{85}})&amp;lt;/math&amp;gt;||mxdys&lt;br /&gt;
|-&lt;br /&gt;
|42 ||&amp;lt;math&amp;gt; \ge 2 + BB\lambda(40)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda(\lambda 1 1 1) (\lambda 1 (\lambda\lambda 2 (2 1)) 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
| ||&lt;br /&gt;
|-&lt;br /&gt;
|43 ||&amp;lt;math&amp;gt; &amp;gt; 2 \uparrow\uparrow\uparrow 2 \uparrow\uparrow\uparrow 2 \uparrow\uparrow 8&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1) (\lambda 1 (\lambda 1 (\lambda\lambda 2 (2 1)) 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda x.T(k)\text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;T(0)=x&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;T(n+1)=T(n)\;(\lambda y.y\;C(2)\;T(n))&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;k &amp;gt; 2 \uparrow\uparrow\uparrow 2 \uparrow\uparrow\uparrow 2 \uparrow\uparrow 8&amp;lt;/math&amp;gt;&lt;br /&gt;
||mxdys&lt;br /&gt;
|-&lt;br /&gt;
|44 || &amp;lt;math&amp;gt; &amp;gt; 10 \uparrow\uparrow\uparrow 10 \uparrow\uparrow\uparrow 16&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1 1) (\lambda 1 (\lambda\lambda 2 (2 1)) 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda x.T(k)\text{ where}&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;T(0)=x&amp;lt;/math&amp;gt;,&lt;br /&gt;
&amp;lt;math&amp;gt;T(n+1)=T(n)\;C(2)\;T(n)&amp;lt;/math&amp;gt;, &lt;br /&gt;
&amp;lt;math&amp;gt;k &amp;gt; (2\uparrow\uparrow)^{(2\uparrow\uparrow)^{15} 33 - 1} 33&amp;lt;/math&amp;gt;&lt;br /&gt;
||&lt;br /&gt;
|-&lt;br /&gt;
|45 || &amp;lt;math&amp;gt; \ge 2 + BB\lambda(43)&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda(\lambda 1 1) (\lambda 1 (\lambda 1 (\lambda\lambda 2 (2 1)) 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
| ||&lt;br /&gt;
|-&lt;br /&gt;
|46 || &amp;lt;math&amp;gt; \ge 2 + BB\lambda(44)&amp;lt;/math&amp;gt;&lt;br /&gt;
|  &amp;lt;math&amp;gt;\lambda(\lambda 1 1 1 1) (\lambda 1 (\lambda\lambda 2 (2 1)) 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
| ||&lt;br /&gt;
|-&lt;br /&gt;
|47 || &amp;lt;math&amp;gt;&amp;gt; f_{\omega}\left(f_{5}\left(2\right)\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|  &amp;lt;math&amp;gt;(\lambda 1 1 1)(\lambda\lambda 1 (1 2) (\lambda\lambda 2 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
| ||50_ft_lock&lt;br /&gt;
|-&lt;br /&gt;
|48 || &amp;lt;math&amp;gt; &amp;gt; 10 \uparrow\uparrow\uparrow\uparrow 4&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;(\lambda 1 1 1 1 1) (\lambda 1 (\lambda\lambda 2 (2 1)) 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
| &amp;lt;math&amp;gt;\lambda x.T(k)&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;T(0)=x,\;T(n+1)=T(n)\;C(2)\;T(n)&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;k &amp;gt; (2\uparrow\uparrow)^{(2\uparrow\uparrow)^{(2\uparrow\uparrow)^{15} 33 - 1} 33 - 1} 33&amp;lt;/math&amp;gt;||&lt;br /&gt;
|-&lt;br /&gt;
|49&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega+1}\left(\frac{2 \uparrow\uparrow 6}{2}\right)&amp;lt;/math&amp;gt; &amp;gt; Graham&#039;s number&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1) (\lambda 1 (1 (\lambda\lambda 1 2 (\lambda\lambda 2 (2 1)))))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;C(f_{\omega+1}\left(\frac{2 \uparrow\uparrow 6}{2}\right) )&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/melo.lam Gustavo Melo]&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|61&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^{2 \uparrow\uparrow 18-1}}\left(2\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 1) (\lambda 1 (1 (\lambda\lambda\lambda 1 3 2 (\lambda\lambda 2 (2 1)))))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;C(f_{\omega^{2 \uparrow\uparrow 18-1}}\left(2\right) )&amp;lt;/math&amp;gt;&lt;br /&gt;
|[https://tromp.github.io/blog/2026/01/28/largest-number-revised 50_ft_lock]&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|70&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^{\omega}2}\left(f_{\omega^{\omega}}\left(f_{\omega^{\omega}}\left(3\right)\right)\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 (\lambda 1 (\lambda\lambda\lambda 1 3 2 5) 2) 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Gustavo Melo &amp;amp; 50_ft_lock &amp;amp; Sam Bolsover&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|74&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^{\omega}2 + 1}\left(7\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 1 (\lambda 1 (\lambda\lambda\lambda 1 3 2 5) 2) 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|Gustavo Melo &amp;amp; 50_ft_lock &amp;amp; Sam Bolsover&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|76&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^{\omega^{3}}}(2)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda11(\lambda\lambda\lambda\lambda14321)1111)(\lambda\lambda2(21))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;C(f_{\omega^{\omega^{3}}}(2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|77&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^{\omega2}}(3)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda1(\lambda\lambda\lambda\lambda14321)1111)(\lambda\lambda2(2(21)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;C(f_{\omega^{\omega2}}(3))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|80&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt;f_{\omega^{\omega^{14}}}(2)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda111(\lambda\lambda\lambda\lambda14321)1111)(\lambda\lambda2(21))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;C(f_{\omega^{\omega^{14}}}(2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|82&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\omega^{\omega^{\omega}}}(2\uparrow\uparrow\uparrow\uparrow18)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda1(\lambda1(\lambda\lambda\lambda\lambda14321)1111)1)(\lambda\lambda2(21))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;C(f_{\omega^{\omega^{\omega}}}(2\uparrow\uparrow\uparrow\uparrow18))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|90&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\zeta_0}\left(15\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 (\lambda\lambda\lambda\lambda 1 4 4 4 3 2 1) 1 1 1 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|[https://docs.google.com/document/d/1xlzaEQGarqnCocf4R2UWfqE3ck8YF_P32CmYxGXLhAI/edit?tab=t.0 Patcail]&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|94&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi(\Omega_\omega)}\left(12\right)&amp;lt;/math&amp;gt; &amp;gt; TREE(G64)&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 1 (\lambda\lambda\lambda\lambda 1 4 4 4 3 2 1) 1 1 1 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|[https://docs.google.com/document/d/1xlzaEQGarqnCocf4R2UWfqE3ck8YF_P32CmYxGXLhAI/edit?tab=t.0 Patcail]&lt;br /&gt;
|-&lt;br /&gt;
|95&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi(\Omega_\omega)}\left(23\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 (\lambda\lambda\lambda\lambda 1 4 4 4 3 2 1) 1 1 1 1) (\lambda\lambda 2 (2 (2 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|[https://docs.google.com/document/d/1xlzaEQGarqnCocf4R2UWfqE3ck8YF_P32CmYxGXLhAI/edit?tab=t.0 Patcail]&lt;br /&gt;
|-&lt;br /&gt;
|96&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi(\Omega_\omega)}\left(f_{\omega^{\omega^{2}}}\left(2\right)\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 (\lambda 1 (\lambda\lambda\lambda\lambda 1 4 4 4 3 2 1) 1 1 1 1) 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|[https://docs.google.com/document/d/1xlzaEQGarqnCocf4R2UWfqE3ck8YF_P32CmYxGXLhAI/edit?tab=t.0 Patcail]&lt;br /&gt;
|- ||||||-&lt;br /&gt;
|100&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; f_{\psi(\Omega_\omega)+1}\left(4\right)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;(\lambda 1 1 (\lambda 1 (\lambda\lambda\lambda\lambda 1 4 4 4 3 2 1) 1 1 1 1) 1) (\lambda\lambda 2 (2 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|[https://docs.google.com/document/d/1xlzaEQGarqnCocf4R2UWfqE3ck8YF_P32CmYxGXLhAI/edit?tab=t.0 Patcail]&lt;br /&gt;
|- ||||||-&lt;br /&gt;
|201&lt;br /&gt;
| &amp;gt; q(5) &lt;br /&gt;
|too large to show&lt;br /&gt;
|q is only proven to exceed all functions provably recursive in PA; the true value is likely much larger based on informal analysis&lt;br /&gt;
|[https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/laver.lam JT &amp;amp; BF &amp;amp; 50_ft_lock]&lt;br /&gt;
|- ||||||-&lt;br /&gt;
|331&lt;br /&gt;
| &amp;gt; f&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt;&amp;lt;sub&amp;gt;lim(BMS)&amp;lt;/sub&amp;gt;(5)&lt;br /&gt;
|too large to show&lt;br /&gt;
|&lt;br /&gt;
|[https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/bms.lam Patcail &amp;amp; JT &amp;amp; 50_ft_lock]&lt;br /&gt;
|- ||||||-&lt;br /&gt;
|1797&lt;br /&gt;
|&amp;gt; D⁵(99) = Loader&#039;s number&lt;br /&gt;
|too large to show&lt;br /&gt;
|&lt;br /&gt;
|[https://codegolf.stackexchange.com/questions/176966/golf-a-number-bigger-than-loaders-number/274634#274634 JT &amp;amp; BF &amp;amp; DropperAUGL]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Optimal Busy Beaver ==&lt;br /&gt;
&lt;br /&gt;
A closely related BBλ2 function, defined as OEIS sequence (A361211)[https://oeis.org/A361211], allows the lambda term access to (undelimited) raw binary data, which suffices to make it an optimal busy beaver function amongst all binary self-delimiting ones.&lt;br /&gt;
&lt;br /&gt;
== Oracle Busy Beaver ==&lt;br /&gt;
While BBλ grows uncomputably fast, one can define functions that grow much faster.&lt;br /&gt;
&lt;br /&gt;
Let&#039;s define a higher order busy beaver function BBλ&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; by providing oracle access to BBλ.&lt;br /&gt;
&lt;br /&gt;
This is done by enriching the set of terms and possible reduction steps considered in the BB definition.&lt;br /&gt;
&lt;br /&gt;
A 1-closed term is a term in de Bruijn notation that is closed with 1 additional lambda in front. Any variable bound to that lambda is a free variable &#039;&#039;&#039;f&#039;&#039;&#039; in the term.&lt;br /&gt;
&lt;br /&gt;
An oracle reduction step reduces &#039;&#039;&#039;f&#039;&#039;&#039; t, where t is a closed normal form of size s, to Church numeral BBλ(s).&lt;br /&gt;
&lt;br /&gt;
Note that this is almost identical to the oracle steps in Barendregt and Klop&#039;s &amp;quot;Applications of infinitary lambda calculus&amp;quot;, except that they require t itself to be a church numeral. Allowing arbitrary closed t makes oracle steps more widely applicable while aligning with BBλ&#039;s focus on term sizes.&lt;br /&gt;
&lt;br /&gt;
Now let BBλ&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; be the maximum beta/oracle normal form size of any 1-closed lambda term of size n, or 0 if no 1-closed term of size n exists. This appears as sequence [[oeis:A385712|A385712]]  in the OEIS.&lt;br /&gt;
&lt;br /&gt;
The following table shows values of BBλ&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; up to 22 plus a lower bound for 28, with larger values expressed in terms of function &amp;lt;math&amp;gt;f(n) = 6 + 5 \times BB \lambda(n)&amp;lt;/math&amp;gt;: &lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!n&lt;br /&gt;
!Champion&lt;br /&gt;
!BBλ&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|1&lt;br /&gt;
|&lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|2&lt;br /&gt;
|&amp;lt;math&amp;gt;1&amp;lt;/math&amp;gt;&lt;br /&gt;
|1&lt;br /&gt;
|-&lt;br /&gt;
|3&lt;br /&gt;
|&lt;br /&gt;
|0&lt;br /&gt;
|-&lt;br /&gt;
|4&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|4&lt;br /&gt;
|-&lt;br /&gt;
|5&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|5&lt;br /&gt;
|-&lt;br /&gt;
|6&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda \lambda 1&amp;lt;/math&amp;gt;&lt;br /&gt;
|6&lt;br /&gt;
|-&lt;br /&gt;
|7&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda \lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|7&lt;br /&gt;
|-&lt;br /&gt;
|8&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f(4) = 26&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|9&lt;br /&gt;
|&amp;lt;math&amp;gt;\lambda \lambda \lambda 2&amp;lt;/math&amp;gt;&lt;br /&gt;
|9&lt;br /&gt;
|-&lt;br /&gt;
|10&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda \lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f(6) = 36&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|11&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda \lambda 2)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f(7) = 41&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|12&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (\lambda 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^{2}(4) = 266&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|13&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda \lambda 2)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f(9) = 51&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|14&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (\lambda \lambda 1))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^{2}(6) = f(36) = 25 \times 2^{2^{2^{3}}}+36 &amp;gt; 2.85 \times 10^{78}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|15&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (\lambda \lambda 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^{2}(7) = f(41) = 25 \times 3^{3^{85}}+36 &amp;gt; 10^{10^{40}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|16&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (1 (\lambda 1)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^{3}(4) = f(266)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|17&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (\lambda \lambda \lambda 2))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^2(9) = f(51)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|18&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda 1) 1 (\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^4(4) &amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|19&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (1 (\lambda \lambda 2)))&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^3(7)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|20&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda \lambda 1) 1 (\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^6(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|21&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda \lambda 2) 1 (\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^7(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|22&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (1 (\lambda 1)) 1 (\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;f^{26}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|...&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|28&lt;br /&gt;
|&amp;lt;math&amp;gt;1 (\lambda 1) 1 (\lambda 1) 1 (\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\ge f^{BB \lambda(f^3(4))}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|29&lt;br /&gt;
|&amp;lt;math&amp;gt;1(\lambda 1)(\lambda 1 2 1)(\lambda 1)&amp;lt;/math&amp;gt;&lt;br /&gt;
|&amp;lt;math&amp;gt;\ge f^{BB \lambda(f^{BB \lambda(f^4(4))+4}(4))+BB \lambda(f^4(4))+5}(4)&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
We can generalize BBλ&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; to BBλ&amp;lt;sub&amp;gt;α&amp;lt;/sub&amp;gt; for ordinals α by using oracle function BBλ&amp;lt;sub&amp;gt;α-1&amp;lt;/sub&amp;gt; for successor ordinal α, and oracle function (\n -&amp;gt; BBλ&amp;lt;sub&amp;gt;α[n]&amp;lt;/sub&amp;gt;(n)) for limit ordinal α, assuming well-defined fundamental sequences up to α. Because of limited oracle inputs, all oracle busy beavers have identical values up to n=11.&lt;br /&gt;
&lt;br /&gt;
== See Also ==&lt;br /&gt;
* [[Busy Beaver for SKI calculus|SKI calculus]]&lt;br /&gt;
* [[De Bruijn index]]&lt;br /&gt;
* https://oeis.org/A333479&lt;br /&gt;
* [https://www.mdpi.com/1099-4300/28/5/494 The Largest Number Representable in 64 Bits]. 26 Apr 2026. John Tromp.&lt;br /&gt;
* [https://gist.github.com/tromp/86b3184f852f65bfb814e3ab0987d861 Binary Lambda Calculus]. John Tromp.&lt;br /&gt;
* https://github.com/tromp/AIT/tree/master/BB&lt;br /&gt;
* https://github.com/ccz181078/BLC.git&lt;br /&gt;
* https://docs.google.com/spreadsheets/d/1jZ6TK9m3xmXUlC69727T-8WwvhALcsp8FrK6DzgThtw&lt;br /&gt;
* Buchholz, W. (1986). A new system of proof-theoretic ordinal functions. &#039;&#039;Annals of Pure and Applied Logic, 32&#039;&#039;, 195-207. https://doi.org/10.1016/0168-0072(86)90052-7&lt;br /&gt;
* Maksudov, D. (2017, April). &#039;&#039;Travelling To The Infinity - The extended Wilfried Buchholz&#039;s functions.&#039;&#039; Travelling To The Infinity. https://sites.google.com/site/travelingtotheinfinity/the-extension-of-buchholz-s-function&lt;br /&gt;
[[category:Functions]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Beaver_Math_Olympiad&amp;diff=9657</id>
		<title>Beaver Math Olympiad</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Beaver_Math_Olympiad&amp;diff=9657"/>
		<updated>2026-10-26T20:12:28Z</updated>

		<summary type="html">&lt;p&gt;Sligocki: /* 12. [2/15, 1/6, 441/2, 11/3, 25/7, 6/11] */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Beaver Mathematical Olympiad&#039;&#039;&#039; (BMO) is an attempt to re-formulate the halting problem for some particular Turing machines as a mathematical problem in a style suitable for a hypothetical math olympiad. &lt;br /&gt;
&lt;br /&gt;
The purpose of the BMO is twofold. First, statements where non-essential details (related to tape encoding, number of steps, etc.) are discarded are more suitable to be shared with mathematicians who perhaps are able to help. Second, it&#039;s a way to jokingly highlight how a hard question could appear deceptively simple.&lt;br /&gt;
&lt;br /&gt;
BMO problems have been formalized in Lean and added to the DeepMind formal-conjectures database ([https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Other/BeaverMathOlympiad.lean Github]).&lt;br /&gt;
&lt;br /&gt;
== Unsolved problems ==&lt;br /&gt;
&lt;br /&gt;
=== 1. {{TM|1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0LB0LE|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 1}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;(b_n)_{n \ge 1}&amp;lt;/math&amp;gt; be two sequences such that &amp;lt;math&amp;gt;(a_1, b_1) = (1, 2)&amp;lt;/math&amp;gt; and&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;(a_{n+1}, b_{n+1}) = \begin{cases}&lt;br /&gt;
(a_n-b_n, 4b_n+2) &amp;amp; \text{if }a_n \ge b_n \\&lt;br /&gt;
(2a_n+1, b_n-a_n) &amp;amp; \text{if }a_n &amp;lt; b_n&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for all positive integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Does there exist a positive integer &amp;lt;math&amp;gt;i&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;a_i = b_i&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
The first 10 values of &amp;lt;math&amp;gt;(a_n, b_n)&amp;lt;/math&amp;gt; are &amp;lt;math&amp;gt;(1, 2), (3, 1), (2, 6), (5, 4), (1, 18), (3, 17), (7, 14), (15, 7), (8, 30), (17, 22)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== 2. [[Hydra]] and [[Antihydra]] ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 0}&amp;lt;/math&amp;gt; be a sequence such that &amp;lt;math&amp;gt;a_{n+1} = a_n+\left\lfloor\frac{a_n}{2}\right\rfloor&amp;lt;/math&amp;gt; for all non-negative integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
# If &amp;lt;math&amp;gt;a_0=3&amp;lt;/math&amp;gt;, does there exist a non-negative integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that the list of numbers &amp;lt;math&amp;gt;a_0, a_1, a_2, \dots, a_k&amp;lt;/math&amp;gt; have more than twice as many even numbers as odd numbers? ([[Hydra]])&lt;br /&gt;
# If &amp;lt;math&amp;gt;a_0=8&amp;lt;/math&amp;gt;, does there exist a non-negative integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that the list of numbers &amp;lt;math&amp;gt;a_0, a_1, a_2, \dots, a_k&amp;lt;/math&amp;gt; have more than twice as many odd numbers as even numbers? ([[Antihydra]])&lt;br /&gt;
&lt;br /&gt;
=== 5. {{TM|1RB0LD_1LC0RA_1RA1LB_1LA1LE_1RF0LC_---0RE|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 1}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;(b_n)_{n \ge 1}&amp;lt;/math&amp;gt; be two sequences such that &amp;lt;math&amp;gt;(a_1, b_1) = (0, 5)&amp;lt;/math&amp;gt; and&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;(a_{n+1}, b_{n+1}) = \begin{cases}&lt;br /&gt;
(a_n+1, b_n-f(a_n)) &amp;amp; \text{if } b_n \ge f(a_n) \\&lt;br /&gt;
(a_n, 3b_n+a_n+5) &amp;amp; \text{if } b_n &amp;lt; f(a_n)&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;f(x)=10\cdot 2^x-1&amp;lt;/math&amp;gt; for all non-negative integers &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;. &lt;br /&gt;
&lt;br /&gt;
Does there exist a positive integer &amp;lt;math&amp;gt;i&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;b_i = f(a_i)-1&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
=== 6. [[Space Needle]] ===&lt;br /&gt;
Let &amp;lt;math&amp;gt;f(b) = b + k + 3a&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;a&amp;lt;/math&amp;gt; are non-negative integers satisfying &amp;lt;math&amp;gt;b = (2a+1)\cdot 2^k&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Now consider the iterated application of the function &amp;lt;math&amp;gt;f^{n+1}(b) = f(f^n(b))&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;f^0(b)=b&amp;lt;/math&amp;gt;. Does there exist a non-negative integer &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;f^n(6)&amp;lt;/math&amp;gt; equals a power of 2?&lt;br /&gt;
&lt;br /&gt;
=== 8. {{TM|1RB0LD_0RC1RB_0RD0RA_1LE0RD_1LF---_0LA1LA|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 1}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;(b_n)_{n \ge 1}&amp;lt;/math&amp;gt; be two sequences such that &amp;lt;math&amp;gt;(a_1, b_1) = (10, 12)&amp;lt;/math&amp;gt; and&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;(a_{n+1}, b_{n+1}) = \begin{cases}&lt;br /&gt;
(a_n-\left\lfloor\frac{b_n}{2}\right\rfloor-3, 3\left\lfloor\frac{b_n+1}{2}\right\rfloor+6) &amp;amp; \text{if }a_n &amp;gt; \left\lfloor\frac{b_n}{2}\right\rfloor \\&lt;br /&gt;
(3a_n+5, b_n-2a_n) &amp;amp; \text{if }a_n \le \left\lfloor\frac{b_n}{2}\right\rfloor&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for all positive integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Does there exist a positive integer &amp;lt;math&amp;gt;i&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;a_n = \left\lfloor \frac{b_n}{2} \right\rfloor + 1&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
=== 10. {{TM|1RB0LB_0RC0LD_1LD1RE_0LA0RF_0RD1RF_0RC---|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;\Sigma=\{0,1,\#\}&amp;lt;/math&amp;gt;.  Consider two-sided infinite words over &amp;lt;math&amp;gt;\Sigma&amp;lt;/math&amp;gt;.  The initial word is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
w^{(0)}=\cdots 10\#10\#10\#10\#0000\cdots,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
that is, a left-infinite repetition of &amp;lt;math&amp;gt;10\#&amp;lt;/math&amp;gt;, followed by a right-infinite tail of &amp;lt;math&amp;gt;0&amp;lt;/math&amp;gt;&#039;s.&lt;br /&gt;
&lt;br /&gt;
The rewrite rules are&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#0 \to 1,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#100 \to 000\#,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#110 \to 000\#,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#1010 \to 1010\#\#.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A rewrite step consists of choosing any occurrence of the left-hand side of one of these rules in the current word and replacing it by the corresponding right-hand side.  The&lt;br /&gt;
occurrence may be chosen arbitrarily; there is no prescribed reduction order.&lt;br /&gt;
&lt;br /&gt;
At any stage, call a symbol &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; active if it is the leftmost symbol of an occurrence of one of the four left-hand sides above.  Equivalently, a &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; is&lt;br /&gt;
active if the word beginning at that &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; starts with one of&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#0,\qquad \#100,\qquad \#110,\qquad \#1010.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The question is whether there exists some finite sequence of rewrite steps, starting from &amp;lt;math&amp;gt;w^{(0)}&amp;lt;/math&amp;gt;, after which the rightmost occurrence of &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; is not&lt;br /&gt;
active.  In other words, does there exist a rewrite order such that the rightmost &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; can no longer be rewritten?&lt;br /&gt;
&lt;br /&gt;
=== 11. {{TM|1RB0LD_0LC0RE_1LA0RD_0RB0LC_1RC1RF_0LD---|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;\Sigma=\{0,1,\#\}&amp;lt;/math&amp;gt;.  Consider two-sided infinite words over &amp;lt;math&amp;gt;\Sigma&amp;lt;/math&amp;gt;.  The initial word is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
w^{(0)}=\cdots 10\#10\#10\#10\#0000\cdots,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
that is, a left-infinite repetition of &amp;lt;math&amp;gt;10\#&amp;lt;/math&amp;gt;, followed by a right-infinite tail of &amp;lt;math&amp;gt;0&amp;lt;/math&amp;gt;&#039;s.&lt;br /&gt;
&lt;br /&gt;
The rewrite rules are&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#0 \to 1,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#100 \to 010\#,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#1010 \to 1010\#\#,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#10110 \to 10101,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#11 \to 10.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A rewrite step consists of choosing any occurrence of the left-hand side of one of these rules in the current word and replacing it by the corresponding right-hand side.  The&lt;br /&gt;
occurrence may be chosen arbitrarily; there is no prescribed reduction order.&lt;br /&gt;
&lt;br /&gt;
At any stage, call a symbol &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; active if it is the leftmost symbol of an occurrence of one of the five left-hand sides above.  Equivalently, a &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; is&lt;br /&gt;
active if the word beginning at that &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; starts with one of&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\#0,\qquad \#100,\qquad \#1010,\qquad \#10110,\qquad \#11.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The question is whether there exists some finite sequence of rewrite steps, starting from &amp;lt;math&amp;gt;w^{(0)}&amp;lt;/math&amp;gt;, after which the rightmost occurrence of &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; is not&lt;br /&gt;
active.  In other words, does there exist a rewrite order such that the rightmost &amp;lt;math&amp;gt;\#&amp;lt;/math&amp;gt; can no longer be rewritten?&lt;br /&gt;
&lt;br /&gt;
=== 12. [2/15, 1/6, 441/2, 11/3, 25/7, 6/11] ===&lt;br /&gt;
Let &amp;lt;math&amp;gt;(h_n)_{n \ge 1}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;(w_n)_{n \ge 1}&amp;lt;/math&amp;gt; be two sequences such that &amp;lt;math&amp;gt;(h_1, w_1) = (1, 2)&amp;lt;/math&amp;gt; and&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;h_{n+1} = \left\lceil \frac{8 h_n}{3} \right\rceil&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;&lt;br /&gt;
w_{n+1} = \begin{cases}&lt;br /&gt;
  w_n - 1 &amp;amp; \text{if }h_n \equiv 0 \pmod{3} \\&lt;br /&gt;
  w_n     &amp;amp; \text{if }h_n \equiv 1 \pmod{3} \\&lt;br /&gt;
  w_n + 1 &amp;amp; \text{if }h_n \equiv 2 \pmod{3}&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for all positive integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Does there exist a positive integer &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;w_n = 0&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
== Solved problems ==&lt;br /&gt;
&lt;br /&gt;
=== 3. {{TM|1RB0RB3LA4LA2RA_2LB3RA---3RA4RB|non-halt}} and {{TM|1RB1RB3LA4LA2RA_2LB3RA---3RA4RB|non-halt}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;v_2(n)&amp;lt;/math&amp;gt; be the largest integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;2^k&amp;lt;/math&amp;gt; divides &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Let &amp;lt;math&amp;gt;(a_n)_{n \ge 0}&amp;lt;/math&amp;gt; be a sequence such that&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;a_n = \begin{cases}&lt;br /&gt;
2 &amp;amp; \text{if } n=0 \\&lt;br /&gt;
a_{n-1}+2^{v_2(a_{n-1})+2}-1 &amp;amp; \text{if } n \ge 1&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for all non-negative integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;. Is there an integer &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;a_n=4^k&amp;lt;/math&amp;gt; for some positive integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
Link to Discord discussion: https://discord.com/channels/960643023006490684/1084047886494470185/1252634913220591728&lt;br /&gt;
&lt;br /&gt;
Formalised solution: [https://discord.com/channels/960643023006490684/1259770421046411285/1488737894943166604 Initial announcement], [https://discord.com/channels/960643023006490684/1259770421046411285/1488743526882738276 Lean proof], [https://discord.com/channels/960643023006490684/1259770421046411285/1488781537699696821 LLM-translated Rocq proof], [https://discord.com/channels/960643023006490684/1259770421046411285/1488898995865784442 Proof of closure of existing mid-level rules].&lt;br /&gt;
&lt;br /&gt;
=== 4. {{TM|1RB3RB---1LB0LA_2LA4RA3LA4RB1LB|non-halt}} ===&lt;br /&gt;
&lt;br /&gt;
Bonnie the beaver was bored, so she tried to construct a sequence of integers &amp;lt;math&amp;gt;\{a_n\}_{n \ge 0}&amp;lt;/math&amp;gt;. She first defined &amp;lt;math&amp;gt;a_0=2&amp;lt;/math&amp;gt;, then defined &amp;lt;math&amp;gt;a_{n+1}&amp;lt;/math&amp;gt; depending on &amp;lt;math&amp;gt;a_n&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; using the following rules:&lt;br /&gt;
&lt;br /&gt;
* If &amp;lt;math&amp;gt;a_n \equiv 0\text{ (mod 3)}&amp;lt;/math&amp;gt;, then &amp;lt;math&amp;gt;a_{n+1}=\frac{a_n}{3}+2^n+1&amp;lt;/math&amp;gt;.&lt;br /&gt;
* If &amp;lt;math&amp;gt;a_n \equiv 2\text{ (mod 3)}&amp;lt;/math&amp;gt;, then &amp;lt;math&amp;gt;a_{n+1}=\frac{a_n-2}{3}+2^n-1&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
With these two rules alone, Bonnie calculates the first few terms in the sequence: &amp;lt;math&amp;gt;2, 0, 3, 6, 11, 18, 39, 78, 155, 306, \dots&amp;lt;/math&amp;gt;. At this point, Bonnie plans to continue writing terms until a term becomes &amp;lt;math&amp;gt;1\text{ (mod 3)}&amp;lt;/math&amp;gt;. If Bonnie sticks to her plan, will she ever finish?&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Solution&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
How to guess the closed-form solution: Firstly, notice that &amp;lt;math&amp;gt;a_n \approx \frac{3}{5} \times 2^n&amp;lt;/math&amp;gt;. Secondly, calculate the error term &amp;lt;math&amp;gt;a_n - \frac{3}{5} \times 2^n&amp;lt;/math&amp;gt;. The error term appears to have a period of 4. This leads to the following guess:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;a_n=\frac{3}{5}\begin{cases}&lt;br /&gt;
2^n+\frac{7}{3} &amp;amp;\text{if } n\equiv 0 \pmod{4}\\&lt;br /&gt;
2^n-2 &amp;amp;\text{if } n\equiv 1 \pmod{4}\\&lt;br /&gt;
2^n+1 &amp;amp;\text{if } n\equiv 2 \pmod{4}\\&lt;br /&gt;
2^n+2 &amp;amp;\text{if } n\equiv 3 \pmod{4}&lt;br /&gt;
\end{cases}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This closed-form solution can be proven correct by induction. Unfortunately, the induction may require a lot of tedious calculations.&lt;br /&gt;
&lt;br /&gt;
For all &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt;, we have &amp;lt;math&amp;gt;a_{4k} \equiv 2\text{ (mod 3)}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;a_{4k+1} \equiv a_{4k+2} \equiv a_{4k+3} \equiv 0\text{ (mod 3)}&amp;lt;/math&amp;gt;. Therefore, Bonnie will never finish.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== 7. {{TM|1RB1RF_1RC0RA_1LD1RC_1LE0LE_0RA0LD_0RB---|non-halt}} ===&lt;br /&gt;
Let &amp;lt;math&amp;gt;v_2(n)&amp;lt;/math&amp;gt; be the largest integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;2^k&amp;lt;/math&amp;gt; divides &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;f(n) = n+1+(v_2(n+1) \bmod 2)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Now consider the iterated application of the function &amp;lt;math&amp;gt;f^{n+1}(b) = f(f^n(b))&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;f^0(b)=b&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;(a_n)_{n \ge 0}&amp;lt;/math&amp;gt; be a sequence such that &amp;lt;math&amp;gt;a_0=1&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;a_{n+1} = f^{n+2}\left(\left\lfloor\frac{a_n}{2}\right\rfloor\right)&amp;lt;/math&amp;gt; for all non-negative integers &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Does there exist a non-negative integer &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;a_k&amp;lt;/math&amp;gt; is even?&lt;br /&gt;
&lt;br /&gt;
(for simplicity, this question is slightly stronger than the halting problem of this TM)&lt;br /&gt;
&lt;br /&gt;
Link to Discord discussion: https://discord.com/channels/960643023006490684/1421782442213376000/1431483206208852001&lt;br /&gt;
&lt;br /&gt;
=== 9. {{TM|1RB1LA_1RC0RD_1LA---_1RE1RD_1LF0LA_---0LE|undecided}} ===&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;\mathbb{N}=\{0,1,2,\ldots\}&amp;lt;/math&amp;gt;.  Consider configurations given by infinite sequences of non-negative integers,&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\mathbb{N}^{\omega}&lt;br /&gt;
=&lt;br /&gt;
\{(x_0,x_1,x_2,\ldots): x_i\in\mathbb{N}\}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Define a partial transition map&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
T:\mathbb{N}^{\omega}\to \mathbb{N}^{\omega}\cup\{\mathrm{Halt}\}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
by the following rewrite rules.  For all &amp;lt;math&amp;gt;a,b,c\in\mathbb{N}&amp;lt;/math&amp;gt; and every infinite tail sequence &amp;lt;math&amp;gt;\mathbf r\in\mathbb{N}^{\omega}&amp;lt;/math&amp;gt;,&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(0,a,c,\mathbf r)\mapsto (3+a+c,\mathbf r),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(1,0,\mathbf r)\mapsto \mathrm{Halt},&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(1,1+a,c,\mathbf r)\mapsto (a,0,1,1+c,\mathbf r),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(2+a,b,c,\mathbf r)\mapsto (a,1+b,1+c,\mathbf r).&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The initial configuration is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\mathbf x^{(0)}=(0,0,0,0,\ldots).&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The question is whether the orbit of &amp;lt;math&amp;gt;\mathbf x^{(0)}&amp;lt;/math&amp;gt; under repeated application of &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt; eventually halts; that is, whether there exists some&lt;br /&gt;
&amp;lt;math&amp;gt;n\in\mathbb{N}&amp;lt;/math&amp;gt; such that&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
T(\mathbf x^{(n)})=\mathrm{Halt},&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\mathbf x^{(n+1)}=T(\mathbf x^{(n)})&amp;lt;/math&amp;gt; whenever the right-hand side is not &amp;lt;math&amp;gt;\mathrm{Halt}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
== Practice Problems ==&lt;br /&gt;
Problems that are not BMO-level, but provide counter-examples to certain [[probvious]] intuition:&lt;br /&gt;
&lt;br /&gt;
* {{TM|1RB0LE_1LC1RA_---1LD_0RB1LF_1RD1LA_0LA0RD}}&lt;br /&gt;
* {{TM|1RB0RD_0LC1RA_0RA1LB_1RE1LB_1LF1LB_---1LE}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Individual machines]]&lt;/div&gt;</summary>
		<author><name>Sligocki</name></author>
	</entry>
</feed>