Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Estimates of functions characterizing turing machine operation

  • 9 Accesses

This is a preview of subscription content, log in to check access.

Literature Cited

  1. 1.

    Nguyen Khyu Ngy, “Bounds for sequences of states of Turing machines,” Problems of Cybernetics, Vol. 17 [in Russian], Moscow (1966).

  2. 2.

    B. A. Trakhtenbrot, Complexity of Algorithms and Computations [in Russian], Novosibirsk (1968).

  3. 3.

    V. A. Uspenskii, Lectures on Computable Functions [in Russian], Fizmatgiz, Moscow (1960).

  4. 4.

    V. A. Moshchenskii, “On the complexity of Turing computations,” Dokl. Akad. Nauk BSSR,10 (1969).

Download references

Additional information

Translated from Kibernetika, No. 1, pp. 34–40, January–February, 1971.

Rights and permissions

Reprints and Permissions

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

Download citation


  • Operating System
  • Artificial Intelligence
  • System Theory
  • Machine Operation
  • Turing Machine