IDEAS home Printed from https://ideas.repec.org/p/wop/safiwp/94-04-025.html
   My bibliography  Save this paper

Complexity in One-D Cellular Automata: Gliders, Basins of Attraction and the Z Parameter

Author

Listed:
  • Andrew Wuensche

Abstract

What do we mean by compexity in the changing patterns of a discrete dynamical system? Complex one-D CA rules support the emergence of interacting periodic configurations---gliders, glider-guns and {\it compound} gliders made up of interacting sub-gliders---evolving within quiescent of periodic backgrounds. This paper examines gliders and their interactions in one-D CA on the basis of many examples. The basin of attraction fields of complex rules are typically composed of a small number of basins with long transients (interacting gliders) rooted on short attractor cycles (non-interacting gliders, or backgrounds free of gliders). For CA rules in general, a relationship is proposed between the quality of dynamical behavior, the topology of the basin of attraction field, the density of garden-of-Eden states counted in attractor basins or sub-trees, and the rule-table's Z parameter. High density signifies simple dynamics, and low---chaotic, with complex dynamics at the transition. Plotting garden-of-Eden density against the Z parameter for a large sample of rules shows a marked correlation that increases with neighborhood size. The relationship between Z and $\lambda$ parameter is described. A method of recognizing the emergence of gliders by monitoring the evolution of the lookup frequency spectrum, and its entropy, is suggested.

Suggested Citation

  • Andrew Wuensche, 1994. "Complexity in One-D Cellular Automata: Gliders, Basins of Attraction and the Z Parameter," Working Papers 94-04-025, Santa Fe Institute.
  • Handle: RePEc:wop:safiwp:94-04-025
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Andy Wuensche, 1998. "Classifying Cellular Automata Automatically," Working Papers 98-02-018, Santa Fe Institute.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:94-04-025. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/epstfus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.