[Baartse, Martijn] Tech Univ Cottbus, Inst Comp Sci, D-03046 Cottbus, Germany. [Barmpalias, George] Chinese Acad Sci, State Key Lab Comp Sci, Inst Software, Beijing 100190, Peoples R China.
Abstract:
An infinite sequence X is said to have trivial (prefix-free) initial segment complexity if the prefix-free Kolmogorov complexity of each initial segment of X is the same as the complexity of the sequence of 0s of the same length, up to a constant. We study the gap between the minimum complexity K(0(n)) and the initial segment complexity of a nontrivial sequence, and in particular the nondecreasing unbounded functions f such that K(X (sic)(n)) <= K (0(n)) + f (n) + c for a constant c and all n (*) for a nontrivial sequence X, where K denotes the prefix-free complexity. Our first result is that there exists a Delta(0)(3) unbounded nondecreasing function f which does not have this property. It is known that such functions cannot be Delta(0)(2) hence this is an optimal bound on their arithmetical complexity. Moreover it improves the bound Delta(0)(4) that was known from Csima and Montalban (Proc. Amer. Math. Soc. 134(5): 1499-1502, 2006). Our second result is that if f is Delta(0)(2) then there exists a non-empty Pi(0)(1) class of reals X with nontrivial prefix-free complexity which satisfy (*). This implies that in this case there uncountably many nontrivial reals X satisfying (*) in various well known classes from computability theory and algorithmic randomness; for example low for Omega, non-low for Omega and computably dominated reals. A special case of this result was independently obtained by Bienvenu, Merkle and Nies (STACS, pp. 452-463, 2011).
English Abstract:
An infinite sequence X is said to have trivial (prefix-free) initial segment complexity if the prefix-free Kolmogorov complexity of each initial segment of X is the same as the complexity of the sequence of 0s of the same length, up to a constant. We study the gap between the minimum complexity K(0(n)) and the initial segment complexity of a nontrivial sequence, and in particular the nondecreasing unbounded functions f such that K(X (sic)(n)) <= K (0(n)) + f (n) + c for a constant c and all n (*) for a nontrivial sequence X, where K denotes the prefix-free complexity. Our first result is that there exists a Delta(0)(3) unbounded nondecreasing function f which does not have this property. It is known that such functions cannot be Delta(0)(2) hence this is an optimal bound on their arithmetical complexity. Moreover it improves the bound Delta(0)(4) that was known from Csima and Montalban (Proc. Amer. Math. Soc. 134(5): 1499-1502, 2006). Our second result is that if f is Delta(0)(2) then there exists a non-empty Pi(0)(1) class of reals X with nontrivial prefix-free complexity which satisfy (*). This implies that in this case there uncountably many nontrivial reals X satisfying (*) in various well known classes from computability theory and algorithmic randomness; for example low for Omega, non-low for Omega and computably dominated reals. A special case of this result was independently obtained by Bienvenu, Merkle and Nies (STACS, pp. 452-463, 2011).
Baartse, Martijn,Barmpalias, George. On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity[J]. THEORY OF COMPUTING SYSTEMS,2013-01-01,52(1):28-47.
