As a measure of the extent to which Otomata has helped popularize generative sound, note that the comments at Engadget are relatively free of the sort of snarky nay-saying that has been the reader response there to posts about sound art ( witness, for an unfortunate contrast, a recent Engadget post about Switzerland-based Zimoun).Ĭontacted via email, Bozkurt agreed to be interviewed, and what follows is that conversation, lightly edited. Coverage popped up not only on digital-music sites like (where Peter Kirn highlights Otomata’s social component, in which users share the result of their experiments), but also consumer-tech site like. As of this writing, the above YouTube clip of Otomata in action has had more than 175,000 views. The Otomota site received more than a million page views in a matter of days. The resulting wave of Internet-fed curiosity proved just as unpredictable as the sonic outcomes inherent in his creation. If a cell encounters another cell on its way, it turns itself clockwise. If any cell encounters a wall, it triggers a pitched sound whose frequency is determined by the xy position of collision, and the cell reverses its direction. at each cycle, the cells move themselves in the direction of their internal states. The rules, as he describes them, are simple: Each alive cell has 4 states: Up, right, down, left. A little more than a month ago Bozkurt announced the free tool’s existence on his website. This is Otomata, the grid-based generative music system, or audio-game, or sound-toy, developed by Batuhan Bozkurt, who is based in Istanbul, Turkey. 243–257.Grid, Unlocked: Video footage of Batuhan Bozkurt’s Otomata audio-game in action. Krcal, P., Yi, W.: Communicating timed automata: The more synchronous, the more difficult to verify. Henriksen, J.G., Mukund, M., Kumar, K.N., Sohoni, M., Thiagarajan, P.S.: A theory of regular MSC languages. Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. (eds.) Foundations of Software Technology and Theoretical Computer Science. In: Pandu Rangan, C., Raman, V., Ramanujam, R. International Journal of Foundations of Computer Science 14(4), 625–640 (2003)ĭ’Souza, D., Thiagarajan, P.S.: Product interval automata: A subclass of timed automata. Springer, Heidelberg (2006)ĭ’Souza, D.: A logical characterisation of event clock automata. Math. 5, 66–72 (1960)Ĭhandrasekaran, P., Mukund, M.: Matching scenarios with timing constraints. Journal of the ACM 30(2) (1983)īüchi, J.: Weak second order logic and finite automata. 91–106 (1997)īollig, B., Leucker, M.: Message-passing automata are expressively equivalent to EMSO logic. Springer, Heidelberg (1996)īen-Abdallah, H., Leue, S.: Timing constraints in message sequence chart specifications. TCS 126(2), 183–235 (1994)Īlur, R., Fix, L., Henzinger, T.A.: Event-clock automata: A determinizable class of timed automata. Alur, R., Dill, D.L.: A theory of timed automata.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |