The Computational Attitude in Music Theory

Music studies’s turn to computation during the twentieth century has engendered particular habits of thought about music, habits that remain in operation long after the music scholar has stepped away from the computer. The computational attitude is a way of thinking about music that is learned at the computer but can be applied away from it. It may be manifest in actual computer use, or in invocations of computationalism, a theory of mind whose influence on twentieth-century music theory is palpable. It may also be manifest in more informal discussions about music, which make liberal use of computational metaphors. In Chapter 1, I describe this attitude, the stakes for considering the computer as one of its instruments, and the kinds of historical sources and methodologies we might draw on to chart its ascendance. The remainder of this dissertation considers distinct and varied cases from the mid-twentieth century in which computers or computationalist musical ideas were used to pursue new musical objects, to quantify and classify musical scores as data, and to instantiate a generally music-structuralist mode of analysis. I present an account of the decades-long effort to prepare an exhaustive and accurate catalog of the all-interval twelve-tone series (Chapter 2). This problem was first posed in the 1920s but was not solved until 1959, when the composer Hanns Jelinek collaborated with the computer engineer Heinz Zemanek to jointly develop and run a computer program. Recognizing the transformation wrought on modern statistics and communications technology by information theory, I revisit Abraham Moles’s book Information Theory and Esthetic Perception (orig. 1958) and use its vocabulary to contextualize contemporary information-theoretic work on music that various evokes the computational mind by John. R. Pierce and Mary Shannon, Wilhelm Fucks, and Henry Quastler (Chapter 3). I conclude with a detailed look into a score-segmentation algorithm of the influential American music theorist Allen Forte (Chapter 4). Forte was a skilled programmer who spent several years at MIT in the 1960s, with cutting-edge computers and the company of first-rank figures in the nascent fields of computer science and artificial intelligence. Each one of the researchers whose work is treated in these case studies—at some stage in their relationship with music—adopted what I call the computational attitude to music, to varying degrees and for diverse ends. Of the many questions this dissertation seeks to answer: what was gained by adopting such an attitude? What was lost? Having understood these past explorations of the computational attitude to music, we are better suited ask of ourselves the same questions today

Computational composition strategies in audiovisual laptop performance

We live in a cultural environment in which computer based musical performances have become ubiquitous. Particularly the use of laptops as instruments is a thriving practice in many genres and subcultures. The opportunity to command the most intricate level of control on the smallest of time scales in music composition and computer graphics introduces a number of complexities and dilemmas for the performer working with algorithms. Writing computer code to create audiovisuals offers abundant opportunities for discovering new ways of expression in live performance while simultaneously introducing challenges and presenting the user with difficult choices. There are a host of computational strategies that can be employed in live situations to assist the performer, including artificially intelligent performance agents who operate according to predefined algorithmic rules. This thesis describes four software systems for real time multimodal improvisation and composition in which a number of computational strategies for audiovisual laptop performances is explored and which were used in creation of a portfolio of accompanying audiovisual compositions

Physical (A)Causality: Determinism, Randomness and Uncaused Events

Physical indeterminism; Randomness in physics; Physical random number generators; Physical chaos; Self-reflexive knowledge; Acausality in physics; Irreducible randomnes

Decoding Digital Culture with Science Fiction: Hyper-Modernism, Hyperreality, and Posthumanism

How do digital media technologies affect society and our lives? Through the cultural theory hypotheses of hyper-modernism, hyperreality, and posthumanism, Alan N. Shapiro investigates the social impact of Virtual/Augmented Reality, AI, social media platforms, robots, and the Brain-Computer Interface. His examination of concepts of Jean Baudrillard and Katherine Hayles, as well as films such as Blade Runner 2049, Ghost in the Shell, Ex Machina, and the TV series Black Mirror, suggests that the boundary between science fiction narratives and the »real world« has become indistinct. Science-fictional thinking should be advanced as a principal mode of knowledge for grasping the world and digitalization

Structure formation and identification in geometrically driven soft matter systems

