Define the tower function T: NN by the recursion: T(0) = 1, T(n+1)=2(n). Thus T(n) is...

 

Transcribed Image Text:

Define the tower function T: NN by the recursion: T(0) = 1, T(n+1)=2(n). Thus T(n) is a "tower" of n 2's. Prove that there are infinitely many strings x = {0,1}* that are extremely compressible in the sense that T(C(x)) Define the tower function T: NN by the recursion: T(0) = 1, T(n+1)=2(n). Thus T(n) is a "tower" of n 2's. Prove that there are infinitely many strings x = {0,1}* that are extremely compressible in the sense that T(C(x))