TMBR: August 2025: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
No edit summary
(Collatz reset)
 
(One intermediate revision by one other user not shown)
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==
*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 made.
* 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]]



Latest revision as of 21:24, 18 August 2025

This Month in Beaver Research for August 2025.

Champions

Holdouts

Cryptids

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.

Blog Posts

In the News

Interesting TMs