Constructibility of signal-crossing solutions in von Neumann 29-state cellular automata

    Authors

    W. R. Buckley;A. Mukherjee

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Keywords

    Computer Science, Theory & Methods

    Abstract

    In von Neumann 29-state cellular automata, the crossing of signals is an important problem, with three solutions reported in the literature. These solutions greatly impact automaton design, especially self-replicators. This paper examines these solutions, with emphasis upon their constructibility. We show that two of these solutions are difficult to construct, and offer an improved design technique. We also argue that solutions to the signal-crossing problem have implications for machine models of biological development, especially with regard to the cell cycle.

    Journal Title

    Computational Science - Iccs 2005, Pt 2

    Volume

    3515

    Publication Date

    1-1-2005

    Document Type

    Article

    Language

    English

    First Page

    395

    Last Page

    403

    WOS Identifier

    WOS:000230023800053

    ISSN

    0302-9743; 3-540-26043-9

    Share

    COinS