Skip to main content
SpringerLink
Log in

Decidability (undecidability) of equivalence of Minsky machines with components consisting of at most seven (eight) instructions

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1977 (MFCS 1977)

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

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. S. Ginsburg and E. Spanier: Semigroups. Presburger Formulas and Languages. Pacific Journal of Math., Vol. 16, No. 2, 285–296.

    Google Scholar 

  2. I. Korec: A Complexity valuation of the partial recursive functions following the expectation of the time ... Acta F. R. N. Univ. Comen. — Mathematica XXIII 1969, 53–112.

    Google Scholar 

  3. I. Korec: Computational Complexity Based on Expectation of the Time of Computations on Minsky Machines. Proceedings of MFCS 73, High Tatras, September 1973, 247–250.

    Google Scholar 

  4. J. V. Matijasewitch: Diophantine Representation of Recursively Enumerable Predicates. Contributions of Soviet Mathematicians at the International Mathematical Congress in Nice, 1970 (in Russian), Moscow 1972, 203–206.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Algebra, Faculty of Sciences of Comenius University, 816 31, Bratislava, Czechoslovakia

    Ivan Korec

Authors
  1. Ivan Korec
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Korec, I. (1977). Decidability (undecidability) of equivalence of Minsky machines with components consisting of at most seven (eight) instructions. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_152

Download citation

  • DOI: https://doi.org/10.1007/3-540-08353-7_152

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08353-5

  • Online ISBN: 978-3-540-37285-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation