Talk:Lempel–Ziv complexity
 | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
| ||||||||||||||||||
[Untitled]
[edit]Hi, which language is used for the code sample? It's definitely not Pascal, as it is stated in the syntax highlighter. Also, assignments and comparisons use the same operator. By the way, I wonder if the block scheme published by Kaspar and Schuster paper might be of use. See Fig. 1 in Kaspar Schuster, Easily calculable measure for the complexity of spatiotemporal patterns, Phys. Rev. A, 1987, vol 36(2) 842-848 : [1] 131.227.23.35 (talk) 10:30, 27 April 2018 (UTC)
Hi. It's not Pascal, but it's pseudocode, and I think Pascal was used as an easy way to highlight it correctly. I changed the mistake of using := for comparison, thanks! Don't know about the book, but it's a good suggestion. Could you do the change, and include it as a reference? I'm afraid we can't use the figure as it's copyrighted, but linking to the book is possible. -- Naereen — Preceding unsigned comment added by Naereen (talk • contribs) 12:01, 27 April 2018 (UTC)