2007 · 13 citations · 17 references
ComputingComputer ScienceComputer SystemsAlgorithmsProgramming LanguagesSystems ProgrammingComputational ModelingComputational ModelsEvolutionary ComputationGenetic AlgorithmsGenetic ProgrammingAutonomic ComputingCommunication ProtocolsEmergent PropertiesProgram RepresentationProgramming ModelsSelf-modifying Code
Decentralized artificial chemical computing models are attractive for bio‑inspired software with self‑organizing properties, yet constructing such programs is non‑trivial, and the Fraglets language was originally designed for communication protocols. The study explores using chemical programming models for automatic programming in autonomic environments where software must run unsupervised indefinitely. The authors extend the Fraglets language with intrinsic genetic programming to allow programs to replicate and modify themselves during execution, and demonstrate generic computational extensions that enable creation of self‑replicating and self‑modifying programs. The work demonstrates that these extensions allow self‑replicating and self‑modifying programs, marking a first step toward autonomic repair and optimization, while revealing language features, shortcomings, and suggesting future improvements.
The inherently decentralized nature of artificial chemical computing models makes them particularly attractive for building bio-inspired software with self-organizing and emergent properties. Yet it is not straightforward to construct such chemical programs, either manually or automatically. We are exploring the potential of chemical programming models for automatic programming, in the context of autonomic environments where software must operate unsupervised for unlimited periods of time. We are enhancing the Fraglets chemical language to support intrinsic genetic programming, such that programs can replicate and modify themselves during execution. The Fraglets language was originally designed to express communication protocols. We first show a few extensions towards more generic computations, then show how self- replicating and self-modifying programs can be created. This is a first step towards programs that can repair and optimize themselves in an autonomic way. We reveal a number of features and shortcomings of the language, suggesting fixes and future directions.
17
Theory of Self-Reproducing Automata
Jacob T. Schwartz, John von Neumann, Arthur W. Burks · Mathematics of Computation · 1967 · 5.5K citations
Gheorghe Pǎun · Journal of Computer and System Sciences · 2000 · 2.3K citations
On notation for ordinal numbers
S. C. Kleene · Journal of Symbolic Logic · 1938 · 762 citations
Self-reproduction in cellular automata
Christopher G. Langton · Physica D Nonlinear Phenomena · 1984 · 573 citations · Full text