TMBR: May 2026: Difference between revisions
Jump to navigation
Jump to search
RobinCodes (talk | contribs) m →Holdouts: Preassume reference |
GRF |
||
| 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).'' | ||
== BB Adjacent == | |||
[[General Recursive Function|General Recursive Functions]]: | |||
* Some new cryptids were hand-built: | |||
** Size 56, by Shawn on 2 May (simulating 5x+1 problem starting at 7).<sup>[https://github.com/sligocki/etc/blob/main/gen_rec/mgrf/collatz.mgrf]</sup> | |||
** Size 49, by aparker, star and Shawn on 3 May (simulating [[wikipedia:Brocard's_problem|Brocard's problem]]).<sup>[https://github.com/sligocki/etc/blob/main/gen_rec/mgrf/brocard.mgrf]</sup> | |||
* The first non-trivial divergent GRF was found (size 15). It halts iff there exists some n ≥ 1 such that n+3 divides <math>Tetr(n) = \frac{n(n+1)(n+2)}{6}</math>.<sup>[https://discord.com/channels/960643023006490684/960643023530762341/1500584497542987776]</sup> aparker<sup>[https://discord.com/channels/960643023006490684/960643023530762341/1500587569514283098]</sup> and star<sup>[https://discord.com/channels/960643023006490684/960643023530762341/1500595210919346337]</sup> proved that there is no such n. | |||
== Holdouts == | == Holdouts == | ||
Revision as of 18:08, 4 May 2026
| Prev: April 2026 | This Month in Beaver Research | Next: June 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
- Some new cryptids were hand-built:
- Size 56, by Shawn on 2 May (simulating 5x+1 problem starting at 7).[1]
- Size 49, by aparker, star and Shawn on 3 May (simulating Brocard's problem).[2]
- The first non-trivial divergent GRF was found (size 15). It halts iff there exists some n ≥ 1 such that n+3 divides .[3] aparker[4] and star[5] proved that there is no such n.
Holdouts
- BB(2,6)
- Andrew Ducharme reduced the number of holdouts from 536,112 to 533,764 via Enumerate.py, a 0.44% reduction.[6]
- BB(2,7)
- Terry Ligocki enumerated 20K more subtasks, increasing the number of holdouts to 749,156,843. A total of 24K subtasks out of the 1 million subtasks (or 24%) have been enumerated.[2]