Exact complexity of the logistic map (Q1357844)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact complexity of the logistic map |
scientific article; zbMATH DE number 1022950
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact complexity of the logistic map |
scientific article; zbMATH DE number 1022950 |
Statements
Exact complexity of the logistic map (English)
0 references
8 December 1997
0 references
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.
0 references
binary strings
0 references
