Skip to main content
SpringerLink
Log in

Mutual upper bounds of size and time for a Turing machine and a Markov–Post algorithm for mutual simulations

  • Mathematics
  • Published:
Vestnik St. Petersburg University: Mathematics Aims and scope Submit manuscript

Abstract

A Markov–Post algorithm and a Turing machine, which have mutual upper bounds on time and space, are proven to be interchangeable up to a linear function of space and a polynomial of time for the Turing machine, respectively. No more than two-letter extensions of the exterior alphabet are used.

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. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Massachusetts, 1976).

    Google Scholar 

  2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).

    MATH  Google Scholar 

  3. S. V. Yakhontov, N. K. Kosovskii, and T. M. Kosovskaya, Efficient upon Time and Space Approximations of Num-bers and Functions. Textbook (S.-Peterb. Gos. Univ., St. Petersburg, 2012) [in Russian].

    Google Scholar 

  4. N. K. Kosovskii and T. M. Kosovskaya, “Polynomial church thesis for refal-5-functions, normal algorithms and their generalization,” Komp’yuternye Instrum. Obraz., No. 5, 12–21 (2010).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. St. Petersburg State University, Universitetskaya nab. 7/9, St. Petersburg, 199034, Russia

    N. K. Kosovskii, T. M. Kosovskaya & N. N. Kosovskii

Authors
  1. N. K. Kosovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. M. Kosovskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. N. Kosovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. K. Kosovskii.

Additional information

Original Russian Text © N.K. Kosovskii, T.M. Kosovskaya, N.N. Kosovskii, 2015, published in Vestnik Sankt-Peterburgskogo Universiteta. Seriya 1. Matematika, Mekhanika, Astronomiya, 2015, No. 2, pp. 191–194.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kosovskii, N.K., Kosovskaya, T.M. & Kosovskii, N.N. Mutual upper bounds of size and time for a Turing machine and a Markov–Post algorithm for mutual simulations. Vestnik St.Petersb. Univ.Math. 48, 72–74 (2015). https://doi.org/10.3103/S1063454115020053

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1063454115020053

Keywords

Search

Navigation