标题： 在连续细胞自动机的相变边界寻找复杂性 显示英文标题

标题： Looking for Complexity at Phase Boundaries in Continuous Cellular Automata

摘要： 一个在人工生命中的关键挑战是设计能够展示复杂行为涌现的系统。 许多这样的系统依赖于高维参数空间，其中只有一小部分参数表现出有趣的动态。 专注于连续系统的情况，我们引入了“相变查找器”（PTF）算法，该算法可用于高效生成位于两个相之间的边界参数。 我们认为这些点更有可能表现出复杂的行为，并通过将PTF应用于Lenia来验证这一点，结果显示它能使有趣行为的频率提高两倍以上，同时保持足够高效以进行大规模搜索。 显示英文摘要

摘要： 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.