Fast Computation of the Arnold Complexity of Length $2^{n}$ Binary Words
Yuri V. Merekin
TL;DR
This paper presents a method for quickly computing the Arnold complexity of binary words of length 2^n, providing an upper bound for the Shannon function related to this complexity measure.
Contribution
It introduces a novel approach for fast computation of Arnold complexity and establishes an upper bound for the Shannon function for binary words of length 2^n.
Findings
Derived an upper bound for the Shannon function $Sh(n)$
Developed a method for rapid computation of Arnold complexity
Enhanced understanding of complexity measures for binary words
Abstract
For fast computation of the Arnold complexity of length binary words we obtain an upper bound for the Shannon function
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · semigroups and automata theory · DNA and Biological Computing