The Kolmogorov complexity of one bad thing repeated N times grows like log(N)
I’ll repeat my other comment. log(N) is an upper bound for the complexity of N, but complexity of N can be much smaller. Complexity of 3^^^3 is tiny compared to log(3^^^3).
Ah shoot, I read this post, and then I read SewingMachine’s post, and then I realized my reply to this post was wrong.
I’ll repeat my other comment. log(N) is an upper bound for the complexity of N, but complexity of N can be much smaller. Complexity of 3^^^3 is tiny compared to log(3^^^3).
Oh, you totally got ninja’d.