TMBR: March 2026: Difference between revisions
Jump to navigation
Jump to search
Qwertyasdf (talk | contribs) add new bb13 champion |
Qwertyasdf (talk | contribs) →Holdouts: add bb7 reduction |
||
| Line 28: | Line 28: | ||
** prurq [https://discord.com/channels/960643023006490684/1471178503235043493/1481022684975337586 found a machine to be a Translated Cycler]. | ** prurq [https://discord.com/channels/960643023006490684/1471178503235043493/1481022684975337586 found a machine to be a Translated Cycler]. | ||
** mxdys [https://discord.com/channels/960643023006490684/1239205785913790465/1481557945346035814 decided a machine] using FAR. | ** mxdys [https://discord.com/channels/960643023006490684/1239205785913790465/1481557945346035814 decided a machine] using FAR. | ||
*[[BB(7)]]: | |||
**Andrew Ducharme [https://discord.com/channels/960643023006490684/1369339127652159509/1481889113232904295 reduced] the number of holdouts from 18,195,192 to 18,036,852 (a 0.87% reduction) via the mxdys FAR decider. | |||
*[[BB(2,5)]]: | *[[BB(2,5)]]: | ||
**[https://discord.com/channels/960643023006490684/1259770421046411285/1481197573611061311 Peacemaker II solved a machine using FAR.] Thus, the new holdout count is 71, or 60 considering informal proofs. | **[https://discord.com/channels/960643023006490684/1259770421046411285/1481197573611061311 Peacemaker II solved a machine using FAR.] Thus, the new holdout count is 71, or 60 considering informal proofs. | ||
Revision as of 07:43, 13 March 2026
| Prev: February 2026 | This Month in Beaver Research | Next: April 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).
This Month in Beaver Research for March 2026. We celebrated bbchallenge's fourth birthday on 8 March.
TODO: Write a proper introductory paragraph.
Champions
- Discord user 50_ft_lock found a new BB(13) champion, which surpasses Graham's number, reducing the upper bound of Graham-beating TMs to 13 states.
Meta
- Famous math youtuber 2swap made a couple of videos about Turing Machines arranged into grids and colored based on their halting status for BB(2,2), BB(3,2), BB(2,3), BB(4,2) and BB(5,2) respectively, then made a two-hour long Youtube video about the same topic on their second channel.
Holdouts
- BB(6): 1e14 machines: 171. 1e15 machines: 237. 12 solved machines.
- Holdouts lists for machines not simulated to 1e14 and 1e15 steps were created. The holdouts list counts were 178 and 252 respectively. See Spreadsheet for BB6.
- Later, prurq found 10 more machines in the holdouts list that had previously been simulated to 1e15: thus the new 1e15 holdout count was 242.
- Andrew Ducharme solved two machines using FAR.
- prurq found two machines [1][2] to be Translated Cyclers. Shawn Ligocki verified one of them and discovered its preperiod to be over steps. mxdys verified the other. Both were 1e14 and 1e15 holdouts, thus reducing those holdout counts by 2.
- mxdys found four more [3][4] Translated Cyclers in the remaining holdouts and solved one more TM using FAR.
- Andrew Ducharme solved a machine using FAR. This machine was a 1e14 and 1e15 holdout, thus reducing those holdout counts by 1.
- prurq found 3 more machines previously simulated so far in the 1e14 list, and 2 more in the 1e15 list (both were also 1e14). This means 1e14 holdout count was reduced by 3, and 1e15 holdout count was reduced by 2.
- Discord user mammillaria simulated a 1e14 holdout thus far, therefore reducing that holdout count by 1.
- prurq found a machine to be a Translated Cycler.
- mxdys decided a machine using FAR.
- BB(7):
- Andrew Ducharme reduced the number of holdouts from 18,195,192 to 18,036,852 (a 0.87% reduction) via the mxdys FAR decider.
- BB(2,5):
- Peacemaker II solved a machine using FAR. Thus, the new holdout count is 71, or 60 considering informal proofs.