Uniform-action Turing Machine

A Turing Machine is uniform-action if, for each state, all transitions 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	1RB---_1LB1LA (bbch)
3	17	1RB---_0RC0RC_1LC1LA (bbch)
4	29	1RB1RD_0LC0LA_1LC1LA_0RC--- (bbch)
5	≥ 441	1RB1RA_0RC0RE_1LC1LD_1LA1LD_---1RB (bbch)
6	> 16,088	1RB1RF_1RC1RA_1LD1LF_0RB0RE_---1LC_---0LC (bbch)

Source

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