Advertisement

Locating Self-Organization at the Edge of Chaos

  • Howard A. Blair
Conference paper

Abstract

Langton [3] attempted to parametrically characterize subspaces of cellular automata (CA) rules that determine trajectories of the automata that are not quite chaotic but still sufficiently complex to be able to carry out computation. As the number of available local states and neighborhood size increases it is difficult to sharply recognize regular structure in either the subspace of rules or the corresponding parameter values. In-depth re-examination of Langton’s parameterization of the CA-rule space by Mitchell, Hraber and Crutchfield [4] casts doubt on the utility of Langton’s original parameterization but leaves open the question of whether interesting emergent structure in the trajectories of CAs capable of supporting computation is associated with CA-rules located at or near phase transitions in the rule space.

Keywords

Lyapunov Exponent Cellular Automaton Topological Entropy Large Lyapunov Exponent Fibonacci Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [1]
    Blair, H.A., F. Dushin, D.W. Jakel, A.J. Rivera, and M. Sezgin “Continuous models of computation for logic programs: importing continuous mathematics into logic programming’s algorithmic foundations”, The Logic Programming Paradigm (K.R. Apt, V.W. Marek, M. Truszczynski, and D.S. Warren eds.) Springer (1999), 231–255.Google Scholar
  2. [2]
    Kruse, R., J. Gebhardt, and F. Klawonn, Foundations of Fuzzy Systems, Wiley (1994).Google Scholar
  3. [3]
    Langton, C.J., “Computation at the edge of chaos: phase transition and emergent computation”, Physica D 42 (1990) 12–37.CrossRefADSMathSciNetGoogle Scholar
  4. [4]
    Mitchell, M, P.T. Hraber, and J.P. Crutchfield, “Revisiting the edge of chaos: evolving cellular automata to perform computations”, Complex Systems 7 (1993) 89–130.zbMATHGoogle Scholar
  5. [5]
    Ramasubramanian, S. and M.S. Sriram, “A comparative study of computation of Lyapunov spectra with different algorithms”, Physica D D139 (2000) 72–86.ADSMathSciNetGoogle Scholar
  6. [6]
    Wolfram, Stephen, “Universality and complexity in cellular automata and complexity”, Physica D 10 (1984) 1–35.CrossRefADSMathSciNetGoogle Scholar

Copyright information

© NECSI Cambridge, Massachusetts 2006

Authors and Affiliations

  • Howard A. Blair
    • 1
  1. 1.EECSSyracuse UniversitySyracuse

Personalised recommendations