If you regularly follow comments on this blog, you'll know that I've been

having a back-and-forth with a guy who doesn't know much about information

theory, and who's been using his ignorance to try to assemble arguments against the

Kolmogorov-Chaitin information-theoretic measure of information in a string.

In the course of doing that, I came up with what I think are some interesting ways

of explaining bits of it, so I thought I'd promote it to the top-level to share

with more readers.

To be absolutely clear up front: I'm *far* from an expert on K-C theory. It's something that I find incredibly fascinating, and I've read a lot of Chaitin's work. I've been fortunate enough to meet Greg Chaitin a bunch of times when we both worked at

IBM, and I've attended a bunch of his lectures. But this isn't my main area of expertise,

not by a long-shot.

If you don't know any K-C information theory, then you can look at my

introduction here. The rest is beneath the fold.