0RB1LD 1LC1RB 1LD1RE 1LA1LE 1LZ0RC: Difference between revisions
Jump to navigation
Jump to search
Added Category:BB(5) |
:( |
||
(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 | {{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. | ||
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 | == Analysis == | ||
Let <math>A(a):=0^\infty\;1^a\;\textrm{<}\textrm{A}\;11\;0^\infty</math>. Then, | |||
< | <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 | == Trajectory == | ||
This Turing machine starts with <math>A(3)</math> after 13 steps and halts after 10 rule applications: | |||
<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( | |||
A( | |||
A( | |||
</ | |||
== 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 . Then,
Trajectory
This Turing machine starts with after 13 steps and halts after 10 rule applications:
References
- ↑ Discord message by Andrés Sancho on 8 Feb 2025
- ↑ https://github.com/MatterAndy/BB5-contiguous-1s