Limit complexities revisited

Details Limit complexities revisited Limit complexities revisited

2008-02-20

arxiv.org/abs/0802.2833v1

Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (

Computer Science

Computational Complexity

Scientific paper

The main goal of this paper is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result from (Vereshchagin, 2002) saying that $\limsup_n\KS(x|n)$ (here $\KS(x|n)$ is conditional (plain) Kolmogorov complexity of $x$ when $n$ is known) equals $\KS^{\mathbf{0'}(x)$, the plain Kolmogorov complexity with $\mathbf{0'$-oracle. Then we use the same argument to prove similar results for prefix complexity (and also improve results of (Muchnik, 1987) about limit frequencies), a priori probability on binary tree and measure of effectively open sets. As a by-product, we get a criterion of $\mathbf{0'}$ Martin-L\"of randomness (called also 2-randomness) proved in (Miller, 2004): a sequence $\omega$ is 2-random if and only if there exists $c$ such that any prefix $x$ of $\omega$ is a prefix of some string $y$ such that $\KS(y)\ge |y|-c$. (In the 1960ies this property was suggested in (Kolmogorov, 1968) as one of possible randomness definitions; its equivalence to 2-randomness was shown in (Miller, 2004) while proving another 2-randomness criterion (see also (Nies et al. 2005)): $\omega$ is 2-random if and only if $\KS(x)\ge |x|-c$ for some $c$ and infinitely many prefixes $x$ of $\omega$. Finally, we show that the low-basis theorem can be used to get alternative proofs for these results and to improve the result about effectively open sets; this stronger version implies the 2-randomness criterion mentioned in the previous sentence.

Affiliated with

Also associated with

No associations

Rating

Limit complexities revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Limit complexities revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limit complexities revisited will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-647776