The '''logarithmic replicator rule''' is a [[Life-like cellular automaton]] in which [[cell]]s survive from one [[generation]] to the next if they have 2, 4, or 5 [[Moore neighbourhood|neighbours]] and are born if they have 3 or 6 neighbours. It is extremely similar to [[Move]], differing only by the <tt>B8</tt> transition. The time required to stabilize is generally much shorter than in [[Conway's Game of Life]].
The '''logarithmic replicator rule''' is a [[Life-like cellular automaton]] in which [[cell]]s survive from one [[generation]] to the next if they have 2, 4, or 5 [[Moore neighbourhood|neighbours]] and are born if they have 3 or 6 neighbours. It is extremely similar to [[Move]], differing only by the <tt>B8</tt> transition. The time required to stabilize is generally much shorter than in [[Conway's Game of Life]].
On August 19, {{year|2020}}, [[Peter Naszvadi]] constructed a [https://en.wikipedia.org/wiki/Rule_110 Rule 110] [[unit cell]] in B36/S245, proving the rule Turing-complete.<ref name="post102490" />
On August 19, {{year|2020}}, [[Peter Naszvadi]] constructed a [[Rule 110]] [[unit cell]] in B36/S245, proving the rule Turing-complete.<ref name="post102490" />
This article is a stub. You can help LifeWiki by expanding it.
The logarithmic replicator rule is a Life-like cellular automaton in which cells survive from one generation to the next if they have 2, 4, or 5 neighbours and are born if they have 3 or 6 neighbours. It is extremely similar to Move, differing only by the B8 transition. The time required to stabilize is generally much shorter than in Conway's Game of Life.
The name of this rule comes from an elementary replicator first discovered by Mark Niemiec. Unlike other replicators, (such as the one from HighLife) this one does not reproduce itself cleanly, instead leaving oscillators behind which result in a more chaotic growth pattern.[2]
