-
Notifications
You must be signed in to change notification settings - Fork 1
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Universality of chaos as both problem and opportunity #31
Comments
Leon Chua strikes again. I hope this turns out to be as relevant as my first impression indicates. Having skimmed the proof of the local activity theorem in this book, I can say that these results apply to systems of coupled cells, each with internal state and connections to other cells (ports). A cell is locally active iff when some port absorbs energy, another port emits more energy (a transistor is an example). A homogeneous lattice of cells with one locally active cell can exhibit globally chaotic behavior. When such behavior is neither periodic nor chaotic, it is active at the edge of chaos. This corresponds to the type of rule 110 one-dimensional cellular automaton that is proved capable of universal computation. Although the local activity theorem is a valid proof as far as I can see, I don't see that it quantitatively defines the edge of chaos, and in fact such a definition may not exist, and whether a dynamical system lies at the edge of chaos may be undecidable in general. A useful program running in such an array would have to halt with a useful output, and such programs would be included in any concept of the edge of chaos, so what I conjectured must be the case. A program that did not halt would be either chaotic or periodic. |
Chua goes on (making me a bit nervous) [here](Chua, L.O. Memristors on ‘edge of chaos’. Nat Rev Electr Eng 1, 614–627 (2024). https://doi.org/10.1038/s44287-024-00082-1):
I feel that here Chua is grandiose. However, his contribution of the memristor is an undeniable major result. It's the final phrase of this quotation that interests me. |
I think my question is becoming a little bit clearer -- not the answer, but the question, which is actually more important than the answer. The question is, given that a system is universal, or at least has musically interesting aspects, what makes it not only intelligibly but also efficiently explorable? My original Mandelbrot set model is intelligibly explorable, but it is not efficiently explorable. |
I have proved that iterated function systems are effectively compositionally universal.
The are two problems: the parameter space is too big to efficiently use, and the compositions are distributed in way that is not musically intuitive, but rather is determined by the period doubling and consequent universality in the underlying chaotic dynamical systems (the elements of the Hutchinson operator in the IFS, which has a fixed point due to its contractivity).
These same problems apply as well to simpler dynamical systems used to generate pieces as time series of notes or chords.
I'm not sure my thinking is coherent here, but I have to come up with something, the compositional universality is obviously there, and is too valuable to let go.
Filtering?
Windowing?
The text was updated successfully, but these errors were encountered: