Assertion: gambling game's outcome | /r/CapableOf | swamp constant
Facets:
Source sentences:
text: But any outcome sequence of 1000 tosses which contains more than 700 heads will be compressible (long runs of heads are common enough to be exploited by an efficient coding algorithm, and 1000 outcomes is long enough to swamp the constants involved in defining the universal prefix-free Kolmogorov complexity).