Fifty years of research on self-replication: an overview
Artificial Life - Special issue on self-replication
A Variant to Turing's Theory of Computing Machines
Journal of the ACM (JACM)
Computer Studies of Turing Machine Problems
Journal of the ACM (JACM)
John von Neumann and the evolutionary growth of complexity: looking backward, looking forward …
Artificial Life - Special issue on the Artificial Life VII: looking backward, looking forward
An Introduction to Genetic Algorithms
An Introduction to Genetic Algorithms
Godel, Escher, Bach: An Eternal Golden Braid
Godel, Escher, Bach: An Eternal Golden Braid
Artificial chemistries—a review
Artificial Life
Computation: finite and infinite machines
Computation: finite and infinite machines
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
A Mathematical Theory of Communication
A Mathematical Theory of Communication
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
On the reachability of a version of graph-rewriting system
Information Processing Letters
Asynchronous graph-rewriting automata and simulation of synchronous execution
ECAL'07 Proceedings of the 9th European conference on Advances in artificial life
Hi-index | 0.00 |
The relationship between structure and function is explored via a system of labeled directed graph structures upon which a single elementary read/write rule is applied locally. Boundaries between static (information-carrying) and active (information-processing) objects, imposed by mandate of the rules or physics in earlier models, emerge instead as a result of a structure-function dynamic that is reflexive: objects may operate directly on their own structure. A representation of an arbitrary Turing machine is reproduced in terms of structural constraints by means of a simple mapping from tape squares and machine states to a uniform medium of nodes and links, establishing computation universality. Exploiting flexibility of the formulation, examples of other unconventional “self-computing” structures are demonstrated. A straightforward representation of a kinematic machine system based on the model devised by Laing is also reproduced in detail. Implications of the findings are discussed in terms of their relation to other formal models of computation and construction. It is argued that reflexivity of the structure-function relationship is a critical informational dynamic in biochemical systems, overlooked in previous models but well captured by the proposed formulation.