Skip to main content
SpringerLink
Log in

Eliminating Inequalities in Register Machines with Counters

  • Published:
Moscow University Computational Mathematics and Cybernetics Aims and scope Submit manuscript

Abstract

It is proved that in programs of register machines with counters, only the equal-to/not-equal-to relations between registers and counters are essential without loss of computational capabilities.

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. M. L. Minsky, Computation: Finite and Infinite Machines. Englewood Cliffs (Prentice-Hall, Englewood Cliffs, NJ, 1967).

    Google Scholar 

  2. A. P. Bel’tyukov, “Machine description and initial Grzegorczyk class hierarchy,” Zap. Nauch. Sem. LOMI im. V.A. Steklova 88, 30–46 (1979).

    MATH  Google Scholar 

  3. I. V. Savitskiy, “Computations on register machines with counters,” Discrete Math. Appl. 29(2), 97–111 (2018).

    Article  MathSciNet  MATH  Google Scholar 

  4. S. S. Marchenkov and I. V. Savitskii, Machines in the Theory of Computable Functions (MAKS Press, Moscow, 2018) [in Russian].

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    I. V. Savitskii

Authors
  1. I. V. Savitskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. V. Savitskii.

Additional information

Russian Text © The Author(s), 2019, published in Vestnik Moskovskogo Universiteta, Seriya 15: Vychislitel’naya Matematika i Kibernetika, 2019, No. 3, pp. 45–52.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Savitskii, I.V. Eliminating Inequalities in Register Machines with Counters. MoscowUniv.Comput.Math.Cybern. 43, 126–132 (2019). https://doi.org/10.3103/S0278641919030051

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation