User blog comment:LittlePeng9/Random Turing machines/@comment-10429372-20131016145522/@comment-1605058-20131016202840

1. Easiest to explain on example: suppose you have hydra 0( 2( 2) w( 1( 1) w) 0) where number before parenthesis is it's label. You replace n( with n+1 ('s, n) with n+1 )'s, w( with )( and w) with )), so result is ( () )( )) ).

2. No. What you wrote is label w node over label 0 node. But I imagine it isn't that hard to make )) pair a w+1 label, and )()) a w+2 label etc. While designing I knew about it, but decided not to make myself more work. I might try to add that later.

You may now think "so maybe )))) can be w2?". It would meet big technical difficulties connected with how I made w label, but it is still possible.