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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We consider the problem of computing a response curve for binary cellularautomata -- that is, the curve describing the dependence of the density of onesafter many iterations of the rule on the initial density of ones. Wedemonstrate how this problem could be approached using rule 130 as an example.For this rule, preimage sets of finite strings exhibit recognizable patterns,and it is therefore possible to compute both cardinalities of preimages ofcertain finite strings and probabilities of occurrence of these strings in aconfiguration obtained by iterating a random initial configuration $n$ times.Response curves can be rigorously calculated in both one- and two-dimensionalversions of CA rule 130. We also discuss a special case of totally disorderedinitial configurations, that is, random configurations where the density ofones and zeros are equal to 1/2.

Probabilistic initial value problem for cellular automaton rule 172