<?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=Big+numbers</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=Big+numbers"/>
	<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/wiki/Special:Contributions/Big_numbers"/>
	<updated>2026-11-18T19:04:54Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.5</generator>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB0LF_1RC1RA_0RD0RB_1LE---_0LA1LE_1RD1LA&amp;diff=9705</id>
		<title>1RB0LF 1RC1RA 0RD0RB 1LE--- 0LA1LE 1RD1LA</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB0LF_1RC1RA_0RD0RB_1LE---_0LA1LE_1RD1LA&amp;diff=9705"/>
		<updated>2026-10-27T19:34:58Z</updated>

		<summary type="html">&lt;p&gt;Big numbers: Added my analysis to this&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RB0LF_1RC1RA_0RD0RB_1LE---_0LA1LE_1RD1LA}}&lt;br /&gt;
&lt;br /&gt;
{{TM|1RB0LF_1RC1RA_0RD0RB_1LE---_0LA1LE_1RD1LA}} is a [[BB(6)]] potential [[Cryptid]] first analyzed by discord user Big_numbers, and then independently found by Marco Dos Santos using Gemini and reported in his paper [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]. The [[probvious]] behavior of these TMs has not yet been analyzed.&lt;br /&gt;
&lt;br /&gt;
== Analysis by Big_numbers ==&lt;br /&gt;
 A(a,b) = 0^inf 1^a 1A 1^b 01 0^inf&lt;br /&gt;
 A(a,b)-&amp;gt;A(2a+6, b-a-3)&lt;br /&gt;
 If (b-a-3)&amp;lt;0:&lt;br /&gt;
     If b is 3:&lt;br /&gt;
         If a mod 4 is 0:&lt;br /&gt;
             A(a, 3)-&amp;gt;A(a+8, 2)&lt;br /&gt;
         If a mod 4 is 2:&lt;br /&gt;
             A(a, 3)-&amp;gt;A(6, a+13)&lt;br /&gt;
     If b is 1:&lt;br /&gt;
         If a mod 4 is 0:&lt;br /&gt;
             A(a, 1)-&amp;gt;A(22, a-2)&lt;br /&gt;
         If a mod 4 is 2:&lt;br /&gt;
             A(a, 1)-&amp;gt;A(6, a+7)&lt;br /&gt;
     If b mod 2 is 1:&lt;br /&gt;
         If (a-b+1)/2 mod 2 is 1:&lt;br /&gt;
         A(a,b)-&amp;gt;A(a-b+11, 2b-4)&lt;br /&gt;
         If (a-b+1)/2 mod 2 is 0:&lt;br /&gt;
             If (a-b)&amp;gt;0:&lt;br /&gt;
             A(a,b)-&amp;gt;A(a-b+19, 2b-8)&lt;br /&gt;
             If (a-b)&amp;lt;0:&lt;br /&gt;
             A(a,b)-A(6, a+b+2)&lt;br /&gt;
     If b mod 2 is 0:&lt;br /&gt;
         If (a-b)/2 mod 2 is 1:&lt;br /&gt;
         A(a,b)-&amp;gt;A(6, a+b+7)&lt;br /&gt;
         If (a-b)/2 mod 2 is 0:&lt;br /&gt;
         A(a,b)-&amp;gt;A(22, a+b-2)&lt;br /&gt;
 &lt;br /&gt;
 A(a, a+3)-&amp;gt;halt&lt;br /&gt;
 A(4n+2, 8n+22)-&amp;gt;nonhalt for n&amp;gt;1 (gets stuck in a loop)&lt;br /&gt;
 Starts at A(6, 1)&lt;br /&gt;
