Abstract
The notions of effectively subcreative set and strongly effectively acceleratable set are introduced. It is proved that the notions of effectively subcreative set, strongly effectively acceleratable set, andsQ-complete recursively enumerable set are equivalent.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Blum and I. Marques, “Complexity properties of recursively enumerable sets,”J. Symbolic Logic,38, No. 4, 579–593 (1973).
J. T. Gill and P. H. Morris, “On subcreative sets ands-reducibility,”J. Symbolic Logic,39, No. 4, 669–677 (1974).
H. Rogers,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York-St Louis-San Francisco-Toronto-London-Sydney (1967).
M. Blum, “A machine-independent theory of the complexity of recursive functions,”J. Assoc. Comput. Mach.,14, 322–336 (1967).
R. Sh. Omanadze, “Complexity properties of recursively enumerable sets andsQ-complete sets,”Soobshch. Akad. Nauk Gruzii,146 No. 1, 9–12 (1992).
R. M. Friedberg and H. Rogers, “Reducibility and completeness for sets of integers,”Z. Math. Logik Grundlag. Math.,5, 117–125 (1959).
V. K. Bulitko, “On methods for the characterization of complete, sets,”Izv. Akad. Nauk SSSR Ser. Mat. [Math. USSR-Izv.],55, No. 2, 227–253 (1991).
Author information
Authors and Affiliations
Additional information
Translated fromMatematicheskie Zametki, Vol. 62, No. 3, pp. 425–429, September, 1997.
Translated by V. N. Dubrovsky
Rights and permissions
About this article
Cite this article
Omanadze, R.S. Complexity properties of recursively enumerable sets andsQ-completeness. Math Notes 62, 356–359 (1997). https://doi.org/10.1007/BF02360877
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02360877