p95

When compressible

Notice that at least there are two different cases in which we can compress a sequence significantly. One is, as in the trivial example above, the case with `simple’ or `syntactic’ regularity or rule in the sequence. The other case is, as \pi, in which the sequence can be compressed because of its `semantic’ content.