TMBR: August 2025: Difference between revisions
Jump to navigation
Jump to search
(Mentioned Instruction-Limited Blanking Busy Beavers, aswell as maximum computation of these functions) |
(Collatz reset) |
||
| Line 5: | Line 5: | ||
==Holdouts== | ==Holdouts== | ||
== Cryptids == | |||
* Shawn Ligocki simulated {{TM|1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC}} out to one additional Collatz reset. | |||
==BB Adjacent== | ==BB Adjacent== | ||
Latest revision as of 21:24, 18 August 2025
This Month in Beaver Research for August 2025.
Champions
Holdouts
Cryptids
- Shawn Ligocki simulated
1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC(bbch) out to one additional Collatz reset.
BB Adjacent
- John Tromp introduced the function for Busy Beaver for lambda calculus with an oracle and computed it up to .
- Instruction-Limited Greedy Busy Beaver gBBi(n) and an Instruction-Limited variant of the Blanking Busy Beaver (BLBi(n)) were introduced. gBBi(n) was computed up to n = 13 and BLBi(n) was computed up to n = 7.