Subdividing space through interfaces leads to many space partitions that are relevant to soft matter self-assembly. Prominent examples include cellular media, e.g. soap froths, which are bubbles of air separated by interfaces of soap and water, but also more complex partitions such as bicontinuous minimal surfaces. Using computer simulations, this thesis analyses soft matter systems in terms of the relationship between the physical forces between the system’s constituents and the structure of the resulting interfaces or partitions. The focus is on two systems, copolymeric self-assembly and the so-called Quantizer problem, where the driving force of structure formation, the minimisation of the free-energy, is an interplay of surface area minimisation and stretching contributions, favouring cells of uniform thickness. In the first part of the thesis we address copolymeric phase formation with sharp interfaces. We analyse a columnar copolymer system “forced” to assemble on a spherical surface, where the perfect solution, the hexagonal tiling, is topologically prohibited. For a system of three-armed copolymers, the resulting structure is described by solutions of the so-called Thomson problem, the search of minimal energy configurations of repelling charges on a sphere. We find three intertwined Thomson problem solutions on a single sphere, occurring at a probability depending on the radius of the substrate. We then investigate the formation of amorphous and crystalline structures in the Quantizer system, a particulate model with an energy functional without surface tension that favours spherical cells of equal size. We find that quasi-static equilibrium cooling allows the Quantizer system to crystallise into a BCC ground state, whereas quenching and non-equilibrium cooling, i.e. cooling at slower rates then quenching, leads to an approximately hyperuniform, amorphous state. The assumed universality of the latter, i.e. independence of energy minimisation method or initial configuration, is strengthened by our results. We expand the Quantizer system by introducing interface tension, creating a model that we find to mimic polymeric micelle systems: An order-disorder phase transition is observed with a stable Frank-Caspar phase. The second part considers bicontinuous partitions of space into two network-like domains, and introduces an open-source tool for the identification of structures in electron microscopy images. We expand a method of matching experimentally accessible projections with computed projections of potential structures, introduced by Deng and Mieczkowski (1998). The computed structures are modelled using nodal representations of constant-mean-curvature surfaces. A case study conducted on etioplast cell membranes in chloroplast precursors establishes the double Diamond surface structure to be dominant in these plant cells. We automate the matching process employing deep-learning methods, which manage to identify structures with excellent accuracy

Configraphics:

This dissertation reports a PhD research on mathematical-computational models, methods, and techniques for analysis, synthesis, and evaluation of spatial configurations in architecture and urban design. Spatial configuration is a technical term that refers to the particular way in which a set of spaces are connected to one another as a network. Spatial configuration affects safety, security, and efficiency of functioning of complex buildings by facilitating certain patterns of movement and/or impeding other patterns. In cities and suburban built environments, spatial configuration affects accessibilities and influences travel behavioural patterns, e.g. choosing walking and cycling for short trips instead of travelling by cars. As such, spatial configuration effectively influences the social, economic, and environmental functioning of cities and complex buildings, by conducting human movement patterns. In this research, graph theory is used to mathematically model spatial configurations in order to provide intuitive ways of studying and designing spatial arrangements for architects and urban designers. The methods and tools presented in this dissertation are applicable in: arranging spatial layouts based on configuration graphs, e.g. by using bubble diagrams to ensure certain spatial requirements and qualities in complex buildings; and analysing the potential effects of decisions on the likely spatial performance of buildings and on mobility patterns in built environments for systematic comparison of designs or plans, e.g. as to their aptitude for pedestrians and cyclists. The dissertation reports two parallel tracks of work on architectural and urban configurations. The core concept of the architectural configuration track is the ‘bubble diagram’ and the core concept of the urban configuration track is the ‘easiest paths’ for walking and cycling. Walking and cycling have been chosen as the foci of this theme as they involve active physical, cognitive, and social encounter of people with built environments, all of which are influenced by spatial configuration. The methodologies presented in this dissertation have been implemented in design toolkits and made publicly available as freeware applications

Optimisation and information-theoretic principles in multiplex networks.

PhD ThesesThe multiplex network paradigm has proven very helpful in the study of many real-world complex systems, by allowing to retain full information about all the different possible kinds of relationships among the elements of a system. As a result, new non-trivial structural patterns have been found in diverse multi-dimensional networked systems, from transportation networks to the human brain. However, the analysis of multiplex structural and dynamical properties often requires more sophisticated algorithms and takes longer time to run compared to traditional single network methods. As a consequence, relying on a multiplex formulation should be the outcome of a trade-off between the level of information and the resources required to store it. In the first part of the thesis, we address the problem of quantifying and comparing the amount of information contained in multiplex networks. We propose an algorithmic informationtheoretic approach to evaluate the complexity of multiplex networks, by assessing to which extent a given multiplex representation of a system is more informative than a single-layer graph. Then, we demonstrate that the same measure is able to detect redundancy in a multiplex network and to obtain meaningful lower-dimensional representations of a system. We finally show that such method allows us to retain most of the structural complexity of the original system as well as the salient characteristics determining the behaviour of dynamical processes happening on it. In the second part of the thesis, we shift the focus to the modelling and analysis of some structural features of real-world multiplex systems throughout optimisation principles. We demonstrate that Pareto optimal principles provide remarkable tools not only to model real-world multiplex transportation systems but also to characterise the robustness of multiplex systems against targeted attacks in the context of optimal percolation