User blog comment:LittlePeng9/Random Turing machines/@comment-5529393-20130331120848/@comment-5529393-20130331213617

Ah, I see. You've made an Ackermann level function in 37 states;  perhaps you could try beating Graham's number in less than 64 states?