TMBR: September 2026: Difference between revisions
Jump to navigation
Jump to search
more boasting! |
Qwertyasdf (talk | contribs) No edit summary |
||
| Line 31: | Line 31: | ||
** On September 14, an independent computation by Seiji extended the [[Space Needle]] trajectory to '''100,000,000''' terms: no power of 2 was ever encountered, and the most factors of 2 any term had was '''25''' (first occurring at n = 23,145,881; the previously documented state was >17,000,000 terms with max 24). The full final value (94,125,050 bits) is published with SHA-256 anchors, together with 400 checkpoints cross-verified by two independent implementations, and exact macro step-count laws of the machine (L0–L4; L1 and L3 formally proven). <sup>[https://github.com/oohzaim1-afk/space-needle-100M]</sup> | ** On September 14, an independent computation by Seiji extended the [[Space Needle]] trajectory to '''100,000,000''' terms: no power of 2 was ever encountered, and the most factors of 2 any term had was '''25''' (first occurring at n = 23,145,881; the previously documented state was >17,000,000 terms with max 24). The full final value (94,125,050 bits) is published with SHA-256 anchors, together with 400 checkpoints cross-verified by two independent implementations, and exact macro step-count laws of the machine (L0–L4; L1 and L3 formally proven). <sup>[https://github.com/oohzaim1-afk/space-needle-100M]</sup> | ||
** On September 16, mxdys released another holdouts list of '''855''' machines up to equivalence.<sup>[https://discord.com/channels/960643023006490684/1239205785913790465/1549771931677364264]</sup> | ** On September 16, mxdys released another holdouts list of '''855''' machines up to equivalence.<sup>[https://discord.com/channels/960643023006490684/1239205785913790465/1549771931677364264]</sup> | ||
** On September 24, mxdys released another holdouts list of '''815''' machines up to equivalence.[https://discord.com/channels/960643023006490684/1239205785913790465/1552681541401059350] The newly solved holdouts include: | |||
*** [[BMO|BMO9]] | |||
*** Two shift-overflow bell counters | |||
*** 31 shift-overflow mixed-digits counters with similar behavior | |||
*** two new translated cyclers (also shift-overflow mixed-digits counters) with high period | |||
*** two other shift-overflow counters | |||
**The halting status of {{TM|1RB1LA_1RC1RE_1LD0RB_1LA0LC_0RF0RD_0RB---}} was formalized without new axioms by avoiding the use of Baker–Wüstholz theorem. | |||
* [[BB(2,7)]] | * [[BB(2,7)]] | ||
** Terry Ligocki enumerated 25K more subtasks, increasing the number of holdouts to '''2,873,381,794'''. A total of 920K subtasks out of the 1 million subtasks (or '''92%''') have been enumerated. | ** Terry Ligocki enumerated 25K more subtasks, increasing the number of holdouts to '''2,873,381,794'''. A total of 920K subtasks out of the 1 million subtasks (or '''92%''') have been enumerated. | ||
== Misc == | == Misc == | ||
* On September 5, [[User:XnoobSpeakable|XnoobSpeakable]] began an opt-in archival project of the bbchallenge Discord server<sup>[[Category:This Month in Beaver Research|2026-09]] .<sup> <sup>[https://discord.com/channels/960643023006490684/960643023530762341/1545742987710038088] | * On September 5, [[User:XnoobSpeakable|XnoobSpeakable]] began an opt-in archival project of the bbchallenge Discord server<sup>[[Category:This Month in Beaver Research|2026-09]] .<sup> <sup>[https://discord.com/channels/960643023006490684/960643023530762341/1545742987710038088] | ||
Revision as of 02:41, 27 September 2026
| Prev: August 2026 | This Month in Beaver Research | Next: October 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).
BB Adjacent
- General Recursive Function
- On September 5, after Shawn Ligocki renewed interest in a certain chaotic BBµ(16) holdout last month, sheep devised a method to accelerate the simulation of the holdout.[5] This allowed her to confirm that, if the holdout returned a value, it would be larger than .[6]
- On September 7, the aforementioned method was ported to Rust by @ZTS439, allowing them to extend the bound to .[7]
TODO: PLUSMINUS
TODO: Post Tag System (alternate definition)
Holdouts
- BB(6)
- By September 4, mxdys solved all 16 Counter Class 1 TMs.[12]
- On September 4, Discord user fifi_49513 claimed to have proven a TM non-halting. [13] This machine was later confirmed non-halting in Rocq on September 5 by mxdys. [14]
- On September 8, mxdys released a new holdouts list of 964 machines up to equivalence.[15]
- On September 14, an independent computation by Seiji extended the Space Needle trajectory to 100,000,000 terms: no power of 2 was ever encountered, and the most factors of 2 any term had was 25 (first occurring at n = 23,145,881; the previously documented state was >17,000,000 terms with max 24). The full final value (94,125,050 bits) is published with SHA-256 anchors, together with 400 checkpoints cross-verified by two independent implementations, and exact macro step-count laws of the machine (L0–L4; L1 and L3 formally proven). [16]
- On September 16, mxdys released another holdouts list of 855 machines up to equivalence.[17]
- On September 24, mxdys released another holdouts list of 815 machines up to equivalence.[18] The newly solved holdouts include:
- BMO9
- Two shift-overflow bell counters
- 31 shift-overflow mixed-digits counters with similar behavior
- two new translated cyclers (also shift-overflow mixed-digits counters) with high period
- two other shift-overflow counters
- The halting status of
1RB1LA_1RC1RE_1LD0RB_1LA0LC_0RF0RD_0RB---(bbch) was formalized without new axioms by avoiding the use of Baker–Wüstholz theorem.
- BB(2,7)
- Terry Ligocki enumerated 25K more subtasks, increasing the number of holdouts to 2,873,381,794. A total of 920K subtasks out of the 1 million subtasks (or 92%) have been enumerated.
Misc
- On September 5, XnoobSpeakable began an opt-in archival project of the bbchallenge Discord server . [19]