caa a22 4500 475741021 CHVBK 20180406123459.0 cr unu---uuuuu 170329e20001001xx s 000 0 eng 10.1007/BF02676727 doi (NATIONALLICENCE)springer-10.1007/BF02676727 Omanadze R. I. A. Dzhavakhishvili Tbilisi State University I. N Vekua Institute For Applied Mathematics, USSR aut Complexity properties of recursively enumerable sets and bsQ -completeness [Elektronische Daten] [R. Omanadze] The notions of boundedly strongly effectively speedable set and boundedly effectively speedable set are introduced. It is proved that the notions of boundedly strongly effectively speedable set, boundedly effectively speedable set, creative set, andbsQ-complete recursively enumerable set are equivalent. Kluwer Academic/Plenum Publishers, 2000 effectively speedable set nationallicence creative set nationallicence reducibility nationallicence degrees of sets nationallicence recursively enumerable set nationallicence general recursive function nationallicence Blum axioms nationallicence Mathematical Notes Kluwer Academic Publishers-Plenum Publishers 68/4(2000-10-01), 476-480 0001-4346 68:4<476 2000 68 11006 https://doi.org/10.1007/BF02676727 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02676727 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Omanadze R. I. A. Dzhavakhishvili Tbilisi State University I. N Vekua Institute For Applied Mathematics, USSR aut NATIONALLICENCE 773 0- Mathematical Notes Kluwer Academic Publishers-Plenum Publishers 68/4(2000-10-01), 476-480 0001-4346 68:4<476 2000 68 11006 Metadata rights reserved Springer special CC-BY-NC licence nationallicence SWISSBIB 475741021 BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer