IDEAS home Printed from https://ideas.repec.org/p/wop/safiwp/95-09-078.html
   My bibliography  Save this paper

Quasi-Linear Cellular Automata

Author

Listed:
  • Cristopher Moore

Abstract

Simulating a cellular automata (CA) for t time-steps into the future requires t[super 2] serial computation steps or t parallel ones. However, certain CAs based on an Abelian group, such as addition mod 2, are termed linear because they obey a principle of superposition. This allows them to be predicted effiently, in serial time [cal O](t) [1] or [cal O](log t) in parallel. In this paper, we generalize this by looking at CAs with a variety of algebraic structures, including quasigroups, non-Abelian groups, Steiner systems, and other structures. We show that in many cases, an efficient algorithm exists even though these CAs are not linear in the previous sense; we term them quasilinear. We find examples which can be predicted in serial time proportional to t, tlog t tlog[super 2] and t[super alpha] for alpha We also discuss what algebraic properties are required or implied by the existence of scaling relations and principles of superposition, and exhibit several novel "vector-valued" CAs.

Suggested Citation

  • Cristopher Moore, 1995. "Quasi-Linear Cellular Automata," Working Papers 95-09-078, Santa Fe Institute.
    • Handle: RePEc:wop:safiwp:95-09-078
    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.

    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:95-09-078. 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.