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' is problematic because it's difficult to find the shortest program. a side issue that crops up with APIs and libraries is that programs call other programs hierarchically, e.g. StringJoin, so their totality must be considered / posted to comp.soft-sys.math.mathematica 2001