The goal of music analysis is to find the most satisfying explanations for musical works. It is proposed that this can best be achieved by attempting to write computer programs that are as short as possible and that generate representations that are as detailed as possible of the music to be explained. The theory of Kolmogorov complexity suggests that the length of such a program can be used as a measure of the complexity of the analysis that it represents. The analyst therefore needs a way to measure the length of a program so that this length reflects the quality of the analysis that the program represents. If such an effective measure of analysis quality can be found, it could be used in a system that automatically finds the optimal analysis for any passage of music. Measuring program length in terms of number of source-code characters is shown to be problematic and an expression is proposed that overcomes some but not all of these problems. It is suggested that the solutions to the remaining problems may lie either in the field of concrete Kolmogorov complexity or in the design of languages specialized for expressing musical structure.
|Status||Udgivet - 2012|
|Begivenhed||XIX Colloquio di Informatica Musicale - Conservatorio di Musica "Giuseppe Tartini", Trieste, Italien|
Varighed: 21 nov. 2012 → 24 nov. 2012
Konferencens nummer: 19
|Konference||XIX Colloquio di Informatica Musicale|
|Lokation||Conservatorio di Musica "Giuseppe Tartini"|
|Periode||21/11/2012 → 24/11/2012|