the algorithmic complexity of information in digital form, whether mp3 file, jpg, genome or txt string, is measured in bits and is proportional to the size of the shortest program that can generate it. that def has been relativized to allow for information present at input, i.e. object passed to the programs. the i/o here are not objects but object templates. 'algorithmic complexity' or Kolmogorov, or Kolmogorov-Chaitin complexity is unfortunately not computable: there is no algorithms that can find or guarantee the shortest program to transform input to output.. . there is another pragmatic issue half hidden here that calls into question whether programs are indeed getting shorter as you read down the page. first to spot it and describe it, $100. a@u*. / posted to comp.soft-sys.math.mathematica 2001