[CT] universal Turing Machine

In computer science,Universal Turing Machine(UTM) Is a Turing machine that can simulate an arbitrary Turing Machine on arbitrary input. the universal machine essential tially achieves this by reading both the description of the machine to be simulated as well as the input thereof from its own tape.

 

By carefully designing different command sets, we can obtain Turing machines with different functions. You can design a Turing machine that generates a natural number sequence, or a Turing machine that calculates Root 2, or even a Turing machine that prints the circumference rate. Turing itself has even implemented such a special Turing machine called the General Turing machine, which can simulate the running of other Turing machines. Specifically, if the instruction set of any Turing machine is encoded in a standard mode proposed by Turing and prefixed to the paper, then the General Turing machine can simulate the operation of the Turing machine in the blank space of the paper according to the existing information on the paper, and output what the Turing machine should output.