Skip to main content
SpringerLink
Log in

Modeling Multitape Minsky and Turing Machines by Three-Tape Minsky Machines

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

In this paper, we prove that a k-tape Minsky machine operating with time \(T(n)\) can be modeled by a three-tape Minsky machine in a time not exceeding \(T{{(n)}^{k}} \times \log T(n)\). It is shown that multitape Turing machines can be modeled by three-tape Minsky machines with optimal word encoding.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Marchenkov, S.S. and Savitskii, I.V., Mashiny v teorii vychislimykh funktsii (Machines in the Theory of Computable Functions), Moscow: MAKS Press, 2018.

  2. Mal’tsev, A.I., Algoritmy i rekursivnye funktsii (Algorithms and Recursive Functions), Moscow: Nauka, 1986.

  3. Clote, P., Computation models and functional algebras, in Handbook of Computability Theory, Elsevier, 1999, pp. 589–681.

    Google Scholar 

  4. Minsky, M.L., Recursive unsolvability of Post’s “TAG” and topics in theory of Turing machines, Ann. Math., 1961, vol. 74, pp. 437–455.

    Article  MathSciNet  Google Scholar 

  5. Minsky, M.L., Computation: Finite and Infinite Machines, Prentice Hall, 1967.

    MATH  Google Scholar 

  6. Marchenkov, S.S., Bases by superposition in classes of recursive functions, Mat. Vopr. Kibern., 1991, no. 3, pp. 115–139.

  7. Volkov, S.A., An example of a simple quasi-universal function in the \({{\mathcal{E}}^{2}}\) class of the Grzegorczyk hierarchy, Diskretnaya Mat., 2006, vol. 18, no. 4, pp. 31–44.

    Article  MathSciNet  Google Scholar 

  8. Volkov, S.A., Finite generability of some groups of recursive permutations, Diskretnaya Mat., 2008, vol. 20, no. 4, pp. 61–78.

    Article  Google Scholar 

  9. Marchenkov, S.S., On the complexity of the Grzegorczyk class \({{\mathcal{E}}^{2}}\), Diskretnaya Mat., 2010, vol. 22, no. 1, pp. 5–16.

    Article  MathSciNet  Google Scholar 

  10. Marchenkov, S.S., Predstavlenie funktsii superpozitsiyami (Representation of Functions by Superpositions), Moscow: KomKniga, 2010.

  11. Hennie, F.C. and Stearns, R.E., Two-tape simulation of multitape Turing machines, J. ACM, 1966, vol. 13, no. 4, pp. 533–546.

    Article  MathSciNet  Google Scholar 

  12. Yablonskii, S.V., Vvedenie v diskretnuyu matematiku (Introduction to Discrete Mathematics), Moscow: Nauka, 1979.

Download references

Funding

This work was supported in part by the Russian Foundation for Basic Research, project no. 19-01-00200.

Author information

Authors and Affiliations

  1. Department of Computational Mathematics and Cybernetics, Moscow State University, 119991, Moscow, Russia

    S. S. Marchenkov & S. D. Makeev

Authors
  1. S. S. Marchenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. D. Makeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to S. S. Marchenkov or S. D. Makeev.

Additional information

Translated by Yu. Kornienko

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Marchenkov, S.S., Makeev, S.D. Modeling Multitape Minsky and Turing Machines by Three-Tape Minsky Machines. Program Comput Soft 46, 428–432 (2020). https://doi.org/10.1134/S0361768820060055

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768820060055

Search

Navigation