Define the tower function T N-N by the recursion T(0)-1, that there are infinitely many strings z E (0,1). that ne extremely compressible in the sense that (That is, there are infinitely many strings x which are so compressible that even T(C(x)) is less than the length of x.) Define the tower function T N-N by the recursion T(0)-1, that there are infinitely many strings z E (0,1). that ne extremely compressible in the sense that (That is, there are infinitely many strings x which are so compressible that even T(C(x)) is less than the length of x.)