Author:
Gill John T.,Morris Paul H.
Abstract
AbstractSubcreative sets, introduced by Blum, are known to coincide with the effectively speedable sets. Subcreative sets are shown to be the complete sets with respect to S-reducibility, a special case of Turing reducibility. Thus a set is effectively speedable exactly when it contains the solution to the halting problem in an easily decodable form. Several characterizations of subcreative sets are given, including the solution of an open problem of Blum, and are used to locate the subcreative sets with respect to the complete sets of other reducibilities. It is shown that q-cylindrification is an order-preserving map from the r.e. T-degrees to the r.e. S-degrees. Consequently, T-complete sets are precisely the r.e. sets whose q-cylindrifications are S-complete.
Publisher
Cambridge University Press (CUP)
Reference11 articles.
1. A Machine-Independent Theory of the Complexity of Recursive Functions
2. Morris P. H. , Complexity theoretic properties of recursively enumerable sets, Ph.D. Dissertation, University of California, Irvine, 1974.
3. Gill J. T. III , Probabilistic Turing machines and complexity of computation, Ph.D. Dissertation, University of California, Berkeley; 1972.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On bQ1$bQ_1$‐degrees of c.e. sets;Mathematical Logic Quarterly;2023-11-20
2. $$sQ_1$$-degrees of computably enumerable sets;Archive for Mathematical Logic;2022-09-16
3. r
‐Maximal sets and Q1,N‐reducibility;Mathematical Logic Quarterly;2021-05
4. Some structural properties of quasi-degrees;Logic Journal of the IGPL;2017-12-11
5. Hyperhypersimple sets and Q1
-reducibility;Mathematical Logic Quarterly;2016-12