| Display title | Lempel-Ziv complexity |
| Default sort key | Lempel-Ziv complexity |
| Page length (in bytes) | 9,764 |
| Namespace ID | 0 |
| Page ID | 184067 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>WikiEd2 |
| Date of page creation | 10:07, 10 May 2022 |
| Latest editor | imported>WikiEd2 |
| Date of latest edit | 10:07, 10 May 2022 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | The Lempel-Ziv complexity is a measure that was first presented in the article On the Complexity of Finite Sequences (IEEE Trans. On IT-22,1 1976), by two Israeli computer scientists, Abraham Lempel and Jacob Ziv. This complexity measure is related to Kolmogorov complexity, but the only function it uses... |
