Title

On Cellular Automata rules of molecular arrays

Document Type

Article

Publication Date

2-25-2012

Abstract

Cellular Automata (CA) have long attracted interest as abstract computation models, but only in the last few years have serious attempts started to implement them in terms of molecules. Such nano-technological innovations promise very cost-effective fabrication because of the regular structure of CA, which allows assembly through molecular self-organization. The small sizes of molecules combined with their availability in Avogadro-scale numbers promises a huge computational power, in which the massive parallelism inherent in CA can be effectively exploited. This paper discusses the molecular CA in (Bandyopadhyay et al., Nature Physics 2010) and shows novel features that have never been proposed in conventional CA models. The interaction rules in the molecular CA are found to be of a mixed variety, ranging from conventional direct-neighborhood type of rules to rules with long-distance interactions between cells. The probabilities according to which rules are applied in the molecular CA are dynamically influenced by the patterns on the cellular space. This results in extremely rich behavior, as compared to conventional models, which has the potential to be utilized for efficient configuration of patterns on the cellular space.

Publisher's Statement

© Springer Science+Business Media B.V. 2012. Publisher's version of record: https://doi.org/10.1007/s11047-012-9314-0

Publication Title

Natural Computing

Link to Full Text

Share

COinS