TMBR: October 2025: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
RobinCodes (talk | contribs) (Started "Holdouts" section. Added Andrew Ducharme's results.) |
||
| Line 5: | Line 5: | ||
* ? Oct 2025. Katelyn Doucette. [https://katelyndoucette.com/articles/building-the-busy-beaver-ladder Building the Busy Beaver Ladder]. | * ? Oct 2025. Katelyn Doucette. [https://katelyndoucette.com/articles/building-the-busy-beaver-ladder Building the Busy Beaver Ladder]. | ||
== Holdouts == | |||
* BB(7): | |||
** Andrew Ducharme has continued reducing the [[BB(7)#Phase 2|number of holdouts]] with Stage 4 of Phase 2. Initially, in the beginning of the month there were 22,801,601 holdouts, and 22,721,690 holdouts remain. (0.35% reduction) | |||
== Theory == | == Theory == | ||
Revision as of 19:12, 1 October 2025
| Prev: September 2025 | This Month in Beaver Research | Next: November 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).
Blog Posts
- ? Oct 2025. Katelyn Doucette. Building the Busy Beaver Ladder.
Holdouts
- BB(7):
- Andrew Ducharme has continued reducing the number of holdouts with Stage 4 of Phase 2. Initially, in the beginning of the month there were 22,801,601 holdouts, and 22,721,690 holdouts remain. (0.35% reduction)
Theory
TODO: Update this section after studying existing literature a bit more.
Linear-Inequality Affine Transformation Automata (LIATA) were introduced as a generalization of the BMO1 rules: