Random Interactions

Does robust computation exist? Some reflections on asynchronous cellular automata.

by Mr. Souvik Roy (Indian Institute of Engineering Science and Technology, Shibpur)

Thursday, February 3, 2022 from to (Asia/Kolkata)
at Zoom
Description Like other synchronous systems cellular automata (CAs) also assume a global clock that forces the cells to get updated simultaneously. Although, the synchronous CAs have been proved good in modelling natural complex physical, biological, social) systems, the assumption of global clock is not very natural. In this context, the effect in the convergent and reversible dynamics under asynchronous updating scheme from natural complex system modelling perspective is presented in this work.

We regroup here various results on the basins of attractor dynamics under asynchronous updating scheme which have been presented in different articles and expose a full analysis of the behaviour. This work introduces the notion of cloud behaviour in convergent dynamics of asynchronous CAs which has similarity with natural clouds across the sky, election model of parliamentary democratic system, and electron cloud around nucleus. Then, this work introduces a new notion of hidden configuration to classify recurrent systems into fully and partially exposed recurrent systems. Moreover, in another direction, this work explores the computational ability of natural attractor basins which suggests some asynchronous CA are potential candidate for solving distributed consensus problem (specifically, density classification problem), designing pattern classifier, random number generator and cryptosystem.