Solvability of the halting problem for certain classes of Turing machines. (English. Russian original) Zbl 0284.02017

Math. Notes 13, 537-541 (1973); translation from Mat. Zametki 13, 899-909 (1973).


03D10 Turing machines and related notions
03D80 Applications of computability and recursion theory
Full Text: DOI


[1] C. E. Shannon, ?A universal Turing machine with two internal states,? in: Automata Studies (C. E. Shannon and J. McCarthy, editors), Princeton University Press, Princeton (1956).
[2] M. L. Minsky, ?Size and structure of universal Turing machines using tag systems,? in: Recursive Function Theory, Symposia in Pure Mathematics, Amer. Math. Soc.,5 (1962). · Zbl 0192.06601
[3] M. L. Minsky, Computation: Finite and Infinite Machines, Prentice-Hall, Inc., Englewood Cliffs, N. J. (1967). · Zbl 0195.02402
[4] Yu. A. Kryukov, ?Turing machines with two symbols and two states,? Algebra i Logika,6, No. 3, 54-60 (1967).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.