论文信息 - On quasi-unilateral universal Turing machines - 字舞流文

On quasi-unilateral universal Turing machines

Four universal Turing machines are given with strong limitations on the number of left instructions in their program. One of the machines is morever non-erasing, i.e. it does not erase any 1 written on the tape.

Maurice Margenstern | M. Margenstern

[1] Yurii Rogozhin,et al. Small Universal Turing Machines , 1996, Theor. Comput. Sci..

[2] M. Margenstern,et al. Deux machines de Turing universelles à au plus deux instructions gauches , 1995 .

[3] Maurice Margenstern,et al. Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality , 1995, LATIN.

[4] Manfred Kudlek,et al. A Universal Turing Machine with 3 States and 9 Symbols , 2001, Developments in Language Theory.

[5] Marvin Minsky,et al. Computation : finite and infinite machines , 2016 .

[6] Hao Wang. Tag systems and lag systems , 1963 .

[7] M. Margenstern,et al. Une machine de Turing universelle non-effaçante à exactement trois instructions gauches , 1995 .

[8] L. M. Pavlotskaya,et al. Solvability of the halting problem for certain classes of Turing machines , 1973 .

[9] Marvin Minsky,et al. Size and structure of universal Turing machines using Tag systems , 1962 .