Simple Self-Reproduction Programs in a Cellular Space Based on the Parallel Substitution Algorithm

Authors:
S. M. Achasova
Affiliations:
Institute of Computational Mathematics and Mathematical Geophysics, Siberian Division, Russian Academy of Sciences, pr. Akademika Lavrent'eva 6, Novosibirsk, 630090 Russia achasova@ssd.ssc ...
Venue:
Programming and Computing Software
Year:
2004

Citing 10
Cited 1

Emergence of self-replicating structures in a cellular automata space

Physica D
Problem solving during artificial selection of self-replicating loops

Physica D
On the relationship between cellular automata and L-systems: the self-replication case

Physica D
Parallel Substitution Algorithm: Theory and Application

Parallel Substitution Algorithm: Theory and Application
A New Self-Reproducing Cellular Automaton Capable of Construction and Computation

Proceedings of the Third European Conference on Advances in Artificial Life
Embryonics: A Macroscopic View of the Cellular Architecture

ICES '98 Proceedings of the Second International Conference on Evolvable Systems: From Biology to Hardware
Spontaneous Emergence of Robust Cellular Replicators

ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry
Emergence of Self-Replicating Loops in an Interactive, Hardware-Implemented Game-of-Life Environment

ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry
Cellular Automata

Cellular Automata
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

Program constructor of cellular self-reproducing structures

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

The parallel substitution algorithm, which is a spatial model for representing fine-grained parallel computations, is used for constructing self-replicating structures in a cellular space. The use of this model allows one to create more compact (in terms of the number of cell states and transition rules) and structured self-reproduction programs compared to the classical cellular automaton model. Two parallel substitution algorithms for modeling the self-reproduction of a cellular structure having the shape of a rectangular loop are presented. One of them models the self-reproduction of the original structures from left to right, and the other, from left to right and from bottom to top.