1RB1RA 0LC1LE 1LD1LC 1LA0LB 1LF1RE ---0RA: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
(Improved usage of Ye Olde Wiki Markup)
(oops, iterations run was off by a factor of 10.)
Line 18: Line 18:
Compared to the [[Hydra]] iteration, this one starts at (8, 0) rather than (3, 0), and the roles of odd and even a are exchanged (in terms of which increases b by two, and which decrements b or halts).
Compared to the [[Hydra]] iteration, this one starts at (8, 0) rather than (3, 0), and the roles of odd and even a are exchanged (in terms of which increases b by two, and which decrements b or halts).
Obstacles to proving the long-run behavior are equally serious.
Obstacles to proving the long-run behavior are equally serious.
Like the [[Hydra]] iteration, this one is biased toward increasing the value of b (assuming equal chances of adding +2 or -1). There is no halt in the first ten million iterations, by which point b has reached 498503.
Like the [[Hydra]] iteration, this one is biased toward increasing the value of b (assuming equal chances of adding +2 or -1). There is no halt in the first one million iterations, by which point b has reached 498503.

Revision as of 20:10, 28 June 2024

This machine was the first identified BB(6) Collatz-like Cryptid, and is closely related to Hydra.

It simulates the Collatz-like iteration


starting from A(8, 0),
using configurations of the form A(a+4, b) = ^ 1^b 0 1^a E> $

It was discovered by mxdys on 28 Jun 2024 and shared on Discord [1].

Compared to the Hydra iteration, this one starts at (8, 0) rather than (3, 0), and the roles of odd and even a are exchanged (in terms of which increases b by two, and which decrements b or halts). Obstacles to proving the long-run behavior are equally serious. Like the Hydra iteration, this one is biased toward increasing the value of b (assuming equal chances of adding +2 or -1). There is no halt in the first one million iterations, by which point b has reached 498503.