This is a preview of subscription content, log in via an institution to check access.
Literature Cited
B. A. Trakhtenbrot, “Turing computations with logarithmic delay,” in: Algebra and Logic. A Seminar [in Russian], Vol. 3 (1964), pp. 33–48.
Ya. M. Barzdin', “Complexity of symmetry recognition by Turing machines,” in: Problems of Cybernetics [in Russian], Vol. 15 (1965), pp. 245–248.
M. O. Rabin, “Real time computation,” Israel J. Math., Sec. F,1, No. 4, 203–211 (1963).
G. S. Tseitin, “A lower bound on the number of steps for an inverting normal algorithm and other normal algorithms,” Zap. Nauchn. Seminarov Leningr. Otd. Mat. Inst. Akad. Nauk SSSR,20, 234–242 (1970).
V. A. Moshchenskii, “On the complexity of Turing computations,” Dokl. Akad. Nauk BelorusSSR, 13, No. 10, 34–40 (1969).
V. A. Moshchenskii, “Estimates of certain functions, characterizing the operation of Turing machines,” Kibernetika, No. 1 (1971).
V. A. Moshchenskii, “On the analysis of Turing computations,” Izv. Akad. Nauk BelorusSSR, Ser. Fiz.-Mat. Nauk, No. 2 (1972).
Additional information
Translated from Kibernetika, No. 3, pp. 86–94, May–June, 1977.
Rights and permissions
About this article
Cite this article
Moshchenskii, V.A. A method for the analysis of turing computations. I. Cybern Syst Anal 13, 402–412 (1977). https://doi.org/10.1007/BF01069660
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069660