View source for Uniform-action Turing Machine

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).
{| class="wikitable"
|+
!BBu(n)
!Value
!Champion
|-
|2
|6
|<code>1RB---_1LB1LA</code>
|-
|3
|17
|<code>1RB---_0RC0RC_1LC1LA</code>
|-
|4
|29
|<code>1RB1RD_0LC0LA_1LC1LA_0RC---</code>
|-
|5
|≥ 441
|<code>1RB1RA_0RC0RE_1LC1LD_1LA1LD_---1RB</code>
|-
|6
|> 16,088
|<code>1RB1RF_1RC1RA_1LD1LF_0RB0RE_---1LC_---0LC</code>
|}

== Source ==
Discord thread: https://discord.com/channels/960643023006490684/1377330731222564904/threads/1458010522967609425