Skip to main content
SpringerLink
Log in

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

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature cited

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

    Google Scholar 

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

    Google Scholar 

  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).

    Google Scholar 

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

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V. I. Ul'yanov-Lenin Kazan State University, USSR

    Yu. V. Golunkov

Authors
  1. Yu. V. Golunkov
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation