Every sequence is reducible to a random one
Information and Control
Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
Journal of Computer and System Sciences
Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
An Introduction to Kolmogorov Complexity and Its Applications
An Introduction to Kolmogorov Complexity and Its Applications
Computability and Randomness
Process complexity and effective random tests
Journal of Computer and System Sciences
Presentations of K-trivial reals and kolmogorov complexity
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Reconciling data compression and kolmogorov complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
Schnorr famously proved that Martin-Lof-randomness of a sequence A can be characterised via the complexity of A@?s initial segments. Nies, Stephan and Terwijn as well as independently Miller showed that a set is 2-random (that is, Martin-Lof random relative to the halting problem K) iff there is no function f such that for all m and all nf(m) it holds that C(A(0)A(1)...A(n))=f(m) it holds that C(A(0)A(1)...A(n))=