Artificial life properties of directed interaction combinators vs. chemlambda
This work addresses artificial life simulation for researchers in computational systems, but it is incremental as it builds on prior experiments with these chemistries.
The study investigated whether directed interaction combinators and chemlambda support artificial life behaviors like replication, metabolism, and death, finding that graph rewrite systems allowing conflicting rewrites perform better for these properties, contrary to preferences in decentralized computing.
We provide a framework for experimentation at https://mbuliga.github.io/quinegraphs/ic-vs-chem.html#icvschem with two artificial chemistries: directed interaction combinators (dirIC, defined in section 2) and chemlambda. We are interested if these chemistries allow for artificial life behaviour: replication, metabolism and death. The main conclusion of these experiments is that graph rewrites systems which allow conflicting rewrites are better than those which don't, as concerns their artificial life properties. This is in contradiction with the search for good graph rewrite systems for decentralized computing, where non-conflicting graph rewrite systems are historically preferred. This continues the artificial chemistry experiments with chemlambda, lambda calculus or interaction combinators, available from the entry page at https://chemlambda.github.io/index.html and described in arXiv:2003.14332.