COMPLEXITY OF HIERARCHICALLY ORGANIZED SYSTEMS AND THE STRUCTURE OF MUSICAL EXPERIENCES
- 1 January 1977
- journal article
- research article
- Published by Taylor & Francis in International Journal of General Systems
- Vol. 3 (4) , 233-251
- https://doi.org/10.1080/03081077708934769
Abstract
Many systems can be described much more simply with a hierarchical organization than without: if an identifiable subsystem occurs several times, it is easier to name it and then refer to its instances by name, rather than to repeat their description. This means appropriate measures of hierarchical complexity will have smaller values than corresponding linear measures. A key point for music, as well as many other applications, is to use a measure of complexity—that is, of information—in the general style of Kolmogorov, rather than the more restrictive type of statistical measure in the style of Shannon; this permits a more successful account of musical form and regularity. However, we find it more convenient to use general systems (here hierarchically structured) as a basis, than to use Turing machines as Kolmogorov did, or some other automata “Hearing” a piece of music is a cognitive as well as a physiological process, and what is.“heard.” depends on the conceptual systems which the listener brings to bear on his incoming perceptual stream. This paper presents the view that an understanding of a piece of music is a hierarchical analysis of it into simpler components, eventually into.“already understood.” basic subsystems. It follows that some aesthetic properties of the piece should be reflected in complexity measures of the analysis. The sequential character of music suggests a.“conditional.” complexity (of what is heard now given what preceded) may be useful in considering frustration and fulfillment of expectations, for example. Our approach is able to cope with indeterminacy in systems, in the forms of: multiple possibilities, any one of which is acceptable (non-determinism); robust vague instructions, interpreted appropriately at execution time (fuzziness); as well as (the more traditional) randomness.Keywords
This publication has 9 references indexed in Scilit:
- ON FUZZY ROBOT PLANNING**Research supported by NSF Contract GK-42112 while the author was at UCLA, and also at Naropa Institute and the University of Colorado, each in Boulder, Colorado.Published by Elsevier ,1975
- Concept representation in natural and artificial languages: Axioms, extensions and applications for fuzzy setsInternational Journal of Man-Machine Studies, 1974
- Outline of a New Approach to the Analysis of Complex Systems and Decision ProcessesIEEE Transactions on Systems, Man, and Cybernetics, 1973
- The logic of inexact conceptsSynthese, 1969
- Logical basis for information theory and probability theoryIEEE Transactions on Information Theory, 1968
- L-fuzzy setsJournal of Mathematical Analysis and Applications, 1967
- Fuzzy setsInformation and Control, 1965
- A formal theory of inductive inference. Part IInformation and Control, 1964
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948