Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Algebraic simulation of mathematical machines

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

Literature Cited

  1. 1.

    A. A. Lyapunov, “Algebraic treatment of programming,” in: Prolemy Kibernetiki, No. 8, Nauka, Moscow (1962).

  2. 2.

    N. I. Glebov, “Algebraic equivalence of category subsets,” in: Problemy Kibernetiki, No. 8, Moscow (1962).

  3. 3.

    N. I. Glebov, “Operator synthesis,” in: Problemy Kibernetiki, No. 8, Nauka, Moscow (1962).

  4. 4.

    N. I. Glebov, “Structure of classes of R-criteria of equivalence,” in: Problemy Kibernetiki, No. 9, Nauka, Moscow (1963).

  5. 5.

    W. D. Maurer, “A Theory of Computer Instructions,” Journal of the ACM,13, No. 2 (1966).

  6. 6.

    E. S. Lyapin, Semigroups [in Russian], Fizmatgiz, Moscow (1960).

Download references

Additional information

Translated from Kibernetika, No. 5, pp. 32–36, September–October, 1970.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Lifshits, V.N., Rozenknop, V.D. Algebraic simulation of mathematical machines. Cybern Syst Anal 6, 569–574 (1970). https://doi.org/10.1007/BF01072803

Download citation

Keywords

  • Operating System
  • Artificial Intelligence
  • System Theory
  • Mathematical Machine