Cybernetics and Systems Analysis

, Volume 30, Issue 4, pp 473–478 | Cite as

Operations and compositions in transrecursive operators

  • M. S. Burgin
  • Yu. M. Borodyanskii
Cybernetics
  • 21 Downloads

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. S. Burgin and Yu. M. Borodyanskii, “Infinite processes and superrecursive algorithms”, Dokl. Akad. Nauk SSSR321, No. 5, 874–879 (1991).Google Scholar
  2. 2.
    Yu. M. Borodyanskii and M. S. Burgin, “Alphabet operators and algorithms”, Kibern. Sistemnyi Analiz, No. 3, 42–57 (1993).MathSciNetGoogle Scholar
  3. 3.
    V. M. Glushkov, “Automata theory and formal transformation of microprograms”, Kibernetika, No. 5, 1–9 (1965).MATHGoogle Scholar
  4. 4.
    M. S. Burgin, “Inductive Turing machines”, Dokl. Akad. Nauk SSSR.,270, No. 65, 1289–1293 (1983).MATHMathSciNetGoogle Scholar
  5. 5.
    M. S. Burgin, “Limit Turing machines”, Abstr. AMS,4, No. 4 (1983).Google Scholar
  6. 6.
    Yu. M. Borodyanskii, “Nonalgorithmic discrete procedures”, Kibern. Sistemnyi Analiz, No. 2, 3–12 (1992).MATHMathSciNetGoogle Scholar
  7. 7.
    J. L. Kelley, General Topology, Van Nostrand, New York (1957).Google Scholar
  8. 8.
    H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).Google Scholar
  9. 9.
    M. S. Burgin, Abstract Theory of Properties and Nonclassical Logics [in Russian], IF AN SSSR, Moscow (1985), pp. 109–118.Google Scholar

Copyright information

© Plenum Publishing Corporation 1995

Authors and Affiliations

  • M. S. Burgin
  • Yu. M. Borodyanskii

There are no affiliations available

Personalised recommendations