BB(2,5): Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
(Update holdouts and formatting)
(not true anymore, the bb(6) champion has counter behaviour too)
Line 4: Line 4:


<math display="block">S(2,5) > \Sigma(2,5) > 10^{10^{10^{3\,314\,360}}} > 10 \uparrow\uparrow 4</math>
<math display="block">S(2,5) > \Sigma(2,5) > 10^{10^{10^{3\,314\,360}}} > 10 \uparrow\uparrow 4</math>
If it turns out to be the actual champion, it would the only known champion machine that exhibits [[Counter]] behavior.


== Cryptids ==
== Cryptids ==

Revision as of 01:44, 9 July 2025

The 2-state, 5-symbol Busy Beaver problem, BB(2,5), is unsolved. With the discovery of the Cryptid machine Hydra in April 2024, we now know that we must solve a Collatz-like problem in order to solve BB(2,5) and thus BB(2,5) is Hard.

The current BB(2,5) champion 1RB3LA4RB0RB2LA_1LB2LA3LA1RA1RZ (bbch) was discovered by Daniel Yuan in June 2024, proving the lower bounds:

Cryptids

Known Cryptids:

Potential Cryptids:

Certified progress

In April 2024, Shawn Ligocki publicly released a list of 23,411 undecided BB(2,5) machines. Justin Blanchard then made substantial progress over the course of the next month, reducing the list to 499 holdouts by late May 2024. In June 2024, @mxdys cut down the list to 273 using halting and inductive deciders, and again to 217 using CTL. In February 2025, @mxdys ran a decider pipeline in Coq that resulted in only 173 holdouts. Since then, additional machines have been proven in Coq using both deciders and individual proofs.

On 29 Mar 2025, @mxdys published a list of 83 holdouts that withstood state-of-the-art Coq deciders. Some of these machines were already decided before.

Holdouts

This section is based on @mxdys's March 2025 holdouts list of 83 TMs.

Cryptids

Unsolved

Solved with moderate rigor

Formally proven