Looking for Complexity at Phase Boundaries in Continuous Cellular Automata
<|reference_start|>Looking for Complexity at Phase Boundaries in Continuous Cellular Automata: One key challenge in Artificial Life is designing systems that display an emergence of complex behaviors. Many such systems depend on a high-dimensional parameter space, only a small subset of which displays interesting dynamics. Focusing on the case of continuous systems, we introduce the 'Phase Transition Finder'(PTF) algorithm, which can be used to efficiently generate parameters lying at the border between two phases. We argue that such points are more likely to display complex behaviors, and confirm this by applying PTF to Lenia showing it can increase the frequency of interesting behaviors more than two-fold, while remaining efficient enough for large-scale searches.<|reference_end|>
@article{papadopoulos2024looking,
    title={Looking for Complexity at Phase Boundaries in Continuous Cellular
  Automata},
    author={Vassilis Papadopoulos, Guilhem Doat, Arthur Renard, Cl'ement Hongler},
    journal={arXiv preprint arXiv:2402.17848},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.17848},
    primaryClass={nlin.AO cs.NE}
}