User blog comment:Ikosarakt1/My Turing machine programs/@comment-5029411-20130407142847/@comment-5150073-20130409152017

Aarex, the ruleset for f_w+1(n) TM is constructed as follows:

0 _ * r 5 0 1 _ r 1 1 1 * r 1 1 _ * r 2 2 _ 1 l 3 2 1 * r 2 3 1 * l 3 3 _ * l 4 4 1 * l 4 4 _ 1 r 0

T (here T indicates the table for f_w(n) expect that in every rule we replace A ... B to A+5 ... B+5. For example, 15 _ * l 15 becomes 20 _ * l 20. Also, in rule 35 2 _ l halt we replace "halt" to 53.)

53 _ * r 43 54 _ * l 54 54 1 _ l 55 55 _ * l 58 55 1 * r 56 56 _ * r 56 56 1 * l 57 57 _ * r 38 58 _ * l 58 58 1 _ l 59 59 _ * l halt 59 1 * r 60 60 _ * r 60 60 1 * l 61 61 _ * r 33