Kolmogorov complexity of initial segments of sequences and arithmetical definability
Theoretical Computer Science
Random semicomputable reals revisited
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
A K-trivial set which is not jump traceable at certain orders
Information Processing Letters
Randomness, computation and mathematics
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 0.00 |
A Solovay function is a computable upper bound g for prefix-free Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constant, on infinitely many places n. We obtain natural examples of Solovay functions by showing that for some constant c 0 and all computable functions t such that c 0 n ≤ t(n), the time-bounded version K t of K is a Solovay function.By unifying results of Bienvenu and Downey and of Miller, we show that a right-computable upper bound g of K is a Solovay function if and only if 驴 g is Martin-Löf random. Letting $\mathrm{\Omega}_g=\sum 2^{-g(n)}$, we obtain as a corollary that the Martin-Löf randomness of the various variants of Chaitin's 驴 extends to the time-bounded case in so far as $\mathrm{\Omega}_{K^t}$ is Martin-Löf random for any t as above.As a step in the direction of a characterization of K-triviality in terms of jump-traceability, we demonstrate that a set A is K-trivial if and only if A is Og(n) 驴 K(n)-jump traceable for all Solovay functions g, where the equivalence remains true when we restrict attention to functions g of the form K t , either for a single or all functions t as above.Finally, we investigate the plain Kolmogorov complexity C and its time-bounded variant C t of initial segments of computably enumerable sets. Our main theorem here is a dichotomy similar to Kummer's gap theorem and asserts that every high c.e. Turing degree contains a c.e. set B such that for any computable function t there is a constant c t 0 such that for all m it holds that C$^t(B\upharpoonright m) \geq c_t \cdot m$, whereas for any nonhigh c.e. set A there is a computable time bound t and a constant c such that for infinitely many m it holds that C$^t(A\upharpoonright m) \leq \log m + c$. By similar methods it can be shown that any high degree contains a set B such that C$^t(B\upharpoonright m) \geq^+ m/4$. The constructed sets B have low unbounded but high time-bounded Kolmogorov complexity, and accordingly we obtain an alternative proof of the result due to Juedes, Lathrop, and Lutz [JLL] that every high degree contains a strongly deep set.