OCA:HoneyLife
| HoneyLife | |
| View static image | |
| View animated image | |
| Rulestring | 238/38 B38/S238 |
|---|---|
| Rule integer | 137480 |
| Character | Chaotic |
| Black/white reversal | B123478/S1234678 |
HoneyLife is a Life-like cellular automaton in which cells survive from one generation to the next if they have 2, 3 or 8 neighbours, and are born if they have 3 or 8 neighbours.
Patterns
Many patterns from regular Life are compatible with this rule.
Universality
Its Turing-completeness was mentioned in a poor quality article,[1] but it is baloney in this aspect, because didn't list the necessary patterns and reactions inherited from Conway's Game of Life for creating any kind of patterns that proves universality, just mentioning their existence. The same applies to Pedestrian Life and EightLife; the latter rule has a constructive proof for its Turing-completeness.
There is a proof sketch of HoneyLife's universality. It is on conwaylife forums,[2] which contains a proof-scheme covering all rules that support glider and their rulestring matches B3[678]*/S23[678]*.
References
- ↑ Francisco José Soler Gil, Manuel Alfonesca (July 2013). "Fine tuning explained? Multiverses and cellular automata". Journal for General Philosophy of Science. Retrieved on January 21, 2017.
- ↑ Peter Naszvadi (December 12, 2016). Re: List of the Turing-complete totalistic life-like CA (discussion thread) at the ConwayLife.com forums
External links
HoneyLife at Adam P. Goucher's Catagolue HoneyLife at David Eppstein's Glider Database