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.
Similar content being viewed by others
References
M. L. Minsky, Computation: Finite and Infinite Machines. Englewood Cliffs (Prentice-Hall, Englewood Cliffs, NJ, 1967).
A. P. Bel’tyukov, “Machine description and initial Grzegorczyk class hierarchy,” Zap. Nauch. Sem. LOMI im. V.A. Steklova 88, 30–46 (1979).
I. V. Savitskiy, “Computations on register machines with counters,” Discrete Math. Appl. 29(2), 97–111 (2018).
S. S. Marchenkov and I. V. Savitskii, Machines in the Theory of Computable Functions (MAKS Press, Moscow, 2018) [in Russian].
Author information
Authors and Affiliations
Corresponding author
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
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
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0278641919030051