Abstract
Periodic configurations, or oscillators, occur in many cellular automata. In an oscillator, repeated applications of the automaton rules eventually restore the configuration to its initial state. This paper considers oscillators in Conway's Life; analogous techniques should apply to other rules. Three explicit methods are presented to construct oscillators in Life while guaranteeing certain complexity bounds, leading to the existence of • an infinite sequence Kn of oscillators of periods n = 58, 59, 60, … and uniformly bounded population, and • an infinite sequence Dn of oscillators of periods n = 58, 59, 60, … and diameter bounded by b√log n, where b is a uniform constant. The proofs make use of the first explicit example of a stable glider reflector in Life, solving a longstanding open question about this cellular automaton.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
