Do algorithms have fun? On completion, indeterminacy and autonomy in computation

Parisi, Luciana and Fazi, M Beatrice (2014) Do algorithms have fun? On completion, indeterminacy and autonomy in computation. In: Goriunova, Olga (ed.) Fun and software: exploring pleasure, paradox and pain in computing. Bloomsbury Academic, New York and London, pp. 109-127. ISBN 9781623560942

Full text not available from this repository.
Item Type: Book Section
Schools and Departments: School of Media, Film and Music > Media and Film
Research Centres and Groups: Sussex Humanities Lab
Subjects: B Philosophy. Psychology. Religion > B Philosophy (General)
B Philosophy. Psychology. Religion > BD Speculative Philosophy
T Technology > T Technology (General)
Related URLs:
Depositing User: Beatrice Fazi
Date Deposited: 29 Apr 2016 13:48
Last Modified: 01 Sep 2017 14:55
URI: http://sro.sussex.ac.uk/id/eprint/60131
📧 Request an update