TMBR: September 2026: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
No edit summary
HelpMe (talk | contribs)
uh stuff like blog posts. hopefully
Line 2: Line 2:


''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 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 ==
* September 1, 2026. Nick Drozd. [https://nickdrozd.github.io/2026/09/01/tetrational-self-cleaning-turing-machine.html A Tetrational Self-Cleaning Turing Machine].
== Champions ==
* On September 1, nickdrozd discovered a new [[BLB|BLB(3,3)]] champion which runs for over 10↑↑6.54 steps before blanking the tape.<sup>[https://discord.com/channels/960643023006490684/1259770474897080380/1544448259437895680]</sup> Note that this is not a new [[BBB|BBB(3,3)]] champion.
* On September 9, @-d discovered a new [[BBf|BBf(24)]] champion which runs for over 9.000 × 10<sup>14,448</sup> steps.<sup>[https://discord.com/channels/960643023006490684/1438019511155691521/1547182811713380383]</sup>


== BB Adjacent ==
== BB Adjacent ==


* [[Cyclic Tag]]
* [[Cyclic Tag]]
** On September 1, Azerty enumerated all BBCT programs up to size 14, proving the values of BBCT(n) for n ≤ 7.<sup>[https://discord.com/channels/960643023006490684/1542262029430292501/1544315541383155784]</sup>
** On September 1, Azerty enumerated all BBCT programs up to size 14, proving the values of BBCT(n) for n < 7.<sup>[https://discord.com/channels/960643023006490684/1542262029430292501/1544315541383155784]</sup>
** On September 2, sheep discovered new champions for BBCT(11),<sup>[https://discord.com/channels/960643023006490684/1542262029430292501/1544351459846529134]</sup> BBCT(13),<sup>[https://discord.com/channels/960643023006490684/1542262029430292501/1544368872973664337]</sup> and BBCT(14).<sup>[https://discord.com/channels/960643023006490684/1542262029430292501/1544633416064962611]</sup>
** On September 2, sheep discovered new champions for BBCT(11),<sup>[https://discord.com/channels/960643023006490684/1542262029430292501/1544351459846529134]</sup> BBCT(13),<sup>[https://discord.com/channels/960643023006490684/1542262029430292501/1544368872973664337]</sup> and BBCT(14).<sup>[https://discord.com/channels/960643023006490684/1542262029430292501/1544633416064962611]</sup>
 
** On September 5, Azerty proved the value of BBCT(7).<sup>[https://discord.com/channels/960643023006490684/1542262029430292501/1545914357777571951]</sup>
TODO: Cellular Automata Busy Beaver (version 2)
* [[General Recursive Function]]
* [[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.<sup>[https://discord.com/channels/960643023006490684/1447627603698647303/1545730338725171250]</sup> This allowed her to confirm that, if the holdout returned a value, it would be larger than 3.124 × 10<sup>16</sup>.<sup>[https://discord.com/channels/960643023006490684/1260977480316092527/1546531543290224701]</sup>
** 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.<sup>[https://discord.com/channels/960643023006490684/1447627603698647303/1545730338725171250]</sup> This allowed her to confirm that, if the holdout returned a value, it would be larger than 3.124 × 10<sup>16</sup>.<sup>[https://discord.com/channels/960643023006490684/1260977480316092527/1546531543290224701]</sup>
** On September 7, the aforementioned method was ported to Rust by @ZTS439, allowing them to extend the bound to 4.999 × 10<sup>17</sup>.<sup>[https://discord.com/channels/960643023006490684/1447627603698647303/1546666535911821413]</sup>
** On September 7, the aforementioned method was ported to Rust by @ZTS439, allowing them to extend the bound to 4.999 × 10<sup>17</sup>.<sup>[https://discord.com/channels/960643023006490684/1447627603698647303/1546666535911821413]</sup>


TODO: PLUSMINUS
TODO: PLUSMINUS<sup>[https://discord.com/channels/960643023006490684/1243312334907375676/1546687220390567948]</sup>


* [[Fractran]]
* [[Fractran]]
** On September 9, @-d discovered a new BBf(24) champion which runs for over 9.000 × 10<sup>14,448</sup> steps.<sup>[https://discord.com/channels/960643023006490684/1438019511155691521/1547182811713380383]</sup>
** On September 13, @-d completed enumeration of BBf(24), leaving an initial 6,733,785 holdouts, which were reduced to 231,432 holdouts, or 10,838 holdouts if ai-created deciders are used.<sup>[https://discord.com/channels/960643023006490684/1438019511155691521/1548561426262790144]</sup>
** On September 13, @-d completed enumeration of BBf(24), leaving an initial 6,733,785 holdouts, which were reduced to 231,432 holdouts, or 10,838 holdouts if ai-created deciders are used.<sup>[https://discord.com/channels/960643023006490684/1438019511155691521/1548561426262790144]</sup>


Line 23: Line 32:
* [[Register machine|Register Machine]]
* [[Register machine|Register Machine]]
** On September 18, @mineralli discovered a new MBB(9) champion.<sup>[https://discord.com/channels/960643023006490684/1243312334907375676/1550599643031670875]</sup> sheep then discovered four new champions for MBB(9) in the four following days<sub>.</sub><sup>[https://discord.com/channels/960643023006490684/1243312334907375676/1551985291198210071]</sup>
** On September 18, @mineralli discovered a new MBB(9) champion.<sup>[https://discord.com/channels/960643023006490684/1243312334907375676/1550599643031670875]</sup> sheep then discovered four new champions for MBB(9) in the four following days<sub>.</sub><sup>[https://discord.com/channels/960643023006490684/1243312334907375676/1551985291198210071]</sup>
** On September 25, sheep discovered an MBB(10) champion,<sup>[https://discord.com/channels/960643023006490684/1552294888740098139/1552360261900435537]</sup> which was shown to halt in around 10<sup>2,629,437</sup> steps by Shawn Ligocki.<sup>[https://discord.com/channels/960643023006490684/1552294888740098139/1552690832006447186]</sup> This champion prompted a rework of Ligocki's hydra-like rule accelerator.<sup>[https://discord.com/channels/960643023006490684/1552294888740098139/1553109975528902729]</sup>


== Holdouts ==
== Holdouts ==
Line 39: Line 49:
**On September 24, Discord user q64 simulated a TM to halt<sup>[https://discord.com/channels/960643023006490684/1239205785913790465/1552399839269224498]</sup>
**On September 24, Discord user q64 simulated a TM to halt<sup>[https://discord.com/channels/960643023006490684/1239205785913790465/1552399839269224498]</sup>
**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.
**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,5)]]
**On September 8, mxdys released a new holdouts list of '''60''' machines.<sup>[https://discord.com/channels/960643023006490684/1259770421046411285/1546880921318326282]</sup>
**On September 24, prurq used Aristotle AI and GPT6 to solve 20 of the 60 remaining holdouts.<sup>[https://discord.com/channels/960643023006490684/1259770421046411285/1552990521650319453]</sup>
* [[BB(2,7)]]
* [[BB(2,7)]]
** Terry Ligocki enumerated 28K more subtasks, increasing the number of holdouts to '''2,964,345,750'''. A total of 950K subtasks out of the 1 million subtasks (or '''95%''') have been enumerated.
** Terry Ligocki enumerated 28K more subtasks, increasing the number of holdouts to '''2,964,345,750'''. A total of 950K subtasks out of the 1 million subtasks (or '''95%''') 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]</sup>
* On September 2, RobinCodes began work on updating the BB(6) holdout [https://docs.google.com/spreadsheets/d/1mMp8bAcTFT91j7azn72liX8NSTwc2E_ozKnOGTfRCfw/edit?pli=1&gid=1330361301#gid=1330361301 spreadsheet].<sup>[https://discord.com/channels/960643023006490684/1239205785913790465/1544742905850236978]</sup>
* On September 23, Joseph M. Shunia published a preprint presenting a 120-state TM that halts iff Ri<sup>[[Category:This Month in Beaver Research|2026-09]]</sup>emann hypothesis is false.[https://arxiv.org/abs/2609.30306]
* On September 5, [[User:XnoobSpeakable|XnoobSpeakable]] began an opt-in archival project of the bbchallenge Discord server.<sup>[https://discord.com/channels/960643023006490684/960643023530762341/1545742987710038088]</sup>
* Twitter user @_Mira___Mira_ claimed to have found TKTK-state TM  <TKTK update when final TM is pub<sup>[[Category:This Month in Beaver Research|2026-09]]</sup>lished> whose halting status is [[Independence from ZFC|independent of ZFC]] with GPT-6 Astra.
* On September 23, Joseph M. Shunia published a preprint presenting a 120-state TM that halts iff Riemann hypothesis is false.<sup>[https://arxiv.org/abs/2609.30306]</sup>
* Twitter user @_Mira___Mira_ claimed to have found a TKTK-state TM  <TKTK update when final TM is published> whose halting status is [[Independence from ZFC|independent of ZFC]] with GPT-6 Astra.

Revision as of 03:07, 29 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).

Blog Posts

Champions

  • On September 1, nickdrozd discovered a new BLB(3,3) champion which runs for over 10↑↑6.54 steps before blanking the tape.[1] Note that this is not a new BBB(3,3) champion.
  • On September 9, @-d discovered a new BBf(24) champion which runs for over 9.000 × 1014,448 steps.[2]

BB Adjacent

  • Cyclic Tag
    • On September 1, Azerty enumerated all BBCT programs up to size 14, proving the values of BBCT(n) for n < 7.[3]
    • On September 2, sheep discovered new champions for BBCT(11),[4] BBCT(13),[5] and BBCT(14).[6]
    • On September 5, Azerty proved the value of BBCT(7).[7]

TODO: Cellular Automata Busy Beaver (version 2)

  • 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.[8] This allowed her to confirm that, if the holdout returned a value, it would be larger than 3.124 × 1016.[9]
    • On September 7, the aforementioned method was ported to Rust by @ZTS439, allowing them to extend the bound to 4.999 × 1017.[10]

TODO: PLUSMINUS[11]

  • Fractran
    • On September 13, @-d completed enumeration of BBf(24), leaving an initial 6,733,785 holdouts, which were reduced to 231,432 holdouts, or 10,838 holdouts if ai-created deciders are used.[12]

TODO: Post Tag System (alternate definition)

  • Register Machine
    • On September 18, @mineralli discovered a new MBB(9) champion.[13] sheep then discovered four new champions for MBB(9) in the four following days.[14]
    • On September 25, sheep discovered an MBB(10) champion,[15] which was shown to halt in around 102,629,437 steps by Shawn Ligocki.[16] This champion prompted a rework of Ligocki's hydra-like rule accelerator.[17]

Holdouts

  • BB(6)
    • By September 4, mxdys solved all 16 Counter Class 1 TMs.[18]
    • On September 4, Discord user fifi_49513 claimed to have proven a TM non-halting. [19] This machine was later confirmed non-halting in Rocq on September 5 by mxdys. [20]
    • On September 8, mxdys released a new holdouts list of 964 machines up to equivalence.[21]
    • 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). [22]
    • On September 16, mxdys released another holdouts list of 855 machines up to equivalence.[23]
    • On September 24, mxdys released another holdouts list of 815 machines up to equivalence.[24] 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
    • On September 24, Discord user q64 simulated a TM to halt[25]
    • 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,5)
    • On September 8, mxdys released a new holdouts list of 60 machines.[26]
    • On September 24, prurq used Aristotle AI and GPT6 to solve 20 of the 60 remaining holdouts.[27]
  • BB(2,7)
    • Terry Ligocki enumerated 28K more subtasks, increasing the number of holdouts to 2,964,345,750. A total of 950K subtasks out of the 1 million subtasks (or 95%) have been enumerated.

Misc

  • On September 2, RobinCodes began work on updating the BB(6) holdout spreadsheet.[28]
  • On September 5, XnoobSpeakable began an opt-in archival project of the bbchallenge Discord server.[29]
  • On September 23, Joseph M. Shunia published a preprint presenting a 120-state TM that halts iff Riemann hypothesis is false.[30]
  • Twitter user @_Mira___Mira_ claimed to have found a TKTK-state TM <TKTK update when final TM is published> whose halting status is independent of ZFC with GPT-6 Astra.