1RB1LD 1RC1RB 1LC1LA 0RC0RD: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{machine|1RB1LD_1RC1RB_1LC1LA_0RC0RD}} {{TM|1RB1LD_1RC1RB_1LC1LA_0RC0RD}} Blanking Beaver BLB(4,2) champion which creates a blank tape after 32,779,477 steps. It was discovered and reported by Nick Drozd in 2021.<ref>Nick Drozd. [https://nickdrozd.github.io/2021/07/11/self-cleaning-turing-machine.html A New Record in Self-Cleaning Turing Machines]. 2021.</ref> == Analysis by Shawn Ligocki == Let <math display="block">D(a, b) = 0^\infty \; 1^a \; 0^...") |
(Mentioned Beeping Busy Beaver championship) |
||
(5 intermediate revisions by 3 users not shown) | |||
Line 1: | Line 1: | ||
{{machine|1RB1LD_1RC1RB_1LC1LA_0RC0RD}} | {{machine|1RB1LD_1RC1RB_1LC1LA_0RC0RD}} | ||
{{TM|1RB1LD_1RC1RB_1LC1LA_0RC0RD}} | {{TM|1RB1LD_1RC1RB_1LC1LA_0RC0RD}} is the current [[Blanking Beaver]] BLB(4,2) and [[Beeping Busy Beaver]] BBB(4,2) champion, creating a blank tape after 32,779,477 steps and [[Quasihalt|quasihalting]] after 32,779,478 steps. It was discovered and reported by Nick Drozd in 2021.<ref>Nick Drozd. [https://nickdrozd.github.io/2021/07/11/self-cleaning-turing-machine.html A New Record in Self-Cleaning Turing Machines]. 2021.</ref> | ||
Blanking Beaver BLB(4,2) champion | |||
== Analysis by [[User:sligocki|Shawn Ligocki]] == | == Analysis by [[User:sligocki|Shawn Ligocki]] == | ||
Let <math display="block">D(a, b) = 0^\infty \; 1^a \; 0^b \; \textrm{D>} \; 0^\infty</math>then:<math display="block">\begin{array}{lc} | Let <math display="block">D(a, b) = 0^\infty \; 1^a \; 0^b \; \textrm{D>} \; 0^\infty</math>then:<math display="block">\begin{array}{lc} | ||
D(a+3, & b) & \to & D(a, b+5) \\ | D(a+3, & b) & \to & D(a, b+5) \\ | ||
Line 25: | Line 21: | ||
& \to & D(166) & \to & D(281) & \to & D(472) & \to & D(791) & \to & D(1322) \\ | & \to & D(166) & \to & D(281) & \to & D(472) & \to & D(791) & \to & D(1322) \\ | ||
& \to & D(2207) & \to & D(3682) & \to & D(6141) & \to & \textrm{Blank} \\ | & \to & D(2207) & \to & D(3682) & \to & D(6141) & \to & \textrm{Blank} \\ | ||
\end{array} </math>which has the remarkable luck of applying this Collatz-like map 14 times before reaching the blanking config (expected # of applications before halting is 3). | \end{array} </math>which has the remarkable luck of applying this [[Collatz-like]] map 14 times before reaching the blanking config (expected # of applications before halting is 3). | ||
See also, previous analysis in 2021: https://www.sligocki.com/2021/07/17/bb-collatz.html | |||
== Relation to other machines == | |||
The map and trajectory are equivalent to that of the [[BB(5) champion]]. For all <math>k</math>, let <math>f(k)</math> be the number such that <math>D(k)\to D(f(k))</math>, or <math>\text{HALT}</math> if <math>D(k)\to\textrm{Blank}</math>, and let <math>g</math> be the map simulated by the BB(5) champion. Then: | |||
<math display="block">\begin{array}{lc} | |||
g(2(3k)+2) & = & g(6k+2) & = & \text{HALT} & = & f(3k) \\ | |||
g(2(3k+1)+2) & = & g(6k+4) & = & 10k+14 & = & 2f(3k+1)+2 \\ | |||
g(2(3k+2)+2) & = & g(6k+6) & = & 10k+16 & = & 2f(3k+2)+2 \\ | |||
\end{array}</math> | |||
So the size of this machine's BLB output is tied to the size of the BB(5) champion's output. | |||
== References == | == References == |
Latest revision as of 10:57, 15 August 2025
1RB1LD_1RC1RB_1LC1LA_0RC0RD
(bbch) is the current Blanking Beaver BLB(4,2) and Beeping Busy Beaver BBB(4,2) champion, creating a blank tape after 32,779,477 steps and quasihalting after 32,779,478 steps. It was discovered and reported by Nick Drozd in 2021.[1]
Analysis by Shawn Ligocki
Let
then:
let , then we can simplify to:
Starting from (at step 19) we get the trajectory:
which has the remarkable luck of applying this Collatz-like map 14 times before reaching the blanking config (expected # of applications before halting is 3).
See also, previous analysis in 2021: https://www.sligocki.com/2021/07/17/bb-collatz.html
Relation to other machines
The map and trajectory are equivalent to that of the BB(5) champion. For all , let be the number such that , or if , and let be the map simulated by the BB(5) champion. Then:
So the size of this machine's BLB output is tied to the size of the BB(5) champion's output.
References
- ↑ Nick Drozd. A New Record in Self-Cleaning Turing Machines. 2021.