nd 1, and two exponents of two, its algorithmic complexity is equal to, AC = 3 + 2 x log(2) = 4.38. 110 HOUSE_OVERSIGHT_013610 In addition to H7, Hy and AC, if computable in a meaningful way, the deviation of the binary series under study from the idealized random behavior of a fair coin could serve as a