@inproceedings{
patarroyo2023assemblyca,
title={Assembly{CA}: A Benchmark of Open-Endedness for Discrete Cellular Automata},
author={Keith Yuan Patarroyo and Abhishek Sharma and Sara Walker and Lee Cronin},
booktitle={Second Agent Learning in Open-Endedness Workshop},
year={2023},
url={https://openreview.net/forum?id=5cEQ4ZOsIN}
}
We introduce AssemblyCA, a framework for utilizing cellular automata(CA) designed to benchmark the potential of open-ended processes. The benchmark quantifies the open-endedness of a system composed of resources, agents interacting with CAs, and a set of generated artifacts. We quantify the amount of open-endedness by taking the generated artifacts or objects and analyzing them using the tools of assembly theory(AT). Assembly theory can be used to identify selection in systems that produce objects that can be decomposable into atomic units, where these objects can exist in high copy numbers. By combining an assembly space measure with the copy number of an object we can quantify the complexity of objects that have a historical contingency. Moreover, this framework allows us to accurately quantify the indefinite generation of novel, diverse, and complex objects, the signature of open-endedness. We benchmark different measures from the assembly space with standard diversity and complexity measures that lack historical contingency. Finally, the open-endedness of three different systems is quantified by performing an undirected exploration in two-dimensional life-like CA, a cultural exploration provided by human experimenters, and an algorithmic exploration by a set of programmed agents.
AssemblyCA: A Benchmark of Open-Endedness for Discrete Cellular Automata
Keith Yuan Patarroyo Abhishek Sharma Sara Walker Lee Cronin