bbchallenge - #individual-machines

``` 1RB1RA_0LC1LE_1LD1LC_1LA0LB_1LF1RE_---0RA (0^inf 1^4 0 1^1 0 1^19) A> (1^0 0 0^inf) (0^inf 1^6 0 1^2 0 1^31) A> (1^0 0 0^inf) (0^inf 1^5 0 1^1 0 1^52) A> (1^0 0 0^inf) (0^inf 1^7 0 1^1 0 1^82) A> (1^0 0 0^inf) (0^inf 1^9 0 1^1 0 1^127) A> (1^0 0 0^inf) (0^inf 1^11 0 1^2 0 1^193) A> (1^0 0 0^inf) (0^inf 1^10 0 1^1 0 1^295) A> (1^0 0 0^inf) (0^inf 1^12 0 1^2 0 1^445) A> (1^0 0 0^inf) (0^inf 1^11 0 1^1 0 1^673) A> (1^0 0 0^inf) (0^inf 1^13 0 1^2 0 1^1012) A> (1^0 0 0^inf) (0^inf 1^12 0 1^2 0 1^1522) A> (1^0 0 0^inf) (0^inf 1^11 0 1^2 0 1^2287) A> (1^0 0 0^inf) (0^inf 1^10 0 1^1 0 1^3436) A> (1^0 0 0^inf) (0^inf 1^12 0 1^1 0 1^5158) A> (1^0 0 0^inf) (0^inf 1^14 0 1^1 0 1^7741) A> (1^0 0 0^inf) (0^inf 1^16 0 1^2 0 1^11614) A> (1^0 0 0^inf) (0^inf 1^15 0 1^2 0 1^17425) A> (1^0 0 0^inf) (0^inf 1^14 0 1^1 0 1^26143) A> (1^0 0 0^inf) (0^inf 1^16 0 1^2 0 1^39217) A> (1^0 0 0^inf) (0^inf 1^15 0 1^1 0 1^58831) A> (1^0 0 0^inf) (0^inf 1^17 0 1^2 0 1^88249) A> (1^0 0 0^inf) (0^inf 1^16 0 1^1 0 1^132379) A> (1^0 0 0^inf) (0^inf 1^18 0 1^2 0 1^198571) A> (1^0 0 0^inf) (0^inf 1^17 0 1^1 0 1^297862) A> (1^0 0 0^inf) (0^inf 1^19 0 1^1 0 1^446797) A> (1^0 0 0^inf) (0^inf 1^21 0 1^2 0 1^670198) A> (1^0 0 0^inf) ```

`1RB1RA_1LC0RC_---0LD_0LE0LF_1RE0RA_0LF1LB` encoding: `0^inf 1^a 0 1^b A> 0 1^c 0 1^d ...` -> (a,b,c,d,...) rules: (a,4b,0,d,e,f,...) -> (3,a+4b+d,e,f,...) (a,4b+1,0,d,e,f,...) -> (3,a+3b-3,0,0,b+d+1,e,f,...) (a,4b+2,0,d,e,f,...) -> (3,a+3b-5,0,2,0,b+d+1,e,f,...) (a,4b+3,0,d,e,f,...) -> (a+3b+5,b+d,e,f,...) (a,b,c,d,e,f,...) -> (a+3,b+c-2,d,e,f,...) (a,b,1,d,e,f,...) -> halt

oh, how could i forget

start = (0,0,0,0,0,0,...)

(yes these rules are applied starting from the first TM step, which is cool)

ran it for 100 million iterations, it still doesn't halt and it looks like the ratio t/n (where after t iterations it reaches (3,n,0,0,0,...)) converges to something around 1.025