Ah, hate I missed this at the time of comment (got on a flight right after I posted and forgot to check back :/). What you're describing (moving complexity int

Ah, hate I missed this at the time of comment (got on a flight right after I posted and forgot to check back :/). What you're describing (moving complexity into the algorithm) _is_ an increase in Komogorov Complexity, though... so I think we're saying the same thing? i.e. Kolmogorov complexity K(x|y) (x, given y) is the length of the shortest program that on input y, outputs x. So, when you say "move complexity into the algorithm", this is an increase the length of the shortest program that given input <data to compress> outputs <compressed data>. Or have I missed or misunderstood your point?