论文标题
移民游戏中开放式演变的条件
Conditions for Open-Ended Evolution in Immigration Games
论文作者
论文摘要
移民游戏（由唐·伍兹（Don Woods）于1971年发明）扩展了生命的纸牌游戏（约翰·康威（John Conway）于1970年发明），以实现两人比赛。移民游戏可以通过自然选择的进化模型中使用，其中适应性是通过比赛来衡量的。生命游戏规则属于半定规规则家族，一个有262,144名成员的家庭。伍兹将生活游戏转化为两人游戏的方法将限制为8192个半决法规则的成员。在本文中，我们称原始移民游戏为“生命移民游戏”，我们称之为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.
