Difference between revisions of "Unit cell"
(fixed ref) |
(ce) |
||
| Line 18: | Line 18: | ||
Certain basic infinite-growth patterns could arguably be considered replicators that simulate rules such as [https://www.conwaylife.com/forums/viewtopic.php?f=11&t=2238&p=50033#p50033 Rule 50] and [https://www.conwaylife.com/forums/viewtopic.php?f=11&t=2238&p=50033#p50392 Rule 254]. | Certain basic infinite-growth patterns could arguably be considered replicators that simulate rules such as [https://www.conwaylife.com/forums/viewtopic.php?f=11&t=2238&p=50033#p50033 Rule 50] and [https://www.conwaylife.com/forums/viewtopic.php?f=11&t=2238&p=50033#p50392 Rule 254]. | ||
Interestingly, the U-pentomino is a period 8 natural replicator that emulates [ | Interestingly, the U-pentomino is a period 8 natural replicator that emulates [[Rule 110]] in rules between B2ei3aci4aei5kqr7e/S01c2-kn3ijry4citwy5aeiq and B2ein3acikq4-jrty5-ceiy6-ck78/S01c2-k3-acen4-a5-jny6-c78. This pattern was found by iNoMed<ref name="post116434" /> and got 2nd place at the [[OCA Discovery of the Year#2020|OCA Discovery of the Year]] contest. In the 1st of January 2021, AforAmpere found<ref name="post117657" /> a faster one, the T-tetromino with period 2 in rules supporting rules from B2ai3aeir4r5ei/S3e5e6i to B2-c34-i56-i78/S2-ai3-i4-e5678. | ||
So far, the following 1D rules are known: | So far, the following 1D rules are known: | ||
| Line 38: | Line 38: | ||
=== Constructions === | === Constructions === | ||
Complex one-dimensional cellular automata usually can be simulated via constructed unit cells. Purpose of this is basically the containing automaton inherits some useful properties of the embedded, which is usually not trivial to prove. Such properties are logic universality, Turing-completeness etc. It is known that many examples are constructed in order to simulate [ | Complex one-dimensional cellular automata usually can be simulated via constructed unit cells. Purpose of this is basically the containing automaton inherits some useful properties of the embedded, which is usually not trivial to prove. Such properties are logic universality, Turing-completeness etc. It is known that many examples are constructed in order to simulate [[Rule 110]] and allegedly [https://en.wikipedia.org/wiki/Rule_30 Rule 30] in one case. One is constructed in CGoL by [[Jason Summers]]<ref>{{Cite web|url=http://pentadecathlon.com/lifenews/2005/12/rule_110_unit_cell.html|title="Rule 110" Unit Cell|work=Game of Life News|author=Hienrich Koenig|date=December 21, 2005|accessdate=March 29, 2018}}</ref> and later it was trivially shown using [[Golly]] that it is a polyglot (works in [[EightLife]], too) | ||
==== Selection of life-like rules with constructed W110 unit cells ==== | ==== Selection of life-like rules with constructed W110 unit cells ==== | ||
Revision as of 18:08, 5 May 2021
A unit cell (or metacell) is a subset (usually rectangular or square) of the Life plane that tiles over the plane, along with a fixed number of distinct patterns, with each tile assuming one of the patterns, such that it simulates a cellular automaton, possibly itself. A unit Life cell is a unit cell that simulates the Game of Life. To avoid single cells themselves being considered unit cells, the size of a unit cell must be greater than 1×1. It is also a restriction that only finite sized patterns are accepted as unit cells excluding infinite one-cell thick bars in HighLife for example, which simulates Rule 54; many amphichiral 1D elementary automata can be embedded in other rules via this method.
Simulating a 2D cellular automaton
The first unit Life cell was constructed by David Bell in 1996.[1] It employs standard glider logic to determine whether or not a glider should be present. The two states differ by a single glider. In 2004, Jared Prince modified David Bell's unit Life cell to support two (and therefore multiple) layers of Life universes, coined "deep cell".[2]
Around 2005, the OTCA metapixel was constructed, which can simulate any Life-like cellular automaton.[3] Designed to run quickly in HashLife, it has the advantage of having two states that are clearly distinct when zoomed out.
The P1 megacell, designed in 2008, has clearly visible states like the OTCA metapixel. It is capable of simulating any rule, including non-totalistic and asymmetric rules, that uses the standard eight-cell neighborhood. It also has unusual positioning, being a square with diagonal edges. This allows much of its information to be transmitted with gliders.
The 0E0P metacell is currently the largest unit cell. Unlike other unit cells, it can function without any form of support circuitry, allowing it to produce the first examples of exotic patterns such as parity-rule replicators and reflectorless rotating oscillators in Life when programmed correctly. Rather than having an "on" state or an "off" state, it deconstructs itself when it turns off and is built by its neighbors when it is turned on.
Simulating a 1D cellular automaton
Natural occurrences
Most replicators can be described as simulating a one-dimensional cellular automaton. For example, the replicator in HighLife can be described as simulating Rule 90 (for the 3-cell neighbourhood, or Rule 6 for the two-cell, range-1/2 neighbourhood).
Certain basic infinite-growth patterns could arguably be considered replicators that simulate rules such as Rule 50 and Rule 254.
Interestingly, the U-pentomino is a period 8 natural replicator that emulates Rule 110 in rules between B2ei3aci4aei5kqr7e/S01c2-kn3ijry4citwy5aeiq and B2ein3acikq4-jrty5-ceiy6-ck78/S01c2-k3-acen4-a5-jny6-c78. This pattern was found by iNoMed[4] and got 2nd place at the OCA Discovery of the Year contest. In the 1st of January 2021, AforAmpere found[5] a faster one, the T-tetromino with period 2 in rules supporting rules from B2ai3aeir4r5ei/S3e5e6i to B2-c34-i56-i78/S2-ai3-i4-e5678.
So far, the following 1D rules are known:
- Rule 0[6]
- Rule 2[6]
- Rule 4[6]
- Rule 16[6]
- Rule 22[6]
- Rule 32[6]
- Rule 50[6]
- Rule 90[6]
- Rule 110[4][5]
- Rule 128[6]
- Rule 150[6]
- Rule 254[6]
Rules of larger ranges are also known:
- Rule W1208925819614629174771760[6]
Constructions
Complex one-dimensional cellular automata usually can be simulated via constructed unit cells. Purpose of this is basically the containing automaton inherits some useful properties of the embedded, which is usually not trivial to prove. Such properties are logic universality, Turing-completeness etc. It is known that many examples are constructed in order to simulate Rule 110 and allegedly Rule 30 in one case. One is constructed in CGoL by Jason Summers[7] and later it was trivially shown using Golly that it is a polyglot (works in EightLife, too)
Selection of life-like rules with constructed W110 unit cells
- B3[8]/S23[8] polyglot: works in Life, EightLife, Pedestrian Life and HoneyLife[8]
- Banks-I: proves logic universality using Cook's results, simplifying Banks' proofs from 1971[9]
- B35/S236[10]
- DryLife and 3 more[11]
References
- ↑ Paul Callahan (March 1, 1996). "The Unit Life Cell".
- ↑ Jared Prince (September 27, 2004). "Game of Life Deep Cell".
- ↑ Brice Due (May 28, 2006). "How Does It Work?". OTCAmetapixel. Retrieved on March 26, 2009.
- ↑ 4.0 4.1 toroidalet (December 19, 2020). Re: Rules with interesting replicators (discussion thread) at the ConwayLife.com forums
- ↑ 5.0 5.1 AforAmpere (January 1, 2021). Re: Rules with interesting replicators (discussion thread) at the ConwayLife.com forums
- ↑ 6.00 6.01 6.02 6.03 6.04 6.05 6.06 6.07 6.08 6.09 6.10 6.11 muzik (June 29, 2018). Replicators and other patterns that simulate even 1D rules (discussion thread) at the ConwayLife.com forums
- ↑ Hienrich Koenig (December 21, 2005). ""Rule 110" Unit Cell". Game of Life News. Retrieved on March 29, 2018.
- ↑ Peter Naszvadi (November 21, 2017). FWSS-less MWSS-track-only Rule-110 Unit Cell (discussion thread) at the ConwayLife.com forums
- ↑ Peter Naszvadi (November 1, 2017). Re: List of the Turing-complete totalistic life-like CA (discussion thread) at the ConwayLife.com forums
- ↑ Peter Naszvadi (October 14, 2017). Re: List of the Turing-complete totalistic life-like CA (discussion thread) at the ConwayLife.com forums
- ↑ Peter Naszvadi (March 29, 2018). Re: List of the Turing-complete totalistic life-like CA (discussion thread) at the ConwayLife.com forums
External links
- Unit cell at the Life Lexicon
- Metacell at the Life Lexicon