This is a preview of subscription content, log in via an institution to check access.
References
M. S. Burgin and Yu. M. Borodyanskii, “Infinite processes and superrecursive algorithms”, Dokl. Akad. Nauk SSSR321, No. 5, 874–879 (1991).
Yu. M. Borodyanskii and M. S. Burgin, “Alphabet operators and algorithms”, Kibern. Sistemnyi Analiz, No. 3, 42–57 (1993).
V. M. Glushkov, “Automata theory and formal transformation of microprograms”, Kibernetika, No. 5, 1–9 (1965).
M. S. Burgin, “Inductive Turing machines”, Dokl. Akad. Nauk SSSR.,270, No. 65, 1289–1293 (1983).
M. S. Burgin, “Limit Turing machines”, Abstr. AMS,4, No. 4 (1983).
Yu. M. Borodyanskii, “Nonalgorithmic discrete procedures”, Kibern. Sistemnyi Analiz, No. 2, 3–12 (1992).
J. L. Kelley, General Topology, Van Nostrand, New York (1957).
H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
M. S. Burgin, Abstract Theory of Properties and Nonclassical Logics [in Russian], IF AN SSSR, Moscow (1985), pp. 109–118.
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 3–11, July–August, 1994.
Rights and permissions
About this article
Cite this article
Burgin, M.S., Borodyanskii, Y.M. Operations and compositions in transrecursive operators. Cybern Syst Anal 30, 473–478 (1994). https://doi.org/10.1007/BF02366556
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02366556