Write a Blog >>

Kolmogorov complexity analysis suggests that we can measure how well we understand a piece of music by the concision of a program that produces it. Furthermore, the inherent complexity of grooves and fugues can be compared via the lengths of their programmatic representations. Algorithmic composition has curious implications for the creation, copyright and performance of pieces, both finite and infinite.In this talk I examine the relationship that complexity theory and disjunctive sequences have to music, music-generating programs and literary works. I then apply these ideas by devising a program to generate an infinite ‘Copyright Infringement Song’ that contains all other songs within it. I adopt literary modes of analysis and presentation, which I motivate by arguing that music is a cultural and artistic phenomenon rather than a natural one.

Tue 20 Jun
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

16:00 - 18:20: Tuesday - 16:00 - 18:20 - Sala AgoraCurry On Talks at Actes, Informatics Building
16:00 - 16:40
Talk
Curry On Talks
Chris FordThoughtWorks (UK) Ltd.
16:50 - 17:30
Talk
Curry On Talks
Jurriaan HageUtrecht University
17:40 - 18:20
Talk
Curry On Talks
Michael SteindorferDelft University of Technology, Netherlands