

A131957


Busy Beaver sigma variation: maximum number of 1's on the final tape, for a 2state, 2symbol Turing machine running on a tape which is initialized with the number n in binary and 0's everywhere else. The machine is started at the rightmost bit in the number n.


0



4, 4, 4, 5, 6, 6, 5, 6, 5, 6, 6, 7, 6, 7, 6, 7, 6, 7, 6, 6, 8, 8, 7, 8, 6, 7, 7, 8, 7, 8, 7, 8, 7, 8, 6, 8, 7, 7, 7, 7, 6, 8, 8, 9, 8, 9, 8, 10, 7, 8, 7, 7, 7, 9, 8, 9, 7, 8, 8, 9, 8, 9, 8, 9, 8, 9, 8, 8, 8, 7, 8, 10, 8, 7, 7, 8, 8, 8, 7, 8, 8, 8, 7, 10, 10, 10, 9, 10, 8, 10, 10, 10, 10, 10, 9, 12, 8, 9, 7, 9
(list;
graph;
refs;
listen;
history;
text;
internal format)




