View source for 1RB1RB 1LC0RE ---1LD 0RA1LB 1RA1LF 0LE1LE

{{machine|1RB1RB_1LC0RE_---1LD_0RA1LB_1RA1LF_0LE1LE}}
{{TM|1RB1RB_1LC0RE_---1LD_0RA1LB_1RA1LF_0LE1LE}} is a [[BB(6)]] potential [[Cryptid]] 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.

== Analysis by Marco Dos Santos ==
<pre>
Consider:
C(a, c, f) = 0^inf 1^a 0 1^c 0 1 <D 1^f 0^inf where a, c are even, a >= 2, c >= 2, f >= 1

C(2k, 2m, f) -> C(2, 2m-2k+2, f+6k-6) if 2 <= k < m, f >= 1
C(2k, 2m, f) -> C(2k-2m+2, 2, f+6m-6) if 2 <= m < k, f >= 1
C(2k, 2k, f) -> C(2, 2, f+6k-6) if k >= 2, f >= 1
C(2k, 2, 2j) -> C(2k-4, 2j+8, 2) if k >= 3, j >= 1
C(2k, 2, 2j+1) -> C(2k-4, 2j+8, 5) if k >= 3, j >= 0
C(4, 2, 2j) -> C(2j+4, 6, 5) if j >= 1
C(4, 2, 2j+1) -> C(2j+8, 2, 2) if j >= 0
C(2, 2m, 2j) -> C(2m-6, 2j+10, 5) if m >= 4, j >= 1
C(2, 2m, 2j+1) -> C(2m-6, 2j+12, 2) if m >= 4, j >= 0
C(2, 6, 2j) -> C(2j+10, 2, 2) if j >= 1
C(2, 6, 2j+1) -> C(2j+8, 6, 5) if j >= 0
C(2, 4, f) -> Halt if f >= 1
C(2, 2, f) -> Halt if f >= 1

Start: C(6, 2, 2), reached after 76 raw TM steps
</pre>
[[Category:BB(6)]][[Category:Potential Cryptids]]