User blog comment:Ikosarakt1/My Turing machine programs/@comment-5529393-20130331094937

I'm sure Milton Green describes his machines in his original paper, but if you can't acccess it, they are described here:

http://www.cs.uni.edu/~fienup/mics_2002/proceedings/papers/JULSTROM.pdf

They are actually quite simple; the first is a two-state machine that computes m+1 from m, and then from any  machine M_{2n} you can construct machine M_{2n+2} by just adding two rules that  apply the previous machine m times.