1RB0LD 1RC1RA 1LD0RB 1LE1LA 1RF0RC ---1RE: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
(Added Category:Cryptids)
(add more info about (0,0,c) and (0,1,c))
Line 35: Line 35:


Andrew Ducharme forward simulated the map with this acceleration 10^7 steps and found the TM had not yet halted.
Andrew Ducharme forward simulated the map with this acceleration 10^7 steps and found the TM had not yet halted.
This TM is probviously halting because <code>(0,0,c)</code> and <code>(0,1,c)</code> should occur equally often. On the first 3 attempts, the TM has landed on <code>(0,1,c)</code>:
# <code>(0,1,8) --> (25,0,0)</code>
# <code>(0,1,113544) --> (227097,0,0)</code>
# <code>(0,1,28155...08204) --> (56311...16417,0,0)</code>, where 28155...08204 and 56311...16417 are 39991-digit numbers.
However, forward simulation will not work for the 4th attempt, because c grows too large.
[[Category:Cryptids]]
[[Category:Cryptids]]

Revision as of 09:48, 6 August 2025

Unsolved problem:
Does this TM halt? If so, how many steps does it take to halt?

1RB0LD_1RC1RA_1LD0RB_1LE1LA_1RF0RC_---1RE (bbch) is a probviously halting BB(6) Cryptid analzyed by mxdys on 30 July 2025.

Analysis by mxdys

[1]

1RB0LD_1RC1RA_1LD0RB_1LE1LA_1RF0RC_---1RE

(a,b,c) := 0^inf 1^a 0 01^b 0 11^c+1 B> 0^inf

(a,2+b,c) --> (a,b,3+c)
(a+1,0,c) --> (a,c,2)
(a+1,1,c) --> (a,c,6)
(0,0,c) --> halt
(0,1,c) --> (2c+9,0,0)
start: (3,0,0)

Confirmation that it doesn't halt early:

(3,0,0) --> ...
(25,0,0) --> ...
(227097,0,0) --> ...
(_,0,0) --> ...

These rules have been proven in Coq and Lean.

The first rule can be accelerated as

(a,2b,c) --> (a,0,c+3b)
(a,2b+1,c) --> (a,1,3(b-1)/2)

Andrew Ducharme forward simulated the map with this acceleration 10^7 steps and found the TM had not yet halted.

This TM is probviously halting because (0,0,c) and (0,1,c) should occur equally often. On the first 3 attempts, the TM has landed on (0,1,c):

  1. (0,1,8) --> (25,0,0)
  2. (0,1,113544) --> (227097,0,0)
  3. (0,1,28155...08204) --> (56311...16417,0,0), where 28155...08204 and 56311...16417 are 39991-digit numbers.

However, forward simulation will not work for the 4th attempt, because c grows too large.