Work and Research Interests

The simplest class of CA systems, aptly called Elementary CA, are 1D binary state systems, i.e. a row of cells, each of which can be either 0 or 1. The smallest neighbourhood consists of 3 cells (one cell on each side of a given cell), and the transition rules are specified by enumerating all possible configurations of a row of 3 cells with 2 states each. Even though the definition of the system is simple, the configurations which emerge after sufficient time can form extremely intricate patterns.

Another well studied system is known as the Game of Life. This system is a 2D binary state CA, with transition rules which may be described as an abstraction of the dynamics of competitive survival. This system has generated a lot of curiosity since the discovery of stable periodic objects. Subsequently, many interesting structures have been discovered, such as self propagating structures, and complex structures which generate simpler structures.

The systems discussed above have been significant for our understanding of abstract computation as well. A specific Elementary CA, known as Rule 30, as well as Game of Life, have been proven to be Turing Complete, and therefore capable of universal computation.

Beyond questions of computability, CA systems have played a significant role in demonstrating mechanisms for the phenomenon of self-organized criticality, and the consequent generation of power law distributions. The Sandpile model is a prototypical CA model for driven, dissipative systems. The system naturally tends towards a critical state, beyond which the response of the system becomes uncorrelated to the perturbation received by the system. Such characteristics have been observed in certain natural and engineered systems, which comprise of multiple interacting dynamical units. The Sandpile model was one of the first to elucidate a concrete dynamical mechanism which leads to collective emergent phenomena with these characteristic signatures.