Results 1 
3 of
3
The Dimensions of Individual Strings and Sequences
 INFORMATION AND COMPUTATION
, 2003
"... A constructive version of Hausdorff dimension is developed using constructive supergales, which are betting strategies that generalize the constructive supermartingales used in the theory of individual random sequences. This constructive dimension is used to assign every individual (infinite, binary ..."
Abstract

Cited by 100 (11 self)
 Add to MetaCart
(Show Context)
A constructive version of Hausdorff dimension is developed using constructive supergales, which are betting strategies that generalize the constructive supermartingales used in the theory of individual random sequences. This constructive dimension is used to assign every individual (infinite, binary) sequence S a dimension, which is a real number dim(S) in the interval [0, 1]. Sequences that
Randomness, relativization, and Turing degrees
 J. Symbolic Logic
, 2005
"... We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is nrandom if it is MartinLof random relative to . We show that a set is 2random if and only if there is a constant c such that infinitely many initial segments x of the set are cincompre ..."
Abstract

Cited by 63 (23 self)
 Add to MetaCart
(Show Context)
We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is nrandom if it is MartinLof random relative to . We show that a set is 2random if and only if there is a constant c such that infinitely many initial segments x of the set are cincompressible: C(x) c. The `only if' direction was obtained independently by Joseph Miller. This characterization can be extended to the case of timebounded Ccomplexity.
Gales and the Dimensions of Individual Strings and Sequences
"... A constructive version of Hausdorff dimension is developed using constructive gales, which are betting strategies that generalize the constructive martingales used in the theory of individual random sequences. This constructive dimension is used to assign every individual (infinite, binary) sequence ..."
Abstract
 Add to MetaCart
(Show Context)
A constructive version of Hausdorff dimension is developed using constructive gales, which are betting strategies that generalize the constructive martingales used in the theory of individual random sequences. This constructive dimension is used to assign every individual (infinite, binary) sequence S a dimension, which is a real number dim(S) in the interval [0; 1]. Sequences that are random (in the sense of MartinLöf) have dimension 1, while sequences that are decidable, 0 1 , or 0 1 have dimension 0. It is shown that for every 0 2 computable real number in [0,1] there is a 0 2 sequence S such that dim(S) = : A discrete version of constructive dimension is also developed using termgales, which are galelike functions that bet on the terminations of (finite, binary) strings as well as on their successive bits. This discrete dimension is used to assign each individual string w a dimension, which is a nonnegative real number dim(w). The dimension of a sequence is shown to be the limit in mum of the dimensions of its prefixes. The Kolmogorov complexity of a string is proven to be the product of its length and its dimension. This gives a new characterization of algorithmic information and a new proof of Mayordomo's recent theorem stating that the dimension of a sequence is the limit in mum of the average Kolmogorov complexity of its first n bits. Every sequence that is random relative to any computable sequence of cointoss biases that converge to a real number in (0; 1) is shown to have dimension H( ), the binary entropy of .