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

Authors:
William R. Buckley;Amar Mukherjee
Affiliations:
California Evolution Institute, San Francisco, CA.;Professor of Computer Science, School of Computer Science, University of Central Florida, Orlando, FL.
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Year:
2005

Citing 2
Cited 2

Representation of Events in the von Neumann Cellular Model

Journal of the ACM (JACM)
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

Computational discovery of instructionless self-replicating structures in cellular automata

Artificial Life
Codd's self-replicating computer

Artificial Life

Quantified Score

Hi-index	0.00

Visualization

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.