1RB0RC 0LC0LB 0LD1LC 0LE1LA 0LF--- 1RF1RA: Difference between revisions
Jump to navigation
Jump to search
(Oops, looks like it was actually proven halting!) |
(Remove Cryptid category since proven halting) |
||
Line 17: | Line 17: | ||
(3,1) -> (3,6) -> (16,4) -> (47,1) -> (3,50) -> (16,48) -> (47,45) -> (115,43) -> ... -> (119114448,1) -> (3,119114451) | (3,1) -> (3,6) -> (16,4) -> (47,1) -> (3,50) -> (16,48) -> (47,45) -> (115,43) -> ... -> (119114448,1) -> (3,119114451) | ||
</pre> | </pre> | ||
Revision as of 13:45, 11 April 2025
1RB0RC_0LC0LB_0LD1LC_0LE1LA_0LF---_1RF1RA
(bbch) is a halting BB(6) Turing machine found by Racheline on 30 July 2024 (Discord link). It is similar to 1RB1LE_0LC0LB_1RD1LC_1RD1RA_1RF0LA_---1RE
(bbch) in the sense that it follow a tetrational Collatz-like rules that allow for either becoming a translated cycler or to halt. However, it does not run long enough to be a Cryptid. Racheline was able to simulate it long enough to prove that it halts in about steps.
1RB0RC_0LC0LB_0LD1LC_0LE1LA_0LF---_1RF1RA A(n,m) = 0^inf <F 0^n 1^m 0^inf A(4n,m) -> A(9n+11,m-3) A(4n+1,m) -> A(9n+15,m-3) A(4n+2,m) -> A(9n+12,m-2) A(4n+3,m) -> A(9n+16,m-2) A(n,0) -> translated cycler A(n,1) -> A(3,n+3) A(n,2) -> halt start from A(3,1) (3,1) -> (3,6) -> (16,4) -> (47,1) -> (3,50) -> (16,48) -> (47,45) -> (115,43) -> ... -> (119114448,1) -> (3,119114451)