TMBR: August 2025: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
(Mentioned Instruction-Limited Blanking Busy Beavers, aswell as maximum computation of these functions) |
||
| Line 8: | Line 8: | ||
==BB Adjacent== | ==BB Adjacent== | ||
*John Tromp introduced the <math>BB \lambda _1(n)</math> function for [[Busy Beaver for lambda calculus#Oracle Busy Beaver|Busy Beaver for lambda calculus with an oracle]] and computed it up to <math>BB \lambda _1(22)</math>. | *John Tromp introduced the <math>BB \lambda _1(n)</math> function for [[Busy Beaver for lambda calculus#Oracle Busy Beaver|Busy Beaver for lambda calculus with an oracle]] and computed it up to <math>BB \lambda _1(22)</math>. | ||
* Greedy Busy Beaver gBBi(n) was | * Instruction-Limited Greedy Busy Beaver gBBi(n) and an [[Instruction-Limited Busy Beaver#Instruction-Limited Busy Beaver Variants|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. | ||
[[Category:This Month in Beaver Research]] | [[Category:This Month in Beaver Research]] | ||
Revision as of 17:42, 16 August 2025
This Month in Beaver Research for August 2025.
Champions
Holdouts
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.
