A Coding Method Universal Turing Machine
Liu Guang-zhi · Microcomputer Information · 2010
In order to simulate the all Turing machine with universal Turing machine, a method to encode the universal Turing machine based-on 0 and 1 is presented in this paper. In the first, we use the string of 0 and 1 to denote the Turing machine, secondly, encode the all symbols except the blank symbol with 0 and 1 and encode the state transfer function of Turing machine with 0 and 1. In fact, universal Turing just changes the express method of symbols and state transfer functions of Turing machine. Using the presented method, we can easily simulate the all Turing machine with universal Turing machine.