|
This article is cited in 20 scientific papers (total in 20 papers)
Solvability of the halting problem for certain classes of Turing machines
L. M. Pavlotskaya Moscow Power Engineering Institute
Abstract:
One method of proving that some Turing machine is not universal is to prove that the halting problem is solvable for it. Therefore, to obtain a lower bound on the complexity of a universal machine, it is convenient to have a criterion of solvability of the halting problem. In the present paper, we establish some of these criteria; they are formulated in terms of properties of machine graphs and computations.
Received: 01.11.1972
Citation:
L. M. Pavlotskaya, “Solvability of the halting problem for certain classes of Turing machines”, Mat. Zametki, 13:6 (1973), 899–909; Math. Notes, 13:6 (1973), 537–541
Linking options:
https://www.mathnet.ru/eng/mzm7195 https://www.mathnet.ru/eng/mzm/v13/i6/p899
|
|