TMBR: August 2025: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
(Add some holdouts news)
(→‎Cryptids: Fixed some typos)
Line 9: Line 9:


* A fast algorithm for [[Consistent Collatz]] simulation was re-discovered and popularized. Using it:
* A fast algorithm for [[Consistent Collatz]] simulation was re-discovered and popularized. Using it:
** apgrouper's simulated [[Antihydra]] to <math>2^{38}</math> iterations. This is actually a results from one year ago, but was rediscovered and added to the wiki. https://discord.com/channels/960643023006490684/1026577255754903572/1271528180246773883
** apgroucher simulated [[Antihydra]] to <math>2^{38}</math> iterations. This is actually a result from one year ago, but was rediscovered and added to the wiki. https://discord.com/channels/960643023006490684/1026577255754903572/1271528180246773883
** Shawn Ligocki simulated {{TM|1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC}} out to one additional Collatz reset, demonstrating that (if they halts, which they probviously should) they will have sigma score <math>> 10^{10^{10^7}}</math>.
** Shawn Ligocki simulated {{TM|1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC}} out to one additional Collatz reset, demonstrating that (if they halt, which they probviously should) they will have sigma scores <math>> 10^{10^{10^7}}</math>.


== Holdouts ==
== Holdouts ==

Revision as of 18:13, 21 August 2025

This Month in Beaver Research for August 2025.

Misc

Cryptids

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.

Blog Posts

In the News

Interesting TMs