TMBR: October 2026: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
HelpMe (talk | contribs)
67
Tjligocki (talk | contribs)
m →Holdouts: Update BB(2,7) enumeration
Line 23: Line 23:
* [[BB(2,5)]]
* [[BB(2,5)]]
**On October 2, prurq used Aristotle AI to solve another one of the remaining holdouts, reducing the unofficial count to 38 out of initially 60 Rocq-proven.<sup>[https://discord.com/channels/960643023006490684/1259770421046411285/1555690509245087827]</sup>
**On October 2, prurq used Aristotle AI to solve another one of the remaining holdouts, reducing the unofficial count to 38 out of initially 60 Rocq-proven.<sup>[https://discord.com/channels/960643023006490684/1259770421046411285/1555690509245087827]</sup>
*[[BB(2,7)]]
** Terry Ligocki enumerated 10K more subtasks, increasing the number of holdouts to '''3,090,258,485'''. A total of 990K subtasks out of the 1 million subtasks (or '''99%''') have been enumerated.


[[Category:This Month in Beaver Research|2026-10]]
[[Category:This Month in Beaver Research|2026-10]]

Revision as of 05:47, 4 October 2026

Prev: September 2026 This Month in Beaver Research Next: November 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 Month in Beaver Research for October 2026.

BB Adjacent

Register Machine:

  • On 1 October, sheep discovered a 12-state, 2-register machine which halts iff 7 converges to 1 under the Collatz-like 5n+1 map, thus showing that MBB(12, 2) is hard.[1]
  • On the same day, @-d enumerated MBB(8), which left 7,891 holdouts after reduction, or 404 holdouts if an ai-created decider is used.[2]
  • On the same day, @mineralli discovered a family of champions for MBB(n, 1).[3]
  • On 2 October, @mineralli discovered a new champion for MBB(10, 2).[4]
  • On the same day, sheep discovered 2 new tetrational champions for MBB(10).[5][6]
  • On the same day, Shawn Ligocki released an MBB(8) holdout list consisting of 145 holdouts,[7] using another ai-created decider similar to CTL.[8]
  • On 3 October, Shawn Ligocki released another MBB(8) holdout list consisting of 46 holdouts,[9] later reduced to 6[10] (from 7[11]) holdouts.
  • On the same day, Shawn Ligocki discovered a cryptid amongst the 6 remaining holdouts, showing MBB(8) is hard.[12]
  • On the same day, sheep analyzed the rest of the holdouts, discovering 4 equivalences and another cryptid,[13] meaning MBB(8) "probviously" = 3,394.

Misc

  • On 1 October, dyuan shared a subset of BB(6) holdouts, consisting of 24 machines which are expected to be easily analyzable by longitudinal analysis.[14]

Holdouts

  • BB(2,5)
    • On October 2, prurq used Aristotle AI to solve another one of the remaining holdouts, reducing the unofficial count to 38 out of initially 60 Rocq-proven.[15]
  • BB(2,7)
    • Terry Ligocki enumerated 10K more subtasks, increasing the number of holdouts to 3,090,258,485. A total of 990K subtasks out of the 1 million subtasks (or 99%) have been enumerated.