Skip to main content
Log in

Programs with restoration of computations

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

In this article, the notion of a program with restoration of computations is introduced, i.e., such a program that makes it possible to renew interrupted computations from any intermediate value obtained before an interruption of its operation. As is shown, any operator specified by a regular scheme of algorithmic algebra can be computed by a program with this property.

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. V. E Kotov and V. K. Sabelfeld, Theory of Schemes of Programs [in Russian], Nauka, Moscow (1991).

    Google Scholar 

  2. E. L. Yushchenko, S. V. Surzhko, G. E. Tseitlin, and A. I. Shevchenko, Algorithmic Algebras [in Ukrainian], IZMN, Kyiv (1997).

    Google Scholar 

  3. S. V. Surzhko, “Mechanisms of control over computations,” in: Sb. Trudov Vologod. Politekh.. Inst., Vol. I (1998), pp. 65–68.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 173–181, January–February, 2000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Surzhko, S.V., Yushchenko, E.L. Programs with restoration of computations. Cybern Syst Anal 36, 141–147 (2000). https://doi.org/10.1007/BF02733310

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02733310

Keywords

Navigation