Doesn't the unsolvability of the busy beaver problem imply there will always be specific cases in which compression is possible but where you can't tell that it's possible until you figure out how to do it, and that there's no algorithm for that ? ( This of course relies on the Church & ndash; Turing thesis and might cease to apply if radically new concepts of " algorithm " were discovered . ) talk ) 19 : 36, 13 March 2010 ( UTC)
