One good definition is that ofalgorithmic incompressibility: a sequence of bits is incompressible if the size S(n) of the shortest computer program (Turing machine) which produces the first n bits satisfies S(n)/n -> 1: that is, you cannot write a shorter program than one which simply copies the bits from a file.