  That such sequences aren’t random can be seen by using both Martin-Löf- and Kolmogorov-style considerations. In the latter case, as we have already seen, a biased sequence will be more compressible than an unbiased sequence, if the sequence is long enough, because an efficient coding will exploit the fact that biased sequences will typically have longer subsequences of consecutive digits, and hence will not be random. In the former case, a biased sequence will violate at least one measure one property, on the standard Lebesgue measure on infinite binary sequences—in particular, a measure one  subset of the Cantor space will be Borel normal  (§2.1),  but no biased sequence is Borel normal. So on the standard account of randomness, no sequences of outcomes of a biased chance process are random, but of course these outcomes happened by chance.