TMBR: January 2026: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Holdouts: add peacemaker result
Holdouts: add solved 2,5 machine
Line 34: Line 34:
**The holdout count was further reduced to '''19,879,953''' (a 1.57% reduction), which breaks the 20 million barrier.<sup>[https://discord.com/channels/960643023006490684/1369339127652159509/1460718041577951365]</sup>
**The holdout count was further reduced to '''19,879,953''' (a 1.57% reduction), which breaks the 20 million barrier.<sup>[https://discord.com/channels/960643023006490684/1369339127652159509/1460718041577951365]</sup>
**Another reduction brought the holdout count down to '''19,781,295''', a 0.5% reduction, then '''19,303,801''', a 2.41% reduction.
**Another reduction brought the holdout count down to '''19,781,295''', a 0.5% reduction, then '''19,303,801''', a 2.41% reduction.
**
*[[BB(2,5)]]:
**Andrew Ducharme [https://discord.com/channels/960643023006490684/1259770421046411285/1466208979511414885 found] a machine to be nonhalting via @mxdys's FAR decider.
*[[BB(2,6)]]:
*[[BB(2,6)]]:
**Andrew Ducharme reduced the number of holdouts from 870,085 to '''869,001''', a 0.12% reduction.
**Andrew Ducharme reduced the number of holdouts from 870,085 to '''869,001''', a 0.12% reduction.

Revision as of 11:33, 30 January 2026

Prev: December 2025 This Month in Beaver Research Next: February 2026

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).

This is the first edition of TMBR in 2026.

Champions

  • nickdrozd discovered a new BLB(3,3) champion (1RB2RB1LA_2LC0LB2LB_2RC2RA0LC (bbch)) which blanks the tape after running for more than 1042,745 steps.
  • creeperman7002 discovered 1TB1PA_1PC0PA_1TA0PD_---1TA, a TT(4,2) TM which runs for 48,186 steps and 1TA2PB3TB---_3TA1PB1TA1PA, a TT(2,4) TM which runs for more than 3.467*1015 steps.
  • A new lower bound of fε0ωω3(4) was computed for the BBλ(91) champion.

Blog Posts

BB Adjacent

Theory

@ConePine shared an idea on how the value of BB(5) can be proved without enumerating Turing machines.

Holdouts

  • BB(6): 2 [Needs update] solved machines.
  • BB(7):
    • Andrew Ducharme further continued reducing the number of holdouts, from 20,387,509 to 20,197,978 TMs, a 0.93% reduction. This puts the total compute time on the current BB(7) pipeline just over 50,000 hours.[1]
    • The holdout count was further reduced to 19,879,953 (a 1.57% reduction), which breaks the 20 million barrier.[2]
    • Another reduction brought the holdout count down to 19,781,295, a 0.5% reduction, then 19,303,801, a 2.41% reduction.
  • BB(2,5):
    • Andrew Ducharme found a machine to be nonhalting via @mxdys's FAR decider.
  • BB(2,6):
    • Andrew Ducharme reduced the number of holdouts from 870,085 to 869,001, a 0.12% reduction.
    • Another reduction brought the holdout count down to 567,971.[3]