Skip to main content
SpringerLink
Log in

A universal partial recursive function

  • 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. Yu. L. Ershov, Theory of Enumeration [in Russian], Nauka, Moscow (1977).

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ivanovsk State University, USSR

    E. A. Polyakov

Authors
  1. E. A. Polyakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 49, No. 2, pp. 102–106, March–April, 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Polyakov, E.A. A universal partial recursive function. Mathematical Notes of the Academy of Sciences of the USSR 49, 186–189 (1991). https://doi.org/10.1007/BF01137550

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation