Results 1  10
of
301
Revisiting the edge of chaos: Evolving cellular automata to perform computations
 Complex Systems
, 1993
"... We present results from an experiment similar to one performed by Packard [24], in which a genetic algorithm is used to evolve cellular automata (CA) to perform a particular computational task. Packard examined the frequency of evolved CA rules as a function of Langton’s λ parameter [17], and interp ..."
Abstract

Cited by 128 (11 self)
 Add to MetaCart
(Show Context)
We present results from an experiment similar to one performed by Packard [24], in which a genetic algorithm is used to evolve cellular automata (CA) to perform a particular computational task. Packard examined the frequency of evolved CA rules as a function of Langton’s λ parameter [17], and interpreted the results of his experiment as giving evidence for the following two hypotheses: (1) CA rules able to perform complex computations are most likely to be found near “critical ” λ values, which have been claimed to correlate with a phase transition between ordered and chaotic behavioral regimes for CA; (2) When CA rules are evolved to perform a complex computation, evolution will tend to select rules with λ values close to the critical values. Our experiment produced very different results, and we suggest that the interpretation of the original results is not correct. We also review and discuss issues related to λ, dynamicalbehavior classes, and computation in CA. The main constructive results of our study are identifying the emergence and competition of computational strategies and analyzing the central role of symmetries in an evolutionary system. In particular, we demonstrate how symmetry breaking can impede the evolution toward higher computational capability.
Evolutionary games on graphs
, 2007
"... Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to ..."
Abstract

Cited by 107 (0 self)
 Add to MetaCart
Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in nonequilibrium statistical physics. This review gives a tutorialtype overview of the field for physicists. The first four sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fifth section surveys the topological complications implied by nonmeanfieldtype social network structures in general. The next three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner’s Dilemma, the Rock–Scissors–Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.
Classifying Cellular Automata Automatically; Finding gliders, filtering, and relating spacetime patterns, attractor basins, and the Z parameter
 Complexity
, 1998
"... CA rules can be classied automatically for a spectrum of ordered, complex and chaotic dynamics, by a measure of the variance of inputentropy over time. Rules that support interacting gliders and related complex dynamics can be identied, giving an unlimited source for further study. The distribution ..."
Abstract

Cited by 55 (4 self)
 Add to MetaCart
CA rules can be classied automatically for a spectrum of ordered, complex and chaotic dynamics, by a measure of the variance of inputentropy over time. Rules that support interacting gliders and related complex dynamics can be identied, giving an unlimited source for further study. The distribution of rule classes in rulespace can be shown. A byproduct of the method allows the automatic \ltering" of CA spacetime patterns to show up gliders and related emergent congurations more clearly. The classication seems to correspond to our subjective judgment of spacetime dynamics. There are also approximate correlations with global measures on convergence in attractor basins, characterized by the distribution of indegree sizes in their branching structure, and to the rule parameter, Z. Based on computer experiments using the software Discrete Dynamics Lab (DDLab)[22], this paper explains the methods and presents results for 1d CA. 1 Introduction Cellular automata (CA) are a much stud...
The attractorbasin portrait of a cellular automaton
 J. Stat. Phys
, 1992
"... SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peerreviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for pap ..."
Abstract

Cited by 52 (17 self)
 Add to MetaCart
(Show Context)
SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peerreviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at SFI, inspired by an invited visit to or collaboration at SFI, or funded by an SFI grant. ©NOTICE: This working paper is included by permission of the contributing author(s) as a means to ensure timely distribution of the scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the author(s). It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may be reposted only with the explicit permission of the copyright holder. www.santafe.edu
Turbulent Pattern Bases for Cellular Automata
 Physica D
, 1993
"... Unpredictable patterns generated by cellular automata (CA) can be decomposed with respect to a turbulent, positive entropy rate pattern basis. The resulting filtered patterns uncover significant structural organization in a CA's dynamics and information processing capabilities. We illustrate th ..."
Abstract

Cited by 51 (15 self)
 Add to MetaCart
