IMCS/Publications/BASM/Issues/BASM n.4 (10), 1992/

A universal Turing machine with $10$ states and $3$ symbols. (Russian)

Authors: Rogojin Iurie


Universal turing machine with 10 states and 3 symbols constructed. In this paper method by M.~Minsky of modeling TAG-systems with $P=2$ used. Let $(n,m)$ - class of turing machines with $n$ states and $m$ symbols. From results obtained early and obtained in this paper we conclude what no studyed (is there universal) turing machine?) 54 classes of turing machines.