OCA:HoneyLife

From LifeWiki
(Redirected from HoneyLife)
Jump to: navigation, search
HoneyLife
HoneyLife rule
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

The Turing-completeness of EightLife was mentioned in a poor quality article,[1] but the article failed to list the necessary patterns and reactions inherited from Conway's Game of Life for creating any kind of pattern that proves universality. 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 Pedestrian Life's universality. It is on ConwayLife forums,[2] which contains a proof-scheme covering all rules in the outer-totalistic rulespace between B3/S23 and B3678/S23678.

References

  1. 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.
  2. Peter Naszvadi. Re: List of the Turing-complete totalistic life-like CA (discussion thread) at the ConwayLife.com forums

External links