(Show Context)
Unpredictable patterns generated by cellular automata (CA) can be decomposed with respect to a turbulent, positive entropy rate pattern basis. The resulting filtered patterns uncover significant structural organization in a CA's dynamics and information processing capabilities. We illustrate the decomposition technique by analyzing a binary, range2 cellular automaton having two invariant chaotic domains of different complexities and entropies. Once identified, the domains are seen to organize the CA's state space and to dominate its evolution. Starting from the domains' structures, we show how to construct a finitestate transducer that performs nonlinear spatial filtering such that the resulting spacetime patterns reveal the domains and the intervening walls and dislocations. To show the statistical consequences of domain detection, we compare the entropy and complexity densities of each domain with the globally averaged quantities. A more graphical comparison uses difference patter...
Computational Mechanics of Cellular Automata: An Example
, 1995
"... We illustrate and extend the techniques of computational mechanics in explicating the structures that emerge in the spacetime behavior of elementary onedimensional cellular automaton rule 54. The CA's dominant regular domain is identified and a domain filter is constructed to locate and class ..."
Abstract

Cited by 49 (4 self)
 Add to MetaCart
(Show Context)
We illustrate and extend the techniques of computational mechanics in explicating the structures that emerge in the spacetime behavior of elementary onedimensional cellular automaton rule 54. The CA's dominant regular domain is identified and a domain filter is constructed to locate and classify defects in the domain. The primary particles are identified and a range of interparticle interactions is studied. The deterministic equation of motion of the filtered spacetime behavior is derived. Filters of increasing sophistication are constructed for the efficient gathering of particle statistics and for the identification of higherlevel defects, particle interactions, and secondary domains. We define the emergence time at which the spacetime behavior condenses into configurations consisting only of domains, particles, and particle interactions. Taken together, these techniques serve as the basis for the investigation of pattern evolution and selforganization in this representative sys...
Transition Phenomena in Cellular Automata Rule Space
 Physica D
, 1990
"... We define several qualitative classes of cellular automata (CA) behavior, based on various statistical measures, and describe how the space of all cellular automata is organized. As a cellular automaton... ..."
Abstract

Cited by 39 (7 self)
 Add to MetaCart
(Show Context)
We define several qualitative classes of cellular automata (CA) behavior, based on various statistical measures, and describe how the space of all cellular automata is organized. As a cellular automaton...
Scale Invariance in Biology: Coincidence Or Footprint of a Universal Mechanism?
, 2001
"... In this article, we present a selfcontained review of recent work on complex biological systems which exhibit no characteristic scale. This property can manifest itself with fractals (spatial scale invariance), flicker noise or 1}fnoise where f denotes the frequency of a signal (temporal scale i ..."
Abstract

Cited by 38 (1 self)
 Add to MetaCart
In this article, we present a selfcontained review of recent work on complex biological systems which exhibit no characteristic scale. This property can manifest itself with fractals (spatial scale invariance), flicker noise or 1}fnoise where f denotes the frequency of a signal (temporal scale invariance) and power laws (scale invariance in the size and duration of events in the dynamics of the system). A hypothesis recently put forward to explain these scalefree phenomomena is criticality, a notion introduced by physicists while studying phase transitions in materials, where systems spontaneously arrange themselves in an unstable manner similar, for instance, to a row of dominoes. Here, we review in a critical manner work which investigates to what extent this idea can be generalized to biology. More precisely, we start with a brief introduction to the concepts of absence of characteristic scale (powerlaw distributions, fractals and 1}fnoise) and of critical phenomena. We then review typical mathematical models exhibiting such properties : edge of chaos, cellular automata and selforganized critical models. These notions are then brought together to see to what extent they can account for the scale invariance observed in ecology, evolution of species, type III epidemics and some aspects of the central nervous system. This article also discusses how the notion of scale invariance can give important insights into the workings of biological systems.
Computation in cellular automata: A selected review
 Nonstandard Computation
, 1996
"... Cellular automata (CAs) are decentralized spatially extended systems consisting of large numbers of simple identical components with local connectivity. Such systems have the potential to perform complex computations with a high degree of efficiency and robustness, as well as to model the behavior o ..."
Abstract

Cited by 36 (2 self)
 Add to MetaCart
Cellular automata (CAs) are decentralized spatially extended systems consisting of large numbers of simple identical components with local connectivity. Such systems have the potential to perform complex computations with a high degree of efficiency and robustness, as well as to model the behavior of complex systems in nature. For these reasons CAs and related architectures have