plexity, which quantifies a computer algorithm’s minimal representation of a symbol sequence as it grows longer (Chaitin, 1974; Bennett, C.H., 1982; Nicolis, 1986; Rissanen, 1982; Crutchfield and Young, 1989b). Examples of applications of a pseudocomputational compression scheme have quantified difference