Advertisement

Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

Degree of undecidability of the completeness problem in algebras of recursive functions

  • 33 Accesses

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

Literature cited

  1. 1.

    A. P. Ershov and A. A. Lyapunov, “On formalization of the program notion,” Kibernetika, No. 5, 40–57 (1967).

  2. 2.

    Kh. Kh. Nasibullov, “On bases in algebras of partial recursive functions,” Algebra Logika,7, No. 4, 87–105 (1968).

  3. 3.

    V. D. Solov'ev, “The structure of closed classes of computable functions and predicates,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 12, 51–56 (1982).

  4. 4.

    D. A. Zakharov, Recursive Functions [in Russian], Novosibirsk State Univ. (1970).

  5. 5.

    A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).

  6. 6.

    A. I. Mal'tsev, “Constructive algebras,” Usp. Mat. Nauk,16, No. 3, 3–60 (1961).

  7. 7.

    V. M. Glushkov, “Theory of automata and formal transformations of microprograms,” Kibernetika, No. 5, 1–9 (1965).

  8. 8.

    H. Rogers, Theory of Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1972).

  9. 9.

    Yu. V. Golunkov, “To the theory of systems of algorithmic algebras,” Dokl. Akad. Nauk SSSR,232, No. 4, 749–752 (1977).

  10. 10.

    N. Cutland, Computability, Introduction into Theory of Recursive Functions [Russian translation], Mir, Moscow (1983).

  11. 11.

    E. A. Polyakov, “Algebras of recursive functions,” Algebra Logika,3, No. 1, 41–56 (1964).

Download references

Author information

Additional information

Translated from Matematicheskie Zametki, Vol. 44, No. 5, pp. 620–627, November 1988.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Golunkov, Y.V. Degree of undecidability of the completeness problem in algebras of recursive functions. Mathematical Notes of the Academy of Sciences of the USSR 44, 819–823 (1988). https://doi.org/10.1007/BF01158421

Download citation

Keywords

  • Recursive Function
  • Completeness Problem