User blog:Googleaarex/Hardy Turing

\(H_1(n)\) machine
0 1 * r 0 0 _ 1 l 1 1 1 1 l 1 1 _ _ r halt

\(H_2(n)\) machine
0 1 * r 0 0 _ 1 l 1 1 1 1 l 1 1 _ _ r 2 2 1 * r 2 2 _ 1 l 3 3 1 1 l 3 3 _ _ r halt

\(H_3(n)\) machine
0 1 * r 0 0 _ 1 l 1 1 1 1 l 1 1 _ _ r 2 2 1 * r 2 2 _ 1 l 3 3 1 1 l 3 3 _ _ r 4 4 1 * r 4 4 _ 1 l 5 5 1 1 l 5 5 _ _ r halt

\(H_m(n)\) machine
0 1 * r 0 0 _ 1 l 1 1 1 1 l 1 1 _ _ r 2 T for H_{m-1}(n), A and B replace A+2 and B+2, if m = 1, the 2*m state turn a halt state.