Great link! I've read about a lot of this stuff in text books etc, but it all fits together so much better when put in its proper historical context like that. If I understand it correctly, his main result in algorithmic complexity theory implies that it is impossible to prove the absence of a pattern in data. Does this thus imply that there is no way for us to know when we know everything?