Self-Replicability of Composite Graph Reproduction System

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.