This holiday season, spark a lifelong love of learning. Gift Brilliant Premium

When the WinRAR trial ends

A string xx is cc-incompressible if

K(x)xcK(x) \geq |x| - c

for some constant c,c, where K()K(\text{}\cdot) stands for Kolmogorov complexity.

In the language Σ\Sigma^* where Σ={0,1}\Sigma = \{ 0, 1 \} , what is the minimum possible number of strings of length 88 that are 3-incompressible?


Problem Loading...

Note Loading...

Set Loading...