The Complexity of Sequences Generated by the Arc-Fractal System by Hoai Nguyen Huynh, Andri Pradana, Lock Yue Chew.
Abstract:
We study properties of the symbolic sequences extracted from the fractals generated by the arc-fractal system introduced earlier by Huynh and Chew. The sequences consist of only a few symbols yet possess several nontrivial properties. First using an operator approach, we show that the sequences are not periodic, even though they are constructed from very simple rules. Second by employing the ϵ-machine approach developed by Crutchfield and Young, we measure the complexity and randomness of the sequences and show that they are indeed complex, i.e. neither periodic nor random, with the value of complexity measure being significant as compared to the known example of logistic map at the edge of chaos. The complexity and randomness of the sequences are then discussed in relation with the properties of associated fractal objects, such as their fractal dimension, symmetry and orientations of the arcs.
Very heavy sledding but I suspect worth the effort. Recalling the unexpected influence of fractals on computer science.
In any event, the mental exercise will do you good.
I first saw this in a tweet by Stefano Bertolo