English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study a Life-like cellular automaton rule $B2/S2345$ where a cell in state`0' takes state `1' if it has exactly two neighbors in state `1' and the cellremains in the state `1' if it has between two and five neighbors in state `1.'This automaton is a discrete analog spatially extended chemical media,combining both properties of sub-excitable and precipitating chemical media.When started from random initial configuration B2/S2345 automaton exhibitschaotic behavior. Configurations with low density of state `1' show emergenceof localized propagating patterns and stationary localizations. We constructbasic logical gates and elementary arithmetical circuits by simulating logicalsignals with mobile localizations reaction propagating geometrically restrictedby stationary non-destructible localizations. Values of Boolean variables areencoded into two types of patterns --- symmetric (False) and asymmetric (True)patterns --- which compete for the `empty' space when propagate in thechannels. Implementations of logical gates and binary adders are illustratedexplicitly.

Computation with competing patterns in Life-like automaton