TMBR: July 2026: Difference between revisions
Jump to navigation
Jump to search
→BB Adjacent: typo |
→General: Add back in carrino's BBB(4) progress |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 9: | Line 9: | ||
** On July 16, the non-halting proof for Skelet #17 was translated to Lean.<sup>[https://discord.com/channels/960643023006490684/1218877181321678928/1527249976411947078]</sup> | ** On July 16, the non-halting proof for Skelet #17 was translated to Lean.<sup>[https://discord.com/channels/960643023006490684/1218877181321678928/1527249976411947078]</sup> | ||
** On July 25, the non-halting proof for Skelet #1 was translated to Lean, '''thus completing the proof of BB(5) = 47,176,870 in Lean.'''<sup>[https://discord.com/channels/960643023006490684/1218877181321678928/1530515342772666429]</sup> | ** On July 25, the non-halting proof for Skelet #1 was translated to Lean, '''thus completing the proof of BB(5) = 47,176,870 in Lean.'''<sup>[https://discord.com/channels/960643023006490684/1218877181321678928/1530515342772666429]</sup> | ||
* | *@carrino used Claude to begin work on proving the value of [[BBB]](4) and formalizing the result in Rocq. On July 31, they were down to less than 40 holdouts.<sup>[https://discord.com/channels/960643023006490684/1385498968011575366/1532864742983602366]</sup> | ||
== BB Adjacent == | == BB Adjacent == | ||
* [[SKI Calculus]]: | * [[SKI Calculus]]: | ||
** | ** Δ⁵ discovered several new champions for Ξ₀<sub>SK</sub>(12),<sup>[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&diff=next&oldid=7894]</sup>, Ξ₀<sub>SK</sub>(14),<sup>[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&diff=next&oldid=7968]</sup> Ξ₀(12), Ξ₀<sub>SK</sub>(15),<sup>[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&diff=next&oldid=7996]</sup> and Ξ₀<sub>SK</sub>(16).<sup>[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&diff=next&oldid=8083]</sup> | ||
** On July 27, Δ⁵ discovered a new pentational champion for Ξ₀<sub>BCKW</sub>(7) and new hexational champions for Ξ₀<sub>BCKW</sub>(8) and Ξ₀<sub>BCKW</sub>(9).<sup>[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&diff=next&oldid=8050]</sup> | ** On July 27, Δ⁵ discovered a new pentational champion for Ξ₀<sub>BCKW</sub>(7) and new hexational champions for Ξ₀<sub>BCKW</sub>(8) and Ξ₀<sub>BCKW</sub>(9).<sup>[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&diff=next&oldid=8050]</sup> | ||
** On the same day, Δ⁵ discovered a new pentational champion for Ξ₀<sub>SK</sub>(22), and new hexational champions for Ξ₀<sub>SK</sub>(23), Ξ₀<sub>SK</sub>(24), and Ξ₀<sub>SK</sub>(25).<sup>[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&diff=next&oldid=8087]</sup> | ** On the same day, Δ⁵ discovered a new pentational champion for Ξ₀<sub>SK</sub>(22), and new hexational champions for Ξ₀<sub>SK</sub>(23), Ξ₀<sub>SK</sub>(24), and Ξ₀<sub>SK</sub>(25).<sup>[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&diff=next&oldid=8087]</sup> | ||
** On July 28, Δ⁵ discovered a new pentational champion for Ξ₀<sub>SK</sub>(17).<sup>[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&diff=next&oldid=8100]</sup> | ** On July 28, Δ⁵ discovered a new pentational champion for Ξ₀<sub>SK</sub>(17).<sup>[https://wiki.bbchallenge.org/w/index.php?title=SKI_Calculus&diff=next&oldid=8100]</sup> | ||
| Line 26: | Line 21: | ||
** On July 16, Azerty discovered a logical leap in a claimed equivalence,<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1527291163823050803]</sup> prompting another re-enumeration of BBCS(11), leaving the same 1 holdout.<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1527291256198402179]</sup> This holdout was previously proven non-halting by sheep on May 17,<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1554807350811168868]</sup> racheline on July 8,<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1524403079867535440]</sup> and Tobias B on July 11.<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1525470062515978252]</sup> | ** On July 16, Azerty discovered a logical leap in a claimed equivalence,<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1527291163823050803]</sup> prompting another re-enumeration of BBCS(11), leaving the same 1 holdout.<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1527291256198402179]</sup> This holdout was previously proven non-halting by sheep on May 17,<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1554807350811168868]</sup> racheline on July 8,<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1524403079867535440]</sup> and Tobias B on July 11.<sup>[https://discord.com/channels/960643023006490684/1484108791636033659/1525470062515978252]</sup> | ||
* [[General Recursive Function]]: | * [[General Recursive Function]]: | ||
** On July 16, Shawn Ligocki | ** On July 16, Shawn Ligocki reduced the size 16 M(PRF) holdout list to 15 and proved those remaining 15 non-halting by hand, proving that the max value is 6.<sup>[https://discord.com/channels/960643023006490684/1447627603698647303/1527407138102841446]</sup> He shared what appears to be the [[General Recursive Function#Hardest Size 13 (Triangular Divisibility)|hardest size 15 program]] which depends on logic for divisibility of triangular numbers.<sup>[https://discord.com/channels/960643023006490684/1447627603698647303/1527405134857113650]</sup> | ||
* [[Lambda Calculus]]: | * [[Lambda Calculus]]: | ||
Latest revision as of 21:15, 8 November 2026
| Prev: June 2026 | This Month in Beaver Research | Next: August 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).
General
- Verification of BB(5) = 47,176,870 in Lean:
- On July 14, Marcelo Fornet used Claude AI to translate the proof of BB(5) = 47,176,870 to Lean, save for two machines: Skelet #1, and Skelet #17.[1]
- On July 16, the non-halting proof for Skelet #17 was translated to Lean.[2]
- On July 25, the non-halting proof for Skelet #1 was translated to Lean, thus completing the proof of BB(5) = 47,176,870 in Lean.[3]
- @carrino used Claude to begin work on proving the value of BBB(4) and formalizing the result in Rocq. On July 31, they were down to less than 40 holdouts.[4]
BB Adjacent
- SKI Calculus:
- Δ⁵ discovered several new champions for Ξ₀SK(12),[5], Ξ₀SK(14),[6] Ξ₀(12), Ξ₀SK(15),[7] and Ξ₀SK(16).[8]
- On July 27, Δ⁵ discovered a new pentational champion for Ξ₀BCKW(7) and new hexational champions for Ξ₀BCKW(8) and Ξ₀BCKW(9).[9]
- On the same day, Δ⁵ discovered a new pentational champion for Ξ₀SK(22), and new hexational champions for Ξ₀SK(23), Ξ₀SK(24), and Ξ₀SK(25).[10]
- On July 28, Δ⁵ discovered a new pentational champion for Ξ₀SK(17).[11]
- CounterScript:
- General Recursive Function:
- On July 16, Shawn Ligocki reduced the size 16 M(PRF) holdout list to 15 and proved those remaining 15 non-halting by hand, proving that the max value is 6.[17] He shared what appears to be the hardest size 15 program which depends on logic for divisibility of triangular numbers.[18]
- Lambda Calculus:
- On July 20, BBλ(40) was solved, showing that BBλ(40) ≈ 10↑↑↑16. BBλ(40) is the first solved domain in any non-trivial BB variant to reach pentational values.
- Post Tag System
- On July 21, Shawn Ligocki introduced the Busy Beaver function for Post Tag Systems, BBPT(n),[19] and provided champions for BBPT(n) for sizes 7 to 11.[20]
- On the same day, Shawn Ligocki shared holdout lists for tag systems with sizes less than 12.[21]
- On July 22, Shawn Ligocki proved the values of BBPT(n) for sizes 1 to 6, and shared a set of 9 holdouts with sizes less than 9.[22]
- On July 24, sheep discovered a supposedly "halting" tag system of size 11, with a mechanism similar to cryptids.[23] However, after a careful simulation by Shawn Ligocki,[24] it was realized that the system was an actual cryptid,[25] showing BBPT(11) is hard.
- Wang Tiles
- On July 22, AlephSquirrel introduced the Busy Beaver function for Wang Tiles, BBWT(n), and proved the values of BBWT(1) and BBWT(2).[26]
- On the same day, mathmasterzach established the lower bound BBWT(n) ≥ n.[27]
- On July 23, sheep rediscovered literature[28] from Emmanuel Jeandel and Michael Rao that implies BBWT(10) ≥ 212, and is decidable.[29]
- On July 24, AlephSquirrel proved BBWT(3) = 3.
- On July 25, AlephSquirrel proved BBWT(4) = 4.[30]
- On the same day, AlephSquirrel found a new BBWT(5) champion.[31]
- On July 26, Shawn Ligocki noted that the behavior of the BBWT(5) champion could be extended to establish the lower bound BBWT(n) ≥ 2n - 4.[32]
Holdouts
| Domain | Previous Holdout Count | New Holdout Count | Holdout Reduction | % Reduction |
|---|---|---|---|---|
| BB(6) | 1,094 | 1,064 | 30 | 2.74% |
| BB(4,3) | 4,784,443 | 4,747,566 | 36,877 | 0.77% |
- BB(6)
- On July 1, mxdys solved 4 holdouts in rocq.[33][34]
- On July 2, mxdys solved another holdout in rocq.[35]
- On July 3, mxdys solved another holdout in rocq with the help of an LLM.
- On July 28, prurq found a TM to halt. This was verified by mxdys in rocq two days later together with another machine.
- On the same day, mxdys released a new holdouts list of 1,064 machines up to equivalence, a 2.74% reduction compared to the previous holdouts list.
- BB(4,3)
- BB(2,5)
- On July 30, prurq simulated a holdout to halting.[38]
- BB(2,7)
- Terry Ligocki enumerated 180K more subtasks, increasing the number of holdouts to 2,185,010,519. A total of 700K subtasks out of the 1 million subtasks (or 70%) have been enumerated.