Exact complexity of the logistic map (Q1357844)

The authors consider a particular measure of complexity of binary strings due to \textit{A. Lempel} and \textit{J. Ziv}. For a unimodal map, the set of strings is the itineraries of all points with respect to the partition by 1/2. The Lempel-Ziv complexity of this set is clearly a topological invariant. Its value is calculated for the full chaos map. A natural conjecture is that the invariant is equivalent to topological entropy.