Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). (c) Oxford University Press, 2015. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy).

date: 18 August 2017

Abstract and Keywords

Live algorithms are an ideal concept: computational systems able to collaborate proactively with humans in the creation of group-based improvised music. The challenge is to achieve equivalence between human and computer collaborators, both in formal terms and in practice (evident to both performers and audience alike). The fundamental question is the capacity for computational processes to exhibit “creativity.” The problems inherent in computer music performance are considered, in which computers are quasi-instruments or act in proxy for another musician. Theories from social psychology and pragmatics are explored to help understand live music-making as a special case of social organization; namely, Kelley’s covariation model of Attribution Theory and Grice’s Maxims of Cooperation. This chapter outlines a description of how human beings and computers might engage on an equivalent basis and proposes how social psychology theories, rendered in formal language, can point to new horizons in human-computer performance practice.

Keywords: live algorithms, computer music, improvisation, performance, attribution theory, maxims of cooperation, social psychology, pragmatics, Kelley, Grice

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.