OCA:HoneyLife

From LifeWiki
(Redirected from HoneyLife)
Jump to navigation Jump to 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 HoneyLife 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.

On November 21, 2017, Peter Naszvadi constructed a Rule 110 unit cell in HoneyLife, proving the rule Turing-complete.[2] The pattern is based on eater 1, middleweight spaceship, twin bees shuttle and p46 gliderless MWSS gun, therefore it also applies to Pedestrian Life and EightLife.

There is also an earlier proof sketch of HoneyLife's universality. It is on ConwayLife forums,[3] 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 (November 21, 2017). FWSS-less MWSS-track-only Rule-110 Unit Cell (discussion thread) at the ConwayLife.com forums
  3. Peter Naszvadi (December 12, 2016). Re: List of the Turing-complete totalistic life-like CA (discussion thread) at the ConwayLife.com forums

External links