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 differences among protein

obability Theory. North-Holland. Amsterdam Rinzel, J. (1985) Excitation dynamics: insights from simplified membrane models. Fed. Proc. 44:2944-2946 Rissanen, J. (1982) Estimation of structure by minimum desciption length. Circuit Systems Signal Processing 1:395-396 Roelfsema, F., Pincus, S.M., Veldhuis,