TMBR: September 2025: Difference between revisions

Revision as of 01:34, 13 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 $1 0^{69}$ steps.
- @mxdys decided two machines’ fates from the 50 Random Holdouts released in August, making 8/50 machined solved as of this month.
BB(7): Andrew Ducharme has continued reducing the number of holdouts, from 59,727,905 to 29,781,771 (50.14% 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).

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

@@ Line 18: / Line 18: @@
 * TODO: savask shared "Busy Bug Game": https://discord.com/channels/960643023006490684/1362008236118511758/1415723582989930679
+== Blog Posts ==
+* 12 Sep 2025.  Katelyn Doucette. [https://katelyndoucette.com/articles/bugs-mazes-and-bradys-algorithm Bugs, Mazes, and the Unreasonably Effective Brady's Algorithm].
 [[Category:This Month in Beaver Research|2025-09]]