Self-Replicability of Composite Graph Reproduction System
D Venkata Lakshmi
Jeganathan L
School of Computing Science and Engineering
Vellore Institute of Technology
Vandalure-Kelambakkam Road, Chennai, India-600 127
venkata.lakshmi2011@vit.ac.in
jeganathan.l@vit.ac.in
Abstract
The problem of self-replication initiated by John von Neumann has been investigated by many researchers from different perspectives. As a part of our earlier investigation into self-replication through graph reproduction, we introduced a comprehensive graph reproduction system and identified a few graph reproduction models that are self-replicable. This paper addresses the question of whether a combination of more than one non-self-replicable graph reproduction model is self-replicable or not. A few existing graph reproduction models were combined in two different ways and tested for self-replicability. Our study confirms that non-self-replicable graph reproduction models become self-replicable by combining themselves with other reproduction models.
Keywords: self-replication; reproduction models; graph reproduction system; graph self-replicative system; composite graph reproduction system
Cite this publication as:
D V. Lakshmi and Jeganathan L, “Self-Replicability of Composite Graph Reproduction System,” Complex Systems, 29(1), 2020 pp. 45–61.
https://doi.org/10.25088/ComplexSystems.29.1.45
