Problem
Research questions and friction points this paper is trying to address.
Study preimage computation in Game of Life
Show backwards step is computationally universal
Prove preimage existence for periodic points undecidable
Computing backwards with Game of Life, part 1: wires and circuits
🤖 AI Summary
This paper investigates the computational complexity and decidability of single-step preimage computation (inverse evolution) in Conway’s Game of Life. To establish hardness results, the authors construct programmable logical components—namely, wires and Boolean gates—within the Game of Life lattice, combining exhaustive search with hand-crafted designs. They rigorously prove that single-step preimage computation is Turing-complete, thereby enabling encodings of arbitrary Boolean satisfiability or tiling problems. The orphan configuration problem (i.e., determining whether a given pattern has no predecessor) is shown to be coNP-complete. Moreover, while periodic configurations may admit preimages, they need not admit *periodic* preimages—a counterexample of size 6210 × 37800 is explicitly constructed. Finally, the existence of a periodic preimage for a given periodic configuration is proven undecidable. These results collectively uncover the profound computational richness of the Game of Life’s inverse dynamics.
📝 Abstract
Conway's Game of Life is a two-dimensional cellular automaton. As a dynamical system, it is well-known to be computationally universal, i.e. capable of simulating an arbitrary Turing machine. We show that in a sense taking a single backwards step of Game of Life is a computationally universal process, by constructing patterns whose preimage computation encodes an arbitrary circuit-satisfaction problem, or (equivalently) any tiling problem. As a corollary, we obtain for example that the set of orphans is coNP-complete, exhibit a $6210 imes 37800$-periodic configuration that admits a preimage but no periodic one, and prove that the existence of a preimage for a periodic point is undecidable. Our constructions were obtained by a combination of computer searches and manual design.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Backwards step encodes circuit-satisfaction problems
Combines computer searches with manual design
Proves preimage existence undecidable for periodic points
🔎 Similar Papers
No similar papers found.