&lt;br /&gt;
== Analysis by Marco Dos Santos ==&lt;br /&gt;
&amp;lt;pre&amp;gt;Consider:&lt;br /&gt;
J(u, v, w) = 0^inf 1^5 10^u 1 A&amp;gt; 11 01^v 1^w 01 0^inf&lt;br /&gt;
S_E(b, m, k) = 0^inf 1^5 10^b E&amp;gt; 1 1101^m 1^6 11^k 01 0^inf&lt;br /&gt;
S_{E,0}(b, m) = 0^inf 1^5 10^b E&amp;gt; 1 1101^m 1101 0^inf&lt;br /&gt;
S_{E,1}(b, m, n) = 0^inf 1^5 10^b E&amp;gt; 1 1101^m 111 01^n 01001 0^inf&lt;br /&gt;
&lt;br /&gt;
J(0, v, 0) -&amp;gt; S_{E,0}(v+3, 0)&lt;br /&gt;
J(0, v, 1) -&amp;gt; S_{E,1}(v+2, 0, 0)&lt;br /&gt;
J(0, v, 2) -&amp;gt; S_E(v+2, 0, 0)&lt;br /&gt;
J(0, v, w) -&amp;gt; J(v+3, 0, w-3) if w &amp;gt;= 3&lt;br /&gt;
J(1, v, 0) -&amp;gt; S_E(0, 0, v+3)&lt;br /&gt;
J(u, v, 0) -&amp;gt; S_{E,1}(u-2, 0, v+2) if u &amp;gt;= 2&lt;br /&gt;
J(1, v, 1) -&amp;gt; Halt&lt;br /&gt;
J(u, v, 1) -&amp;gt; S_E(u-2, 0, v+2) if u &amp;gt;= 2&lt;br /&gt;
J(u, v, w) -&amp;gt; J(u-1, v+2, w-2) if u &amp;gt;= 1 and w &amp;gt;= 2&lt;br /&gt;
&lt;br /&gt;
S_E(0, 0, k) -&amp;gt; J(0, 0, 2k+6)&lt;br /&gt;
S_E(0, m, k) -&amp;gt; J(2, 2m+2, 2k+1) if m &amp;gt;= 1&lt;br /&gt;
S_E(1, m, k) -&amp;gt; J(0, 2m+3, 2k+1)&lt;br /&gt;
S_E(b, m, k) -&amp;gt; S_E(b-2, m+1, k) if b &amp;gt;= 2&lt;br /&gt;
&lt;br /&gt;
S_{E,0}(0, m) -&amp;gt; S_E(2, 0, 2m)&lt;br /&gt;
S_{E,0}(1, m) -&amp;gt; S_E(0, 0, 2m+1)&lt;br /&gt;
S_{E,0}(b, m) -&amp;gt; S_{E,0}(b-2, m+1) if b &amp;gt;= 2&lt;br /&gt;
&lt;br /&gt;
S_{E,1}(0, m, n) -&amp;gt; S_E(2, 0, 2m+n+2)&lt;br /&gt;
S_{E,1}(1, m, n) -&amp;gt; S_E(0, 0, 2m+n+3)&lt;br /&gt;
S_{E,1}(b, m, n) -&amp;gt; S_{E,1}(b-2, m+1, n) if b &amp;gt;= 2&lt;br /&gt;
&lt;br /&gt;
Start: J(0, 0, 0), reached after 35 raw TM steps&amp;lt;/pre&amp;gt;This can be simplified to:&amp;lt;pre&amp;gt;&lt;br /&gt;
Consider:&lt;br /&gt;
J(u, v, w) = 0^inf 1^5 10^u 1 A&amp;gt; 11 01^v 1^w 01 0^inf&lt;br /&gt;
&lt;br /&gt;
J(0, v, 0) -&amp;gt; J(0, 0, 2v+12) if v is even&lt;br /&gt;
J(0, v, 0) -&amp;gt; J(2, 4, 2v+7) if v is odd&lt;br /&gt;
J(0, v, 1) -&amp;gt; J(2, 4, 2v+9) if v is even&lt;br /&gt;
J(0, v, 1) -&amp;gt; J(0, 0, 2v+14) if v is odd&lt;br /&gt;
J(0, v, 2) -&amp;gt; J(2, v+4, 1) if v is even&lt;br /&gt;
J(0, v, 2) -&amp;gt; J(0, v+4, 1) if v is odd&lt;br /&gt;
J(0, v, w) -&amp;gt; J(v+3, 0, w-3) if w &amp;gt;= 3&lt;br /&gt;
&lt;br /&gt;
J(1, v, 0) -&amp;gt; J(0, 0, 2v+12)&lt;br /&gt;
J(u, v, 0) -&amp;gt; J(2, 4, 2u+2v+5) if u &amp;gt;= 2 and u is even&lt;br /&gt;
J(u, v, 0) -&amp;gt; J(0, 0, 2u+2v+10) if u &amp;gt;= 3 and u is odd&lt;br /&gt;
&lt;br /&gt;
J(1, v, 1) -&amp;gt; Halt&lt;br /&gt;
J(2, v, 1) -&amp;gt; J(0, 0, 2v+10)&lt;br /&gt;
J(u, v, 1) -&amp;gt; J(2, u, 2v+5) if u &amp;gt;= 4 and u is even&lt;br /&gt;
J(u, v, 1) -&amp;gt; J(0, u, 2v+5) if u &amp;gt;= 3 and u is odd&lt;br /&gt;
&lt;br /&gt;
J(u, v, w) -&amp;gt; J(u-1, v+2, w-2) if u &amp;gt;= 1 and w &amp;gt;= 2&lt;br /&gt;
&lt;br /&gt;
Start: J(0, 0, 0), reached after 35 raw TM steps&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by hipparcos ==&lt;br /&gt;
 G(c, b) = A(2c + 6, b)&lt;br /&gt;
 G(c, b) = 0^inf 1^6 11^c A&amp;gt; 1 1^b 01 0^inf&lt;br /&gt;
 G(c, b) -&amp;gt;&lt;br /&gt;
 (a) Halt                       b = 0&lt;br /&gt;
 (b) G(0, 2c+13)                b = 1, c ≡ 0 mod 2&lt;br /&gt;
 (c) G(8, 2c+4)                 b = 1, c ≡ 1 mod 2&lt;br /&gt;
 (d) G(0, 2c+19)                b = 3, c ≡ 0 mod 2&lt;br /&gt;
 (e) G(c+4, 2)                  b = 3, c ≡ 1 mod 2&lt;br /&gt;
 (f) G(0, 2c+b+13)              2 &amp;lt;= b &amp;lt; 2c+9,  b ≡ 0, c + b/2 ≡ 0 mod 2&lt;br /&gt;
 (g) G(8, 2c+b+4)               2 &amp;lt;= b &amp;lt; 2c+9,  b ≡ 0, c + b/2 ≡ 1 mod 2&lt;br /&gt;
 (h) G(c - (b-1)/2 + 5, 2b-4)   5 &amp;lt;= b &amp;lt; 2c+9,  b ≡ 1, c + (b-1)/2 ≡ 0 mod 2&lt;br /&gt;
 (i) G(c - (b-1)/2 + 9, 2b-8)   5 &amp;lt;= b &amp;lt;= 2c+5, b ≡ 1, c + (b-1)/2 ≡ 1 mod 2&lt;br /&gt;
 (j) G(0, 2c+b+8)               b = 2c+7,       b ≡ 1, c + (b-1)/2 ≡ 1 mod 2&lt;br /&gt;
 (k) G(2c+6, b-2c-9)            b &amp;gt;= 2c+9&lt;br /&gt;
 Starts from G(0, 1)&lt;br /&gt;
 Loop is at G(2n, 8n+30)&lt;br /&gt;
[[Category:BB(6)]][[Category:Potential Cryptids]]&lt;/div&gt;</summary>
		<author><name>Big numbers</name></author>
	</entry>
</feed>