Advertisement

Siberian Mathematical Journal

, Volume 30, Issue 6, pp 850–862 | Cite as

Iterated Kleene computability

  • N. V. Belyakin
Article
  • 22 Downloads

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    N. V. Belyakin, “Iterated Kleene computability and the superjump,” Mat. Sb.,101, No. 1, 21–43 (1976).Google Scholar
  2. 2.
    N. V. Belyakin, “One class of recursive hierarchies,” Algebra Logika,12, No. 1, 3–21 (1973).Google Scholar
  3. 3.
    H. Rogers, The Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).Google Scholar
  4. 4.
    S. C. Kleene, “Recursive functionals and quantifiers of finite types,” Trans. Am. Math. Soc.,91, 1–52 (1959).Google Scholar
  5. 5.
    E. G. Nikiforova, “One method of constructing enumerations,” in: Computational Systems, Math. Inst. Sib. Sect., Academy of Sciences of the USSR, Novosibirsk,107, 80–96 (1985).Google Scholar
  6. 6.
    E. G. Nikiforova, “Recursive hierarchies, regular by construction,” submitted to Sib. Mat. Zh. (May, 1986). Deposited at VINITI, 07.08.86, No. 5637-B86.Google Scholar
  7. 7.
    E. G. Nikiforova, “One method of regularizing iterative Kleene computability,” submitted to Sib. Mat. Zh. (May, 1988). Deposited at VINITI, 11.04.88, No. 2696-B88.Google Scholar
  8. 8.
    E. G. Nikiforova, “Some modifications of iterated Kleene computability,” Algebra Logika,25, No. 3, 292–314 (1986).Google Scholar
  9. 9.
    L. N. Pobedin, “Some questions of generalized computability,” Algebra Logika,12, No. 2, 220–231 (1973).Google Scholar

Copyright information

© Plenum Publishing Corporation 1990

Authors and Affiliations

  • N. V. Belyakin

There are no affiliations available

Personalised recommendations