TMBR: June 2026: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Polygon (talk | contribs)
Added Fractran progress
HelpMe (talk | contribs)
m i did not find a new champion for BBCS(25). to fix this error i found a new champion for BBCS(25). also it's q(x + 1) not q(x) + 1
Line 13: Line 13:
* New [[SKI Calculus#BCKW system|BCKW system]] champions were discovered for Ξ₀_BCKW(7), Ξ₀_BCKW(8) and Ξ₀_BCKW(9).
* New [[SKI Calculus#BCKW system|BCKW system]] champions were discovered for Ξ₀_BCKW(7), Ξ₀_BCKW(8) and Ξ₀_BCKW(9).
[[CounterScript]]:
[[CounterScript]]:
* On 12 June, sheep constructed a size 84 champion with score <math>2^{q(5)}</math><sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1514987825127358615]</sup>, where q is a fast growing function arising from [https://en.wikipedia.org/wiki/Laver_table Laver tables]. A day later, sheep showed that BBCS(89 + k) <math>\geq 2^{P^{k}(0)}</math> where P(x) = q(x) + 1.<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1515330464683004044]</sup>
* On 12 June, sheep constructed a size 84 champion with score <math>2^{q(5)}</math><sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1514987825127358615]</sup>, where q is a fast growing function arising from [https://en.wikipedia.org/wiki/Laver_table Laver tables]. A day later, sheep showed that BBCS(89 + k) <math>\geq 2^{P^{k}(0)}</math> where P(x) = q(x + 1).<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1515330464683004044]</sup>
* On 8 June, sheep discovered a new BBCS(25) champion.<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1513475785971732570]</sup>
* On 15 June, [[User:Sligocki|Shawn Ligocki]] discovered new champions for BBCS(13)<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1515955533641809950]</sup> and BBCS(14).<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1515954591445815459]</sup>
* On 15 June, [[User:Sligocki|Shawn Ligocki]] discovered new champions for BBCS(13)<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1515955533641809950]</sup> and BBCS(14).<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1515954591445815459]</sup>
* On the same day, Azerty completed the enumeration of BBCS(12), leaving an initial 866 holdouts.<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1516066605912821791]</sup> A second enumeration the next day left only 477 holdouts.<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1516366973523591249]</sup>
* On the same day, Azerty completed the enumeration of BBCS(12), leaving an initial 866 holdouts.<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1516066605912821791]</sup> A second enumeration the next day left only 477 holdouts.<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1516366973523591249]</sup>
* On June 20, sheep discovered two new champions ([https://discord.com/channels/960643023006490684/1484108791636033659/1517854233020338216 first], [https://discord.com/channels/960643023006490684/1484108791636033659/1517857681086611457 second]) for BBCS(19) in quick succession.
* On June 20, sheep discovered two new champions ([https://discord.com/channels/960643023006490684/1484108791636033659/1517854233020338216 first], [https://discord.com/channels/960643023006490684/1484108791636033659/1517857681086611457 second]) for BBCS(19) in quick succession, as well as new champions for BBCS(24) and BBCS(25).<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1517888154722504985]</sup>
[[Fractran]]:
[[Fractran]]:
* On 1 June, [[User:Sligocki|Shawn Ligocki]] discovered a new BBf(23) champion which runs for over <math>4.393 \times 10^{124}</math> steps.<sup>[https://discord.com/channels/960643023006490684/1438019511155691521/1510769318978129970]</sup>
* On 1 June, [[User:Sligocki|Shawn Ligocki]] discovered a new BBf(23) champion which runs for over <math>4.393 \times 10^{124}</math> steps.<sup>[https://discord.com/channels/960643023006490684/1438019511155691521/1510769318978129970]</sup>

Revision as of 16:28, 20 June 2026

Prev: May 2026 This Month in Beaver Research Next: July 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

Busy Beaver for Lambda Calculus:

  • BBλ(39) was solved on 10 June, showing that BBλ(39) =5⋅3333+6.
  • Work began on BBλ(40), which was reduced to 2 holdouts[1] and BBλ(41), which was reduced to [TODO] holdouts.
  • A list of BBλ(42) holdouts was also added to the BBλ-spreadsheet.[2]

SKI Calculus:

  • New champions were discovered for Ξ₀(10), Ξ₀(13), Ξ₀(14), Ξ₀(15), Ξ₀(16), Ξ₀(17), Ξ₀(18) and Ξ₀(19). Ξ₀(10) was shown to be larger than Graham's number.
  • New SK calculus champions were discovered for Ξ₀_SK(18) and Ξ₀_SK(26), showing Ξ₀_SK(26) to be larger than Graham's number.
  • New BCKW system champions were discovered for Ξ₀_BCKW(7), Ξ₀_BCKW(8) and Ξ₀_BCKW(9).

CounterScript:

  • On 12 June, sheep constructed a size 84 champion with score 2q(5)[3], where q is a fast growing function arising from Laver tables. A day later, sheep showed that BBCS(89 + k) ≥2Pk(0) where P(x) = q(x + 1).[4]
  • On 15 June, Shawn Ligocki discovered new champions for BBCS(13)[5] and BBCS(14).[6]
  • On the same day, Azerty completed the enumeration of BBCS(12), leaving an initial 866 holdouts.[7] A second enumeration the next day left only 477 holdouts.[8]
  • On June 20, sheep discovered two new champions (first, second) for BBCS(19) in quick succession, as well as new champions for BBCS(24) and BBCS(25).[9]

Fractran:

  • On 1 June, Shawn Ligocki discovered a new BBf(23) champion which runs for over 4.393×10124 steps.[10]
  • BBf(23) holdouts were reduced by 27.20% from 29,250 to 21,295.

TODO: Branching Beaver

Misc

  • TODO: GPU deciders

Holdouts

  • BB(6)
  • BB(7)
    • Using new GPU based deciders, David SG reduced the number of remaining holdouts from 17,823,260 to 16,949,557, a 4.90% reduction.[18]
    • Andrew Ducharme further reduced the amount of holdouts by 7.12% to 15,743,264 by running mxdys's FAR decider with various parameters.[19]
  • BB(2,6)
    • Andrew Ducharme reduced the number of holdouts from 413,513 to 412,086, a 0.35% reduction.[20]
  • BB(2,7)
    • Terry Ligocki enumerated 100K more subtasks, increasing the number of holdouts to 1,392,222,673. A total of 450K subtasks out of the 1 million subtasks (or 45%) have been enumerated.