Skip to main content
SpringerLink
Log in

Hierarchy of limiting computations

  • Published:
Siberian Mathematical Journal 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, “On a certain hierarchy of sets. I,” Algebra Logika,7, No. 1, 47–53 (1968).

    Google Scholar 

  2. Yu. L. Ershov, “On a certain hierarchy of sets. II,” Algebra Logika,7, No. 4, 15–47 (1968).

    Google Scholar 

  3. R. L. Epstein, R. Haas, and R. L. Kramer, “Hierarchies of sets and degrees below O,” Lect. Notes Math., No. 859, Springer-Verlag, Berlin-Heidelberg-New York (1981).

    Google Scholar 

  4. Yu. L. Ershov, The Theory of Numeration [in Russian], Nauka, Moscow (1977).

    Google Scholar 

  5. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York-Toronto-London (1967).

    Google Scholar 

Download references

Authors
  1. V. L. Selivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kazan. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 25, No. 5, pp. 146–156, September–October, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Selivanov, V.L. Hierarchy of limiting computations. Sib Math J 25, 798–806 (1984). https://doi.org/10.1007/BF00968696

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation