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

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


Nonnegative Integer Partial Function Recursive Function Equivalence Problem Diophantine Equation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


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

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Ivan Korec
    • 1
  1. 1.Department of AlgebraFaculty of Sciences of Comenius UniversityBratislavaCzechoslovakia

Personalised recommendations