Modeling Complexity for Interactive Art Works on the Internet

Publisher Summary Based on the idea that interaction and communication between entities of a system are the driving forces behind the emergence of higher and more complex structures in life, it is proposed to apply principles of complex system theory to the creation of interactive, computer-generated and audience-participatory artworks and to test whether complexity within an artificial computer-generated system can emerge. Social systems formed (in part) out of people, the brain formed out of neurons, molecules formed out of atoms, the weather formed out of air currents are all examples of complex systems. The field of complex systems cuts across all traditional disciplines of science as well as engineering, management, and medicine. The topological complexity is a measure of the size of the minimal computational model (typically a finite automaton of some variety) in the minimal formal language in which it has a finite model. Model theory is the branch of mathematical logic dealing with the relationship between a formal language and its interpretation in mathematical structures. Effective measure complexity of a pattern is defined as the asymptotic behavior of the amount of information required to predict the next symbol to the level of granularity.

[1]  J. R. Newman.  The World of Mathematics , 1961 .

[2]  Dave Cliff,et al.  Creatures: artificial life autonomous software agents for home entertainment , 1997, AGENTS '97.

[3]  Christa Sommerer,et al.  Interacting with artificial life: A‐volve: Linking human design and interaction to the virtual world , 1997 .

[4]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

[5]  J. Crutchfield.  The calculi of emergence: computation, dynamics and induction , 1994 .

[6]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[7]  Samuel A. Richmond,et al.  A simplification of the theory of simplicity , 1996, Synthese.

[8]  George Kampis.  Information, Computation and Complexity , 1988 .

[9]  F. Heylighen.  RELATIONAL CLOSURE: a mathematical concept for distinction- making and complexity analysis , 1990 .

[10]  Egon Börger,et al.  The equivalence of Horn and network complexity for Boolean functions , 2004, Acta Informatica.

[11]  Ivan M. Havel,et al.  Scale dimensions in nature , 1996 .

[12]  P. Bak,et al.  Self-organized criticality. , 1988, Physical review. A, General physics.

[13]  L. Levin,et al.  THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .

[14]  Per Martin-Löf,et al.  The Definition of Random Sequences , 1966, Inf. Control..

[15]  Wolfgang Banzhaf,et al.  Self-Replicating Sequences of Binary Numbers: The Build-Up of Complexity , 1994, Complex Syst..

[16]  Bruce Edmonds,et al.  Syntactic Measures of Complexity , 1999 .

[17]  Boris A. Trakhtenbrot,et al.  Algorithms and automatic computing machines , 1963 .

[18]  F. Papentin.  On order and complexity. I. General considerations , 1980 .

[19]  F. Heylighen.  The Growth of Structural and Functional Complexity during Evolution , 1999 .

[20]  R. J. Nelson,et al.  Structure of Complex Systems , 1976, PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association.

[21]  Christa Sommerer,et al.  VERBARIUM and LIFE SPACIES: creating a visual language by transcoding text into form on the Internet , 1999, Proceedings 1999 IEEE Symposium on Visual Languages.

[22]  Tad Hogg,et al.  Complexity and adaptation , 1986 .

[23]  J. Kemeny.  Two Measures of Complexity , 1955 .

[24]  H. Pattee.  DYNAMIC AND LINGUISTIC MODES OF COMPLEX SYSTEMS , 1977 .

[25]  P. Grassberger.  Toward a quantitative theory of self-generated complexity , 1986 .

[26]  V. Lazarev.  Complexity and synthesis of minimal logic circuits using multiplexers , 1992 .

[27]  P. Bak,et al.  Self-organized criticality , 1991 .

[28]  Christa Sommerer,et al.  Life Spacies , 1999, SIGGRAPH '99.

[29]  P. Anderson.  More is different. , 1972, Science.

[30]  A. Whiten,et al.  On the Nature of Complexity in Cognitive and Behavioural Science , 1997 .

[31]  S. Pimm.  The complexity and stability of ecosystems , 1984, Nature.

[32]  D. McShea.  Complexity and evolution: What everybody knows , 1991 .

[33]  John L. Casti,et al.  On System Complexity: Identification, Measurement, and Management , 1986 .

[34]  Yuri Gurevich,et al.  Monotone versus positive , 1987, JACM.

[35]  Etienne Grandjean.  The Spectra of First-Order Sentences and Computational Complexity , 1984, SIAM J. Comput..

[36]  Christopher G. Langton,et al.  Life at the Edge of Chaos , 1992 .

[37]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[38]  Robert Rosen.  Complexity and System Descriptions , 1977 .

[39]  R. Badii,et al.  Complexity and Unpredictable Scaling of Hierarchical Structures , 1992 .

[40]  Lars Löfgren,et al.  COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY , 1977 .