TMBR: August 2025: Difference between revisions
Jump to navigation
Jump to search
(Collatz reset) |
(Add Iijil's converter and describe a bit more about the constant collatz divide-and-conquer alg) |
||
| Line 2: | Line 2: | ||
[[:Category:This Month in Beaver Research|This Month in Beaver Research]] for August 2025. | [[:Category:This Month in Beaver Research|This Month in Beaver Research]] for August 2025. | ||
== | == Misc == | ||
* Iijil shared an algorithm for converting an arbitrary n-state m-symbol TM into a 2-state TM with 3(n+1)m symbols. https://gist.github.com/Iijil1/0d611dbf0a9d52984f72cb14e66a4b28 | |||
== Cryptids == | == Cryptids == | ||
* Shawn Ligocki simulated {{TM|1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC}} out to one additional Collatz reset. | * 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 | |||
** 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>. | |||
==BB Adjacent== | ==BB Adjacent== | ||
Revision as of 17:09, 21 August 2025
This Month in Beaver Research for August 2025.
Misc
- Iijil shared an algorithm for converting an arbitrary n-state m-symbol TM into a 2-state TM with 3(n+1)m symbols. https://gist.github.com/Iijil1/0d611dbf0a9d52984f72cb14e66a4b28
Cryptids
- A fast algorithm for Consistent Collatz simulation was re-discovered and popularized. Using it:
- apgrouper's simulated Antihydra to 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
- Shawn Ligocki simulated
1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC(bbch) out to one additional Collatz reset, demonstrating that (if they halts, which they probviously should) they will have sigma score >
.
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.
