Algorithm A1: Mapping a Turing machine rule matrix M to a unique identifier $id$, in order to traverse through all TMs.

1$\#R=\#Q\times \#\Sigma \times 3$; 2$id=0$; 3for$\mathrm{each}$c$\mathrm{in}$Mdo 4 | $id=id\times \#R+c.write+(c.move+c.state\times 3)\times \#\Sigma$; 5 end 6 return $id$;