Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Self-reproduction in a reversible cellular space
Theoretical Computer Science - Special issue on universal machines and computations
Fifty years of research on self-replication: an overview
Artificial Life - Special issue on self-replication
Self-Inspection Based Reproduction in Cellular Automata
Proceedings of the Third European Conference on Advances in Artificial Life
A New Self-Reproducing Cellular Automaton Capable of Construction and Computation
Proceedings of the Third European Conference on Advances in Artificial Life
Fault-Tolerant Structures: Towards Robust Self-Replication in a Probabilistic Environment
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
Evolvable self-replicating molecules in an artificial chemistry
Artificial Life
Reliable cellular automata with self-organization
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Cellular Automata
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Evolutionary Body Building: Adaptive Physical Designs for Robots
Artificial Life
Robotic Self-replication in Structured Environments: Physical Demonstrations and Complexity Measures
International Journal of Robotics Research
An implementation of von neumann's self-reproducing machine
Artificial Life
Fault tolerant cellular automata
Journal of Computer and System Sciences
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Automatic discovery of self-replicating structures in cellularautomata
IEEE Transactions on Evolutionary Computation
Von Neumann's 29-state cellular automaton: a hardwareimplementation
IEEE Transactions on Education
Exponential growth of large self-reproducing machine systems
Mathematical and Computer Modelling: An International Journal
Optimal seeding of self-reproducing systems
Artificial Life
Hi-index | 0.00 |
This paper is devoted to the study of systems of entities that are capable of generating other entities of the same kind and, possibly, self-reproducing. The main technical issue addressed is to quantify the requirements that such entities must meet to be able to produce a progeny that is not degenerative, i.e., that has the same reproductive capability as the progenitor. A novel theory that allows an explicit quantification of these requirements is presented. The notion of generation rank of an entity is introduced, and it is proved that the generation process, in most cases, is degenerative in that it strictly and irreversibly decreases the generation rank from parent to descendent. It is also proved that there exists a threshold of rank such that this degeneracy can be avoided if and only if the entity has a generation rank that meets that threshold ??? this is the von Neumann rank threshold. On the basis of this threshold, an information threshold is derived, which quantifies the minimum amount of information that must be provided to specify an entity such that its descendents are not degenerative. Furthermore, a complexity threshold is obtained, which quantifies the minimum length of the description of that entity in a given language. As an application, self-assembly for a 2 Degrees of Freedom planar robot is considered, and simulation results are presented. A robot arm capable of picking up and placing the components of another arm, in the presence of errors, is considered to have successfully reproduced if these are placed within an allowable tolerance. The example shows that, due to the kinematics of the robot, errors can grow from one generation to the next, until the reproduction process fails eventually. However, error correction (via error sensing and feedback control) can then be used to prevent such degeneracy. The von Neumann generation rank and information thresholds are computed for this example, and are consistent with the simulation results in predicting degeneracy in the case without error correction, and predicting successful self-reproduction in the case with error correction.