Definitions Let $K(\cdot)$ denote the Komogorov complexity. $2^{<\omega}$ is the set of all binary strings of finite length. $\log$ is the logarithm with base $2$.
For $\sigma\in 2^{<\omega}$, an $(n,c)$-cover of $\sigma$ is a finite set of strings $A_\sigma$ such that