Skip to main content
Log in

Register machines with counters

  • Mathematics
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. P. Bel’tyukov, J. Sov. Math. 20 (4), 2280–2289 (1982).

    Article  Google Scholar 

  2. I. V. Savitskii, Diskret. Mat. 29 (1), 95–113 (2017).

    Article  Google Scholar 

  3. H. Rogers, Theory of Recursive Functions and Effective Computability (McGraw-Hill, New York, 1967).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to I. V. Savitskii.

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

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Savitskii, I.V. Register machines with counters. Dokl. Math. 96, 486–487 (2017). https://doi.org/10.1134/S1064562417050222

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064562417050222

Navigation