1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF

From BusyBeaverWiki
Revision as of 20:14, 13 May 2025 by Sligocki (talk | contribs) (Fix broken math)
Jump to navigation Jump to search

1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF (bbch) is a halting BB(7) TM which runs for over 2122123 steps.

Analysis by Shawn Ligocki

Consider general configurations matching the regex:

011(1(01)*)*0011100A>0

Low level rules

              01 1 01^n 0011100 A> 00   -->                 1 01^n+2 0011100 A>
           01^3 11 01^n 0011100 A> 0^6  -->            1 01^n+5 1 01 0011100 A>
01^3 (1 01)^k+1 11 01^n 0011100 A> 0^6  -->  1 01^n+6 (1 01)^k 11 01 0011100 A>
 011 (1 01)^k   11 01^n 0011100 A> 0^2  -->  1 Z> 111 01^n+1 00 101^k+2

Mid level rules

Let

B(a;b,c,...,z)=0111(01)3z+111(01)3c+11(01)3b+11(01)01(01)3a+10011100A>0

and let B(a; [x]*k, y, ...) = B(a;x,,xk,y,...) (In other words, [x]*k represents k repeats of the value x in a config).

then

B(a; b+1, ...) -> B(2a+4; b, ...)
B(a; [0]*k, 0, n+1, ...) -> B(0; [0]*k, a+2, n, ...)
B(a; [0]*k) -> Halt(3a + 2k + 9)

Start at step 8178: B(2, [1]*12)

High level rule

Let

f0(x)=2x+4fk+1(x)=fkx+2(0)

then

B(a;0,,0k,n,...)B(fkn(a);0,,0k,0,...)

Bound

Let

a0=2ak+1=fk(ak)

then

B(a0;1,,1k)B(ak,0,,0k)Halt(3ak+2k+9)and

StartB(a0;1,,112)

and so this TM halts with a sigma score of σ=3a12+33

Note that fk(x)=(2k(x+4))4 and so for k2,

ak+4>2k2k3

and so this TM halts with sigma score σ>2122123.

This bound is pretty tight: σ<2122124.