0RB1LD 1LC1RB 1LD1RE 1LA1LE 1LZ0RC: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Polygon (talk | contribs)
Added Category:BB(5)
MrSolis (talk | contribs)
:(
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
{{machine|0RB1LD_1LC1RB_1LD1RE_1LA1LE_1LZ0RC}}
{{machine|0RB1LD_1LC1RB_1LD1RE_1LA1LE_1LZ0RC}}
{{TM|0RB1LD_1LC1RB_1LD1RE_1LA1LE_1LZ0RC|halt}} is the [[Busy Beaver Functions|num]](5) champion (the [[BB(5)]] TM which halts leaving the most consecutive ones on the tape) according to Andrés Sancho.<ref>[https://discord.com/channels/960643023006490684/1242208042460647575/1337655697348886558 Discord message] by Andrés Sancho on 8 Feb 2025</ref><ref>https://github.com/MatterAndy/BB5-contiguous-1s</ref> It halts after 15590 steps with tape
{{TM|0RB1LD_1LC1RB_1LD1RE_1LA1LE_1LZ0RC|halt}} is the [[Busy Beaver Functions|num(5)]] champion (the [[BB(5)|five-state, two-symbol]] TM which halts leaving the most consecutive ones on the tape) according to Andrés Sancho.<ref>[https://discord.com/channels/960643023006490684/1242208042460647575/1337655697348886558 Discord message] by Andrés Sancho on 8 Feb 2025</ref><ref>https://github.com/MatterAndy/BB5-contiguous-1s</ref> It halts after 15590 steps with 165 consecutive ones on the tape.
 
<math display="block">0^\infty \; \textrm{<Z} \; 1^{165} \; 0^\infty</math>


It is tied for the num(5) championship with {{TM|1RB1LA_1RC1LE_1RD1RE_0LA1RC_1RZ0LB|halt}} which is the [[TNF-1RB]] version of the same TM (The [[permutation]] of this TM starting at state B).
It is tied for the num(5) championship with {{TM|1RB1LA_1RC1LE_1RD1RE_0LA1RC_1RZ0LB|halt}} which is the [[TNF-1RB]] version of the same TM (The [[permutation]] of this TM starting at state B).


== Analysis by Shawn Ligocki ==
== Analysis ==
 
Let <math>A(a):=0^\infty\;1^a\;\textrm{<}\textrm{A}\;11\;0^\infty</math>. Then,
<pre>
<math display="block">\begin{array}{lll}A(3a)&\to&A(4a+2)\\A(3a+1)&\to&A(4a+4)\\A(3a+2)&\to&0^\infty\;\textrm{<}\textrm{Z}\;1^{4a+5}\;0^\infty\end{array}</math>
A(a, b) = $ 1^a <A 11^b $
== Trajectory ==
 
This Turing machine starts with <math>A(3)</math> after 13 steps and halts after 10 rule applications:
A(a+3, b) -> A(a, b+2)
<math display="block">A(3)\to A(6)\to A(10)\to A(16)\to A(24)\to A(34)\to A(48)\to A(66)\to A(90)\to A(122)\to 0^\infty\;\textrm{<}\textrm{Z}\;1^{165}\;0^\infty</math>
A(0, b) -> A(2b, 1)
A(1, b) -> A(0, b+1)
A(2, b) -> $ <Z 1^{2b+3} $
 
A(3k,  1) -> A(4k+2, 1)
A(3k+1, 1) -> A(4k+4, 1)
A(3k+2, 1) -> $ <Z 1^{4k+5} $
 
@13: A(3, 1)
 
Trajectory of "a" values starting from A(3, 1):
3 6 10 16 24 34 48 66 90 122 Halt(165)
</pre>


== References ==
== References ==
<references/>
<references/>
[[Category:BB(5)]]
[[Category:BB(5)]]

Latest revision as of 22:39, 7 October 2025

0RB1LD_1LC1RB_1LD1RE_1LA1LE_1LZ0RC (bbch) is the num(5) champion (the five-state, two-symbol TM which halts leaving the most consecutive ones on the tape) according to Andrés Sancho.[1][2] It halts after 15590 steps with 165 consecutive ones on the tape.

It is tied for the num(5) championship with 1RB1LA_1RC1LE_1RD1RE_0LA1RC_1RZ0LB (bbch) which is the TNF-1RB version of the same TM (The permutation of this TM starting at state B).

Analysis

Let A(a):=01a<A110. Then, A(3a)A(4a+2)A(3a+1)A(4a+4)A(3a+2)0<Z14a+50

Trajectory

This Turing machine starts with A(3) after 13 steps and halts after 10 rule applications: A(3)A(6)A(10)A(16)A(24)A(34)A(48)A(66)A(90)A(122)0<Z11650

References