OCA:LowDeath
LowDeath  


Rulestring  238/368 B368/S238 


Rule integer  137544  
Character  Chaotic  
Black/white reversal  B123478/S134678 
LowDeath is a Lifelike 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, 6 or 8 neighbours.
Patterns
Many patterns from HighLife are compatible with this rule. HighLife's replicator works in this rule, albeit with a different evolution sequence due to the result of Pedestrian Life's pedestrian effect.
Universality
There is a proof sketch of LowDeaths's universality. It is on ConwayLife forums,^{[1]} which contains a proofscheme covering all rules in the outertotalistic rulespace between B3/S23 and B3678/S23678.
An explicit Rule 110 unit cell construction^{[2]} proves its Turingcompleteness; the pattern itself is a metapolyglot working in three other lifelike cellular automata rules between B36/S23 and B368/S238; the first rule is also known as HighLife, in which the native replicator  of which several parts of the unit cell based on  has a slightly different evolution sequence.
References
 ↑ Peter Naszvadi (December 12, 2016). Re: List of the Turingcomplete totalistic lifelike CA (discussion thread) at the ConwayLife.com forums
 ↑ Peter Naszvadi (July 29, 2018). "List of the Turingcomplete totalistic lifelike CA". ConwayLife.com forums. Retrieved on Jan 7, 2020.
External links
 LowDeath at Adam P. Goucher's Catagolue
 LowDeath at David Eppstein's Glider Database