Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-dfsvx Total loading time: 0 Render date: 2024-04-30T06:07:45.625Z Has data issue: false hasContentIssue false

6 - Algorithmic composition

from Part II - Electronic music in practice

Published online by Cambridge University Press:  28 September 2011

Nick Collins
Affiliation:
University of Sussex
Julio d'Escrivan
Affiliation:
Anglia Ruskin University, Cambridge
Get access

Summary

Dedicated to Gottfried Michael Koenig for his 80th birthday

Although Algorithmic composition became popular with the rise of computers, algorithmic thinking is far older – it can be traced back to the ancient times of Pythagoras and the Jewish Kabbalah. It is a method of perceiving an abstract model behind the sensual surface, or in turn, of constructing such a model in order to create aesthetic works. Behind the various approaches there is one common denominator: a longing to create something infinite that exceeds the limited horizon of our individual knowledge. Seen in this light, algorithmic thinking and its application in the arts can become a way to gain experience and to overcome barriers that are either implicit in ourselves, or erected by our social environment.

In this article, I am focusing exclusively on the use of algorithms in the compositional process, leaving aside other approaches like the algorithmic simulation of musical styles, the computational modelling of music cognition and the application of artificial intelligence techniques (Cope 1996; Ebcioglu 1990). My primary aim is to demonstrate how the algorithmic spirit has evolved through the centuries – from medieval music theory to the interactive realtime-generated computer music of today.

Algorithm

The term algorithm was phonetically derived from the name of the Arab mathematician Muhammad ibn Musa al-Khwarizmi (ninth century) who introduced Hindu–Arabic numerals and the concepts of algebra into European mathematics. An algorithm can be defined as a predetermined set of instructions for solving a specific problem in a limited number of steps. Algorithms can range from a mere succession of simple arithmetical operations to more complex combinations of procedures, utilising more involved constructions from computer science such as rule-based grammars, recursion and probabilistic inference.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×