This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Nguyen Khyu Ngy, “Bounds for sequences of states of Turing machines,” Problems of Cybernetics, Vol. 17 [in Russian], Moscow (1966).
B. A. Trakhtenbrot, Complexity of Algorithms and Computations [in Russian], Novosibirsk (1968).
V. A. Uspenskii, Lectures on Computable Functions [in Russian], Fizmatgiz, Moscow (1960).
V. A. Moshchenskii, “On the complexity of Turing computations,” Dokl. Akad. Nauk BSSR,10 (1969).
Translated from Kibernetika, No. 1, pp. 34–40, January–February, 1971.
About this article
Cite this article
Moshchenskii, V.A. Estimates of functions characterizing turing machine operation. Cybern Syst Anal 7, 45–53 (1971). https://doi.org/10.1007/BF01070525
- Operating System
- Artificial Intelligence
- System Theory
- Machine Operation
- Turing Machine