Program constructor of cellular self-reproducing structures

Authors:
S. M. Achasova
Affiliations:
Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch of Russian Academy of Sciences, Novosibirsk, Russia 630090
Venue:
Programming and Computing Software
Year:
2009

Citing 8
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
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
Spontaneous Emergence of Robust Cellular Replicators

ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry
Simple Self-Reproduction Programs in a Cellular Space Based on the Parallel Substitution Algorithm

Programming and Computing Software
Cellular Automata

Cellular Automata
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

The construction of simulation models of algorithms and structures with fine-grain parallelism in WinALT

PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple program for constructing a cellular self-reproducing rectangular loop of arbitrary size is developed based on the parallel substitution algorithm (PSA), which provides a spatial model for representing fine-grained parallel computations. In order to launch the self-reproduction of a loop of some specified size, one should enter its description into the input tape. The program includes operators for preliminary cleaning the cellular array, which makes it possible to easily change its internal functional structure. Two variants of the program are developed. The first variant constructs a chain of self-reproducing loops of the given size, and the second variant constructs an array of such loops.