Conditions for Open-Ended Evolution in Immigration Games
Peter D. Turney

TL;DR
This paper investigates the conditions under which Immigration Games, generalizations of Conway's Game of Life, can support open-ended evolution, emphasizing the importance of rule growth potential over Turing-completeness.
Contribution
It establishes that rule growth capability, rather than Turing-completeness, is the key condition for open-ended evolution in Immigration Games.
Findings
Turing-completeness is sufficient but not necessary for evolution.
Rules enabling growth are necessary and sufficient for open-ended evolution.
The study extends understanding of conditions for evolution in cellular automaton-based models.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications · Evolutionary Game Theory and Cooperation · Digital Games and Media
