All Questions

Kolmogorov Complexity (interpreted in terms of shortest program computing a string) and Shannon Entropy are quite similar. Since there is a quantum entropy is it reasonable to ask if there is quantum ...

Given a random variable $X$ distributed under some computable distribution $P$ we have, $$0 \le E[K(X)] - H(P) \le K(P)$$ Where $H(P)$ is the entropy of $P$. I tried using Hoeffding concentration ...