TMBR: November 2025

From BusyBeaverWiki
Revision as of 17:13, 26 November 2025 by RobinCodes (talk | contribs) (BB Adjacent: Added Fractran and Cyclic Tag paragraphs.)
Jump to navigation Jump to search
Prev: October 2025 This Month in Beaver Research Next: December 2025

This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).

In the News

Themed Months

  • TODO. Write a summary of what happened during BB(3,3) month (October) and BB(2,5) month (November).

Misc

  • Discord user Vonhust made a Macro Machine achieving 2 billion steps / s, and is planning even more optimalizations. TODO: Sources, details, graph.

BB Adjacent

  • All Fractran deciders
    All Fractran deciders summarized and their relations, shared by Daniel Yuan on 14 Nov 2025
    Busy Beaver for Fractan, or BBf was introduced on 1 Nov by Jason Yuen, who also solved the first 14 values. Then, all values up to 19 were solved, with 19 requiring 3 programs to be proven by hand. For n = 20, 34 holdouts remain, while for n = 21, 587 holdouts are remaining. Three BB-Cryptids were also transformed into Fractran programs, so we know that n = 29 requires solving Hydra.
  • Cyclic Tag was introduced by Discord user Jack on 14 Nov. The first two values, n = 1 and 2 were also solved by him. Then, lower bounds were given for values up to n = 7. CTBB(7) reaches hexation.
  • TODO. Add BMS milestone improved by tromp from 350 to 331. (source: https://discord.com/channels/960643023006490684/1355653587824283678/1436844104742076507)

Holdouts

  • BB(6):
  • BB(2,7):
    • The code provided by mxdys breaks up the BB(2,7) enumeration into 1 million subtasks which each run for ~10 minutes and leave ~2500 holdouts based on an average of the first 1K subtasks. These values are about 5 times longer than and 25 times larger than the ones for BB(7).
    • Terry Ligocki enumerated the first 2 subtasks, resulting in 62,062,284 holdouts, which can be found here.
    • The expected number of holdouts after the enumeration is ~2'500'000'000.