HoneyLife

From LifeWiki
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

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

  1. http://repositorio.uam.es/bitstream/handle/10486/664759/fine_soler_JGPS_2013_ampl.pdf?sequence=2
  2. "List of the Turing-complete totalistic life-like CA".

External links