Author:
Franklin Johanna N. Y.,Greenberg Noam,Stephan Frank,Wu Guohua
Abstract
AbstractIn contrast with the notion of complexity, a set A is called anti-complex if the Kolmogorov complexity of the initial segments of A chosen by a recursive function is always bounded by the identity function. We show that, as for complexity, the natural arena for examining anti-complexity is the weak-truth table degrees. In this context, we show the equivalence of anti-complexity and other lowness notions such as r.e. traceability or being weak truth-table reducible to a Schnorr trivial set. A set A is anti-complex if and only if it is reducible to another set B with tiny use, whereby we mean that the use function for reducing A to B can be made to grow arbitrarily slowly, as gauged by unbounded nondecreasing recursive functions. This notion of reducibility is then studied in its own right, and we also investigate its range and the range of its uniform counterpart.
Publisher
Cambridge University Press (CUP)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Reductions between types of numberings;Annals of Pure and Applied Logic;2019-12
2. STRONG JUMP-TRACEABILITY;The Bulletin of Symbolic Logic;2018-06
3. A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES;The Bulletin of Symbolic Logic;2018-03
4. Kobayashi compressibility;Theoretical Computer Science;2017-05
5. Randomness for computable measures and initial segment complexity;Annals of Pure and Applied Logic;2017-04