Synchronous and Asynchronous Updating in Cellular Automata

Author(s):  
Birgitt Schönfisch ◽  
André de Roos
Author(s):  
Souvik Roy ◽  
Sukanta Das

In the light of recent developments in the theory of reversibility for asynchronous cellular automata, we attempt to explore the dynamics of recurrent rules under fully asynchronous updating scheme. Depending on the reachability of the configurations for a communication class during the evolution of the system, we classify the recurrent rules into two classes — partially exposed recurrent system and fully exposed recurrent system.


Entropy ◽  
2021 ◽  
Vol 23 (11) ◽  
pp. 1376
Author(s):  
Yukio-Pegio Gunji ◽  
Daisuke Uragami

Asynchronously tuned elementary cellular automata (AT-ECA) are described with respect to the relationship between active and passive updating, and that spells out the relationship between synchronous and asynchronous updating. Mutual tuning between synchronous and asynchronous updating can be interpreted as the model for dissipative structure, and that can reveal the critical property in the phase transition from order to chaos. Since asynchronous tuning easily makes behavior at the edge of chaos, the property of AT-ECA is called the unfolded edge of chaos. The computational power of AT-ECA is evaluated by the quantitative measure of computational universality and efficiency. It shows that the computational efficiency of AT-ECA is much higher than that of synchronous ECA and asynchronous ECA.


Biosystems ◽  
1999 ◽  
Vol 51 (3) ◽  
pp. 123-143 ◽  
Author(s):  
Birgitt Schönfisch ◽  
André de Roos

2012 ◽  
Vol 45 (4) ◽  
pp. 383-394 ◽  
Author(s):  
J.M. Baetens ◽  
P. Van der Weeën ◽  
B. De Baets

2012 ◽  
Vol 11 (4) ◽  
pp. 553-564 ◽  
Author(s):  
Olivier Bouré ◽  
Nazim Fatès ◽  
Vincent Chevrier

2013 ◽  
Vol 24 (03) ◽  
pp. 1350015 ◽  
Author(s):  
XIN HUANG ◽  
JIA LEE ◽  
RUI-LONG YANG ◽  
QING-SHENG ZHU

Self-reproduction on asynchronous cellular automata (ACAs) has attracted wide attention due to the evident artifacts induced by synchronous updating. Asynchronous updating, which allows cells to undergo transitions independently at random times, might be more compatible with the natural processes occurring at micro-scale, but the dark side of the coin is the increment in the complexity of an ACA in order to accomplish stable self-reproduction. This paper proposes a novel model of self-timed cellular automata (STCAs), a special type of ACAs, where unsheathed loops are able to duplicate themselves reliably in parallel. The removal of sheath cannot only allow various loops with more flexible and compact structures to replicate themselves, but also reduce the number of cell states of the STCA as compared to the previous model adopting sheathed loops [Y. Takada, T. Isokawa, F. Peper and N. Matsui, Physica D227, 26 (2007)]. The lack of sheath, on the other hand, often tends to cause much more complicated interactions among loops, when all of them struggle independently to stretch out their constructing arms at the same time. In particular, such intense collisions may even cause the emergence of a mess of twisted constructing arms in the cellular space. By using a simple and natural method, our self-reproducing loops (SRLs) are able to retract their arms successively, thereby disentangling from the mess successfully.


Entropy ◽  
2020 ◽  
Vol 22 (9) ◽  
pp. 1049
Author(s):  
Yukio-Pegio Gunji ◽  
Daisuke Uragami

Although natural and bioinspired computing has developed significantly, the relationship between the computational universality and efficiency beyond the Turing machine has not been studied in detail. Here, we investigate how asynchronous updating can contribute to the universal and efficient computation in cellular automata (CA). First, we define the computational universality and efficiency in CA and show that there is a trade-off relation between the universality and efficiency in CA implemented in synchronous updating. Second, we introduce asynchronous updating in CA and show that asynchronous updating can break the trade-off found in synchronous updating. Our finding spells out the significance of asynchronous updating or the timing of computation in robust and efficient computation.


2001 ◽  
Vol 11 (PR3) ◽  
pp. Pr3-205-Pr3-212
Author(s):  
G. Ch. Sirakoulis ◽  
I. Karafyllidis ◽  
A. Thanailakis
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document