TMBR: September 2025: Difference between revisions

Revision as of 17:50, 15 September 2025

Prev: August 2025	This Month in Beaver Research	Next: October 2025

This article is a stub. You can help the BusyBeaverWiki by expanding it.

BB(6):
- Andrew Ducharme and @mxdys both found a family of 10 halting TMs independently, all halting in around $10^{69}$ steps.
- @mxdys decided two machines’ fates from the 50 Random Holdouts released in August, making 8/50 machined solved as of this month.
- Andrew Ducharme found a non-halting TM, to which Peacemaker II replied with another machine that turned out to be very similar, and non-halting as well. Later in his search Andrew found another non-halting TM.
BB(7): Andrew Ducharme has continued reducing the number of holdouts, from 59,727,905 to 28,543,434 (52.22% reduction)
BB(2,6): First, Andrew Ducharme has continued reducing the number of holdouts from 18,054,938 to 17,629,828 (2.35% reduction). Then Terry Ligocki shared that he ran 14 of @mxdys deciders on the holdouts list, reducing the holdout count to a flattering 1,300,334 TMs (92.63% reduction). TODO: Error in the original holdouts list, new holdout count when tjligocki reran mxdys deciders but then that contained an error so then tjligocki reran the deciders for the 3rd time on a verified holdouts list consisting of around 20mil TMs.

John Tromp announced on Discord that a 350-bit $BB\lambda (n)$ function now reaches the limit of BMS, an improvement from the previous 404 bits.

@@ Line 6: / Line 6: @@
 ==In the News==
-* 14 Sep 2025. Wired. [https://www.wired.com/story/the-quest-to-find-the-longest-running-simple-computer-program/ The Quest to Find the Longest-Running Simple Computer Program].
+* 14 Sep 2025. Ben Brubaker. Wired. [https://www.wired.com/story/the-quest-to-find-the-longest-running-simple-computer-program/ The Quest to Find the Longest-Running Simple Computer Program].
 ==Holdouts==