Self-Organization of Random Cellular Automata: Four Snapshots

1994 ◽  
pp. 49-67 ◽  
Author(s):  
David Griffeath
Keyword(s):  
Cellular Automata ◽  
Self Organization

A Simple Three-States Cellular Automaton for Modelling Excitable Media

1998 ◽  
Vol 12 (05) ◽  
pp. 601-607 ◽  
Author(s):  
M. Andrecut
Keyword(s):  
Wave Propagation ◽  
Partial Differential Equations ◽  
Cellular Automata ◽  
Differential Equations ◽  
Cellular Automaton ◽  
Cellular Automaton Model ◽  
Excitable Media ◽  
Self Organization ◽  
Partial Differential ◽  
Bz Reaction

Wave propagation in excitable media provides an important example of spatiotemporal self-organization. The Belousov–Zhabotinsky (BZ) reaction and the impulse propagation along nerve axons are two well-known examples of this phenomenon. Excitable media have been modelled by continuous partial differential equations and by discrete cellular automata. Here we describe a simple three-states cellular automaton model based on the properties of excitation and recovery that are essential to excitable media. Our model is able to reproduce the dynamics of patterns observed in excitable media.

scholarly journals Deterministic phase transitions and self-organization in logistic cellular automata

2019 ◽  
Vol 100 (4) ◽  
Author(s):  
M. Ibrahimi ◽  
O. Gulseren ◽  
S. Jahangirov
Keyword(s):  
Phase Transitions ◽  
Cellular Automata ◽  
Self Organization

FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA

2004 ◽  
Vol 15 (06) ◽  
pp. 893-915 ◽  
Author(s):  
TEIJIRO ISOKAWA ◽  
FUKUTARO ABO ◽  
FERDINAND PEPER ◽  
SUSUMU ADACHI ◽  
JIA LEE ◽  
...  
Keyword(s):  
Cellular Automata ◽  
Fault Tolerant ◽  
Regular Structure ◽  
Error Correcting Codes ◽  
Self Organization ◽  
Nanometer Scale ◽  
Chemical Manufacturing ◽  
Asynchronous Cellular Automata ◽  
Integration Density ◽  
Manufacturing Techniques

Cellular Automata (CA) are a promising architecture for computers with nanometer-scale sized components, because their regular structure potentially allows chemical manufacturing techniques based on self-organization. With the increase in integration density, however, comes a decrease in the reliability of the components from which such computers will be built. This paper employs BCH error-correcting codes to construct CA with improved reliability. We construct an asynchronous CA of which a quarter of the (ternary) bits storing a cell's state information may be corrupted without affecting the CA's operations, provided errors are evenly distributed over a cell's bits (no burst errors allowed). Under the same condition, the corruption of half of a cell's bits can be detected.

scholarly journals Quantifying self-organization in cyclic cellular automata

2003 ◽  
Author(s):  
Cosma R. Shalizi ◽  
Kristina L. Shalizi
Keyword(s):  
Cellular Automata ◽  
Self Organization

Complexity Measurement Based on Information Theory and Kolmogorov Complexity

2015 ◽  
Vol 21 (2) ◽  
pp. 205-224 ◽  
Author(s):  
Leong Ting Lui ◽  
Germán Terrazas ◽  
Hector Zenil ◽  
Cameron Alexander ◽  
Natalio Krasnogor
Keyword(s):  
Information Theory ◽  
Cellular Automata ◽  
Kolmogorov Complexity ◽  
The Self ◽  
Self Organization ◽  
The Past ◽  
Elementary Cellular Automata ◽  
Complexity Measurement

In the past decades many definitions of complexity have been proposed. Most of these definitions are based either on Shannon's information theory or on Kolmogorov complexity; these two are often compared, but very few studies integrate the two ideas. In this article we introduce a new measure of complexity that builds on both of these theories. As a demonstration of the concept, the technique is applied to elementary cellular automata and simulations of the self-organization of porphyrin molecules.

Sign in / Sign up

Export Citation Format

Share Document