2 problems

For a binary output string, a change is an occurrence in which a $1$ is followed by a $0$, or a $0$ is followed by a $1$. Consider outputs with the same informational complexity an…

The rank plots display the ranks and probabilities of outputs of fixed complexity for several maps. A Zipf's law here means a power-law upper bound on the decay of probability with…