Uniform-action Turing Machine: Difference between revisions
Jump to navigation
Jump to search
Created page |
Added links |
||
| Line 10: | Line 10: | ||
|2 | |2 | ||
|6 | |6 | ||
|<code>1RB---_1LB1LA</code> | |<code>{{TM|1RB---_1LB1LA|halt}}</code> | ||
|- | |- | ||
|3 | |3 | ||
|17 | |17 | ||
|<code>1RB---_0RC0RC_1LC1LA</code> | |<code>{{TM|1RB---_0RC0RC_1LC1LA|halt}}</code> | ||
|- | |- | ||
|4 | |4 | ||
|29 | |29 | ||
|<code>1RB1RD_0LC0LA_1LC1LA_0RC---</code> | |<code>{{TM|1RB1RD_0LC0LA_1LC1LA_0RC---|halt}}</code> | ||
|- | |- | ||
|5 | |5 | ||
|≥ 441 | |≥ 441 | ||
|<code>1RB1RA_0RC0RE_1LC1LD_1LA1LD_---1RB</code> | |<code>{{TM|1RB1RA_0RC0RE_1LC1LD_1LA1LD_---1RB|halt}}</code> | ||
|- | |- | ||
|6 | |6 | ||
|> 16,088 | |> 16,088 | ||
|<code>1RB1RF_1RC1RA_1LD1LF_0RB0RE_---1LC_---0LC</code> | |<code>{{TM|1RB1RF_1RC1RA_1LD1LF_0RB0RE_---1LC_---0LC|halt}}</code> | ||
|} | |} | ||
== Source == | == Source == | ||
Discord thread: https://discord.com/channels/960643023006490684/1377330731222564904/threads/1458010522967609425 | Discord thread: https://discord.com/channels/960643023006490684/1377330731222564904/threads/1458010522967609425 | ||
Revision as of 09:57, 18 August 2026
A Turing Machine is uniform-action is every state write the same symbol and move in the same direction. This means that the cell color affects only the next state.
The busy beaver function for UATM is BBu(n).
| BBu(n) | Value | Champion |
|---|---|---|
| 2 | 6 | |
| 3 | 17 | |
| 4 | 29 | |
| 5 | ≥ 441 | |
| 6 | > 16,088 | |
Source
Discord thread: https://discord.com/channels/960643023006490684/1377330731222564904/threads/1458010522967609425