Jump to content

Oscillator (cellular automaton)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 04:57, 4 April 2014 (Undid revision 602678491 by 96.50.29.144 (talk) try reading it again more carefully. One of them has a period that is not 17.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In a cellular automaton, an oscillator is a pattern that returns to its original state, in the same orientation and position, after a finite number of generations. Thus the evolution of such a pattern repeats itself indefinitely. Depending on context, the term may also include spaceships as well.

The smallest number of generations it takes before the pattern returns to its initial condition is called the period of the oscillator. An oscillator with a period of 1 is usually called a still life, as such a pattern never changes. Sometimes, still lifes are not taken to be oscillators. Another common stipulation is that an oscillator must be finite.

Examples

In Conway's Game of Life, finite oscillators are known to exist for all periods except 19, 23, 38 and 41. Additionally, while oscillators exist for period 34, the only known examples are considered trivial because they consist of essentially separate components that oscillate at smaller periods. For instance, one can create a period 34 oscillator by placing period 2 and period 17 oscillators so that they do not interact. An oscillator is considered non-trivial if it contains at least one cell that oscillates at the necessary period.