Almost everywhere high nonuniform complexity
Journal of Computer and System Sciences
Correspondence Principles for Effective Dimensions
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Dimension in Complexity Classes
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
The dimensions of individual strings and sequences
Information and Computation
The dimensions of individual strings and sequences
Information and Computation
Constructive dimension equals Kolmogorov complexity
Information Processing Letters
The arithmetical complexity of dimension and randomness
ACM Transactions on Computational Logic (TOCL)
Constructive dimension equals Kolmogorov complexity
Information Processing Letters
Every sequence is decompressible from a random one
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
| Hi-index | 0.89 |
Supergales, generalizations of supermartingales, have been used by Lutz (2002) to define the constructive dimensions of individual binary sequences. Here it is shown that gales, the corresponding generalizations of martingales, can be equivalently used to define constructive dimension.