Skip to main content
SpringerLink
Log in

Different modifications of pointer machines and their computational power

  • Contributions
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1991 (MFCS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 520))

Abstract

Kolmogorov — Uspensky machines (KUM) and storage modification machines (SMM) are the variants of machines with graph storage, called here pointer machines (PM). It is an open problem whether SMMs are more powerful than KUMs. An approach to solution of this problem is suggested here. It is shown that with some restrictions weak variants of PMs, called tree pointer machines, and Turing machines with tree memory can not recognize in real time some language real time recognizible by SMMs.

Extended Abstract

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AHU] A.V. Aho, J.E. Hopcroft, J.D. Ullman, “The Design and Analysis of Computer Algorithms,” Addison-Wesley, Reading, Mass., 1974.

    Google Scholar 

  2. Ya.M. Barzdin', The complexity of simmetry recognition on Turing machines, Problems of Cybernetics 15 (1965), 245–248, Nauka, Moscow. (Russian).

    Google Scholar 

  3. [G76] D.Yu. Grigoriev, Kolmogorov algorithms are stronger than Turing machines, ICMML VII, Notes of Scientific Seminars Steklov Mathematical Institute, Leningrad Department 60 (1976), 29–37, Nauka, Leningrad. (Russian).

    Google Scholar 

  4. [Gu88] Yu. Gurevich, Kolmogorov machines and related issues, The column on Logic in Computer Science, Bulletin EATCS 35 (1988), 71–82.

    Google Scholar 

  5. D.E. Knuth, “The Art of Computer Programming,” vol.2, Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1971.

    Google Scholar 

  6. [K53] A.N. Kolmogorov, On the Notion of Algorithm, Uspekhi Mat. Nauk 8 4 (1953), 175–176. (Russian).

    Google Scholar 

  7. [KU58] A.N. Kolmogorov, V.A. Uspensky, On the Definition of an Algorithm, Uspekhi Mat. Nauk 13 4 (1958), 3–28. (Russian); AMS Translations, 29 2 (1963), 217–245.

    Google Scholar 

  8. K. Mehlhorn, S. Naher, H. Alt, A lower bound on the compexity of the union-split-find problem, SIAM J. Computing 17 6 (1988), 1092–1102.

    Google Scholar 

  9. [S73] A.Schönhage, Real-time simulation of multidimensional Turing machines by storage modification machines, Technical memorandum 37 (1973), M.I.T. Project MAC, Cambridge, MA.

    Google Scholar 

  10. [S80] A. Schönhage, Storage Modification Machines, SIAM J. Computing 9 3 (1980), 490–508.

    Google Scholar 

  11. A. Schönhage, Tapes versas poi ters, a study in implementing fast algorithms, EATCS Bulletin 30 (1986), 23–32.

    Google Scholar 

  12. J. Tromp, P. van Emde Boas, Associative storage modification machines, Cent. Math. and Comput. sci., NCS R9014 (1990), 1–13.

    Google Scholar 

  13. [US87] V.A. Uspensky, A.L. Semenov, “The Theory of Algorithms: Basic Developments and Applications,” Nauka, Moscow, 1987. (Russian); LN in computer science 122 (1981), 100–234.

    Google Scholar 

  14. P. van Emde Boas, Space mesures for storage modification machines, Inf. Proc. Lett. 30 (1989), 103–110.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. 6, Polevaya Str., Apt. 52, 152140, Pereslavl-Zalessky, USSR

    Konstantin V. Shvachko

Authors
  1. Konstantin V. Shvachko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shvachko, K.V. (1991). Different modifications of pointer machines and their computational power. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_86

Download citation

  • DOI: https://doi.org/10.1007/3-540-54345-7_86

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54345-9

  • Online ISBN: 978-3-540-47579-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation