Search results
Omniperiodic
- Conway's Game of Life is omniperiodic, since there are oscillators of every period, with the last found period being p41 in July 2023.
conwaylife.com/wiki/Omniperiodic
Dec 5, 2023 · At the turn of the millennium, only twelve oscillator periods remained to be found in Conway's Game of Life. The search has finally ended, with the discovery of oscillators having the final two periods, 19 and 41, proving that Life is omniperiodic.
Conway’s Game of Life is a cellular automaton occurring on an infinite plane of square grid cells, each of which is in one of two states: alive or dead. The neighbourhood of a cell is the 8 cells that are connected orthogonally or diagonally to it.
Jan 18, 2024 · John Conway’s Game of Life, a famous cellular automaton, has been found to have periodic patterns of every possible length. This pattern in the Game of Life repeats itself after 41 steps. Its recent discovery ends a decades-long quest to show that Life is omniperiodic. DVDP for Quanta Magazine.
Dec 13, 2023 · This proves once and for all that the Game of Life is indeed omniperiodic. Mitchell and co’s paper describes all 43 of these oscillators along with the techniques that computer scientists and mathematicians have developed to find them and build ever more capable oscillators.
At the turn of the millennium, only twelve oscillator periods remained to be found in Conway's Game of Life. The search has finally ended, with the discovery of oscillators having the final two periods, 19 and 41, proving that Life is omniperiodic.
Dec 5, 2023 · A cellular automaton is called omniperiodic if there exist oscillators of all periods. At the turn of the millennium, only twelve oscillator periods remained to be found in Conway's Game of Life. The search has finally ended, with the discovery of oscillators having the final two periods, 19 and 41, proving that Life is omniperiodic.
Theorem. Life is omniperiodic. 1 Conway’s Game of Life Conway’s Game of Life [14] is a cellular automaton occurring on an infinite plane of square grid cells, each of which is in one of two states: alive or dead. The neighbourhood of a cell is the 8 cells that are connected orthogonally or diagonally to it.
