Literature cited
P. R. Young, “Toward a theory of enumerations,” J. Assoc. Comput. Mach.,16, 328–348 (1969).
P. R. Young, “Speed-ups by changing the order in which sets are enumerated,” Math. Systems Theory,5, 148–156 (1971).
L. A. Levin, “Step-counting functions of computable functions,” Supplement 1, in: Complexity of Computations and Algorithms [in Russian], Mir, Moscow (1974), pp. 174–185.
H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
B. A. Trakhtenbrot, Complexity of Algorithms and Computations [in Russian], Novosibirsk State Univ. (1967).
M. Blum and I. Marques, “On complexity properties of recursively enumerable sets,” J. Symbolic Logic,38, No. 4, 579–593 (1973).
I. Marques, “On degrees of unsolvability and complexity properties,” J. Symbolic Logic,40, No. 4, 529–540 (1975).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 30, No. 3, pp. 397–406, September, 1981.
Rights and permissions
About this article
Cite this article
Barashko, A.S. Infimums of step-counting functions of enumeration of sets. Mathematical Notes of the Academy of Sciences of the USSR 30, 690–695 (1981). https://doi.org/10.1007/BF01141626
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01141626