A universal Turing machine
The aim of this paper is to give an example of a universal Turing machine, which is somewhat small. To get a small universal Turing machine a common constructions would go through simulating tag system (see Minsky 1967). The universal machine here simulate two-symbol Turing machines directly.
KeywordsMathematical Logic Turing Machine Formal Language Number System Binary Number
Unable to display preview. Download preview PDF.
- Minsky, Marvin Computation: Finite and Infinite Machines. Prentice-Hall 1967.Google Scholar