When the WinRAR trial ends

A string \(x\) is \(c\)-incompressibleif

\[K(x) \geq |x| - c \]

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

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