1. AANDERAA S. AND FISCHER P.C. The solvability of the halting problem for 2-state Post machines. Ia preparation. AANDERAA S. AND FISCHER P.C. The solvability of the halting problem for 2-state Post machines. Ia preparation.
2. DAws M.
A note on universal Turiag machines. Automata Studies Princeton U. Press Princeton N. J. 1956. --. A note on universal Turiag machines. Automata Studies Princeton U. Press Princeton N. J. 1956.
3. HOOPER P.K. A note on Turing machines. Amer. Math Soc. Notices (Jan. 1965). HOOPER P.K. A note on Turing machines. Amer. Math Soc. Notices (Jan. 1965).
4. Recursive unsolvability of Post's problem of "tag" and other topics in theory of Turing machines;Annal. Math,1961