3 problems

Hilberg's conjecture. The mutual information between two adjacent blocks of length $n$ satisfies

Let $n$ be the length of each of two adjacent blocks in a text, and let $\beta\in(0,1)$ be the exponent appearing in the relaxed Hilberg hypothesis. Let algorithmic mutual informat…

Let a block consist of $n$ characters drawn from a text in natural language, and let its entropy be measured in the information-theoretic sense. Hilberg's conjecture. The entropy o…