Cybernetics

, Volume 7, Issue 1, pp 45–53 | Cite as

Estimates of functions characterizing turing machine operation

  • V. A. Moshchenskii
Article
Received:

Keywords

Operating System Artificial Intelligence System Theory Machine Operation Turing Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    Nguyen Khyu Ngy, “Bounds for sequences of states of Turing machines,” Problems of Cybernetics, Vol. 17 [in Russian], Moscow (1966).Google Scholar
  2. 2.
    B. A. Trakhtenbrot, Complexity of Algorithms and Computations [in Russian], Novosibirsk (1968).Google Scholar
  3. 3.
    V. A. Uspenskii, Lectures on Computable Functions [in Russian], Fizmatgiz, Moscow (1960).Google Scholar
  4. 4.
    V. A. Moshchenskii, “On the complexity of Turing computations,” Dokl. Akad. Nauk BSSR,10 (1969).Google Scholar

Copyright information

© Consultants Bureau 1973

Authors and Affiliations

  • V. A. Moshchenskii

There are no affiliations available

Personalised recommendations