Abstract
Register machines with counters (RC machines) are studied. It is shown that any computable function can be strictly computed on RC machines with a bounded number of counters and programs. The place in the Kleene–Mostowski hierarchy of certain algorithmic problems related to RC machines is determined.
Similar content being viewed by others
References
A. P. Bel’tyukov, J. Sov. Math. 20 (4), 2280–2289 (1982).
I. V. Savitskii, Diskret. Mat. 29 (1), 95–113 (2017).
H. Rogers, Theory of Recursive Functions and Effective Computability (McGraw-Hill, New York, 1967).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © I.V. Savitskii, 2017, published in Doklady Akademii Nauk, 2017, Vol. 476, No. 4, pp. 387–388.
Rights and permissions
About this article
Cite this article
Savitskii, I.V. Register machines with counters. Dokl. Math. 96, 486–487 (2017). https://doi.org/10.1134/S1064562417050222
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064562417050222