5,410 research outputs found
A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications
Cellular automata (CAs) are dynamical systems which exhibit complex global
behavior from simple local interaction and computation. Since the inception of
cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention
of several researchers over various backgrounds and fields for modelling
different physical, natural as well as real-life phenomena. Classically, CAs
are uniform. However, non-uniformity has also been introduced in update
pattern, lattice structure, neighborhood dependency and local rule. In this
survey, we tour to the various types of CAs introduced till date, the different
characterization tools, the global behaviors of CAs, like universality,
reversibility, dynamics etc. Special attention is given to non-uniformity in
CAs and especially to non-uniform elementary CAs, which have been very useful
in solving several real-life problems.Comment: 43 pages; Under review in Natural Computin
Complexity Measures from Interaction Structures
We evaluate new complexity measures on the symbolic dynamics of coupled tent
maps and cellular automata. These measures quantify complexity in terms of
-th order statistical dependencies that cannot be reduced to interactions
between units. We demonstrate that these measures are able to identify
complex dynamical regimes.Comment: 11 pages, figures improved, minor changes to the tex
Complexity, parallel computation and statistical physics
The intuition that a long history is required for the emergence of complexity
in natural systems is formalized using the notion of depth. The depth of a
system is defined in terms of the number of parallel computational steps needed
to simulate it. Depth provides an objective, irreducible measure of history
applicable to systems of the kind studied in statistical physics. It is argued
that physical complexity cannot occur in the absence of substantial depth and
that depth is a useful proxy for physical complexity. The ideas are illustrated
for a variety of systems in statistical physics.Comment: 21 pages, 7 figure
Complex network statistics to the design of fire breaks for the control of fire spreading
A computational approach for identifying efficient fuel breaks partitions for the containment of fire incidents in forests is proposed. The approach is based on the complex networks statistics, namely the centrality measures and cellular automata modeling. The efficiency of various centrality statistics, such as betweenness, closeness, Bonacich and eigenvalue centrality to select fuel breaks partitions vs. the random-based distribution is demonstrated. Two examples of increasing complexity are considered: (a) an artificial forest of randomly distributed density of vegetation, and (b) a patch from the area of Vesuvio, National Park of Campania, Italy. Both cases assume flat terrain and single type of vegetation. Simulation results over an ensemble of lattice realizations and runs show that the proposed approach appears very promising as it produces statistically significant better outcomes when compared to the random distribution approach
On the Algorithmic Nature of the World
We propose a test based on the theory of algorithmic complexity and an
experimental evaluation of Levin's universal distribution to identify evidence
in support of or in contravention of the claim that the world is algorithmic in
nature. To this end we have undertaken a statistical comparison of the
frequency distributions of data from physical sources on the one
hand--repositories of information such as images, data stored in a hard drive,
computer programs and DNA sequences--and the frequency distributions generated
by purely algorithmic means on the other--by running abstract computing devices
such as Turing machines, cellular automata and Post Tag systems. Statistical
correlations were found and their significance measured.Comment: Book chapter in Gordana Dodig-Crnkovic and Mark Burgin (eds.)
Information and Computation by World Scientific, 2010.
(http://www.idt.mdh.se/ECAP-2005/INFOCOMPBOOK/). Paper website:
http://www.mathrix.org/experimentalAIT
- âŠ