It is pointed out that the reproduction fork dynamics, which nature uses to copy DNA, generalizes to a universal copy constructor for systems of arbitrary structure and topology. It is an example of a “universal dynamics” which defines a time development for arbitrary systems without additional structural assumption (beyond certain axiomatic properties of systems). Allowing for updated copies of the agents and relations of the system, the reproduction fork dynamics can be used in iterative updating algorithms. They can be applied to very general optimization problems. The procedure is strictly local, therefore suitable for MIMD parallel computers; it avoids the need for global synchronization. Generalization to a multiscale method is briefly discussed. It is designed to eliminate critical slowing down in badly conditioned problems.
展开▼
