Characterising the Martin-Lof random sequences using computably enumerable sets of measure one
A sequence omega is Martin-Lof random if and only if it appears early in every Lebesgue measure one set of computably enumerable intervals. (C) 2004 Elsevier B.V. All rights reserved.
martin-lof random kolmogorov complexity compressibility coefficient probability law computational complexity