User blog comment:LittlePeng9/Random Turing machines/@comment-10429372-20131015185020/@comment-1605058-20131015190304

We can do it with even one state: let the input be encoded as string of n ('s. New machine starts with state A and goes:

A ( _ l A

A _ ( r 0

Now we will have hydra (((...))) reduced, with n-1 pairs. Hydra function grows at about f_e_0, so we have it!