A note on elementary cellular automata classification
GJ Martinez - arxiv preprint arxiv:1306.5577, 2013 - arxiv.org
We overview and compare classifications of elementary cellular automata, including
Wolfram's, Wuensche's, Li and Packard, communication complexity, power spectral …
Wolfram's, Wuensche's, Li and Packard, communication complexity, power spectral …
Designing complex dynamics in cellular automata with memory
Since their inception at Macy conferences in later 1940s, complex systems have remained
the most controversial topic of interdisciplinary sciences. The term" complex system" is the …
the most controversial topic of interdisciplinary sciences. The term" complex system" is the …
Shift-equivalence of k-ary, one-dimensional cellular automata rules
Cellular automata are locally-defined, synchronous, homogeneous, fully discrete dynamical
systems. In spite of their typically simple local behaviour, many are capable of showing …
systems. In spite of their typically simple local behaviour, many are capable of showing …
Quantum-inspired identification of complex cellular automata
Elementary cellular automata (ECA) present iconic examples of complex systems. Though
described only by one-dimensional strings of binary cells evolving according to nearest …
described only by one-dimensional strings of binary cells evolving according to nearest …
Emergence of density dynamics by surface interpolation in elementary cellular automata
A classic problem in elementary cellular automata (ECAs) is the specification of numerical
tools to represent and study their dynamical behaviour. Mean field theory and basins of …
tools to represent and study their dynamical behaviour. Mean field theory and basins of …
Advances in the study of elementary cellular automata regular language complexity
Cellular automata (CA) are discrete dynamical systems that, out of the fully local action of its
state transition rule, are capable of generating a multitude of global patterns, from the trivial …
state transition rule, are capable of generating a multitude of global patterns, from the trivial …
Irreducible elementary cellular automata found
W Dzwinel, K Magiera - Journal of Computational Science, 2015 - Elsevier
Many multi-scale systems can be greatly simplified by using successive coarse-graining
(CG) for approximation of microscopic degrees of freedom. As shown by Israeli and …
(CG) for approximation of microscopic degrees of freedom. As shown by Israeli and …
Quantum Inference Protocol: from origination to application
MSH Ho - 2021 - dr.ntu.edu.sg
We are at the interface of two hot research areas–modelling of stochastic processes with
causal models in quantitative science, and quantum simulation on real quantum devices …
causal models in quantitative science, and quantum simulation on real quantum devices …
A Spectral Outlook on the Elementary Cellular Automata with Cyclic Configurations and Block-Sequential Asynchronous Updates
Spectral analysis has been used previously in the literature to analyse the space-time
diagrams of the elementary cellular automata in the frequency domain, as it allows for a …
diagrams of the elementary cellular automata in the frequency domain, as it allows for a …
When can cognitive agents be modeled analytically versus computationally?
L Caldwell - Distributed Computing and Artificial Intelligence, 11th …, 2014 - Springer
When agents are modelled with psychologically realistic decision making rules, the
assumptions made about their decisions and behaviour are usually more complex than …
assumptions made about their decisions and behaviour are usually more complex than …