移民博弈中开放进化的条件
Conditions for Open-Ended Evolution in Immigration Games
摘要：
移民游戏（由Don Woods于1971年发明）扩展了单人纸牌游戏（由John Conway于1970年发明），使两人竞争成为可能。移民博弈可以用在自然选择的进化模型中，在这个模型中，适应性是用竞争来衡量的。生命游戏的规则属于一个拥有262，144名成员的家庭，即家庭主义规则。伍兹将生命游戏转化为双人游戏的方法推广到了8,192个博弈规则家族的成员。在本文中，我们把最初的移民博弈称为生命移民博弈，我们把8,192个推广的移民博弈（包括生命移民博弈）称为生命移民博弈。我们在这里研究的问题是，8,192个移民博弈中的一个适合于建模开放式进化的条件是什么？我们在这里的重点是特别的规则的条件，而不是进化模型的其他方面的条件。在以前的工作中，有人认为生命游戏规则的图灵完备性可能是使用生命移民游戏成功进化的必要条件。在这里，我们提出的证据表明，图灵完备性是移民游戏规则的充分条件，但不是必要条件。证据表明，对于开放式进化，移民游戏规则的一个必要和充分条件是，规则应该允许增长。
英文摘要：
The Immigration Game (invented by Don Woods in 1971) extends the solitaire Game of Life (invented by John Conway in 1970) to enable two-player competition. The Immigration Game can be used in a model of evolution by natural selection, where fitness is measured with competitions. The rules for the Game of Life belong to the family of semitotalistic rules, a family with 262,144 members. Woods' method for converting the Game of Life into a two-player game generalizes to 8,192 members of the family of semitotalistic rules. In this paper, we call the original Immigration Game the Life Immigration Game and we call the 8,192 generalizations Immigration Games (including the Life Immigration Game). The question we examine here is, what are the conditions for one of the 8,192 Immigration Games to be suitable for modeling open-ended evolution? Our focus here is specifically on conditions for the rules, as opposed to conditions for other aspects of the model of evolution. In previous work, it was conjectured that Turing-completeness of the rules for the Game of Life may have been necessary for the success of evolution using the Life Immigration Game. Here we present evidence that Turing-completeness is a sufficient condition on the rules of Immigration Games, but not a necessary condition. The evidence suggests that a necessary and sufficient condition on the rules of Immigration Games, for open-ended evolution, is that the rules should allow growth.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
