Hubbry Logo
search button
Sign in
Oscillator (cellular automaton)
Oscillator (cellular automaton)
Comunity Hub
History
arrow-down
starMore
arrow-down
bob

Bob

Have a question related to this hub?

bob

Alice

Got something to say related to this hub?
Share it here.

#general is a chat channel to discuss anything related to the hub.
Hubbry Logo
search button
Sign in
Oscillator (cellular automaton)
Community hub for the Wikipedia article
logoWikipedian hub
Welcome to the community hub built on top of the Oscillator (cellular automaton) Wikipedia article. Here, you can discuss, collect, and organize anything related to Oscillator (cellular automaton). The pu...
Add your contribution
Oscillator (cellular automaton)

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.

An oscillator is considered non-trivial if it contains at least one cell that oscillates at the necessary period. This means, for example, the mere juxtaposition of a period-17 oscillator and a period-4 oscillator is not a period-68 oscillator.

This article by default considers non-trivial oscillators in Conway's Game of Life, though this concept generalizes to all cellular automata.

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.

Types

[edit]

Oscillators had been identified and named as early as 1971.[1]

David Buckingham identified in 1996 a family of patterns named "Herschel conduits", with which one can construct arbitrary period n oscillators for every n ≥ 58, and true period n guns for every n ≥ 62.[2] The discovery of the "Snark" by Mike Playle in April 2013 allowed the construction of oscillators of all periods n ≥ 43. It consisted of 4 "mirrors" for gliders, arranged in a rectangular loop, so that by simply enlarging the loop, oscillators of increasing periods could be made. Smaller than period-43 is impossible by this construction, since it would cause the 4 mirrors to interfere with each other.[3]

The last remaining oscillator periods were constructed in 2023, proving Conway's Game of Life omniperiodic.[4][5] A brief review of the history of oscillator constructions is in the paper.[6]

Examples

[edit]

References

[edit]
  1. ^ Robert T. Wainwright, ed. (March 1971). "Lifeline Volume 1".
  2. ^ "Buckingham on B-heptomino/Herschel oscillators". www.radicaleye.com. Retrieved 2025-03-23.
  3. ^ "Omniperiodic - LifeWiki".
  4. ^ "LifeWiki:Game of Life Status page - LifeWiki". conwaylife.com. Retrieved 2023-12-16.
  5. ^ Stone, Alex (2024-01-18). "Math's 'Game of Life' Reveals Long-Sought Repeating Patterns". Quanta Magazine. Retrieved 2024-01-18.
  6. ^ Brown, Nico; Cheng, Carson; Jacobi, Tanner; Karpovich, Maia; Merzenich, Matthias; Raucci, David; Riley, Mitchell (5 December 2023). "Conway's Game of Life is Omniperiodic". arXiv:2312.02799 [math.CO].
[edit]