On Cellular Automata rules of molecular arrays
- 209 Downloads
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.
KeywordsCellular Automata Molecular electronics Reconfigurability Molecular networks
Authors acknowledge JSPS Grants in Aid for Young Scientists (A) for 2009-2011, Grant number 21681015 (Govt. of Japan). R.P. acknowledges National Science Foundation (NSF) Award number ECCS-0643420.
- Adachi S, Peper F, Lee J (2004) Universality of hexagonal asynchronous totalistic Cellular Automata. In: Cellular Automata, Lecture Notes in Computer Science, vol 3305, pp 91–100Google Scholar
- Adamatzky A, Teuscher C (eds) (2006) From utopian to genuine unconventional computers. Uniliver Press, Frome BA11 6TT UKGoogle Scholar
- Bandyopadhyay A, Pati R, Sahu S, Peper F, Fujita D (2010) Massively parallel computing on an organic molecular layer. Nat Phys, Supplementary Movie 4. http://www.nature.com/nphys/journal/v6/n5/extref/
- Gaylord RJ, Nishidate K (1996) Modeling nature. Springer, Santa ClaraGoogle Scholar
- Higuchi T, Murakawa M, Iwata M, Kajitani I, Liu W, Salami M (1997) Evolvable hardware at function level. In: Proceedings of IEEE into conference on evolutionary computation (ICEC), pp 187–192Google Scholar
- Morita K, Margenstern M, Imai K (1998) Universality of reversible hexagonal Cellular Automata. MFCS’98 Satellite workshop on frontiers between decidability and undecidability. Brno, Czech RepublicGoogle Scholar
- Peper F, Bandyopadhyay A, Oono H, Sahu S, Pati R, Ghosh S, Isokawa T, Fujita D (2010) On molecular implementations of Cellular Automata. In: Proceedings of the 10th international conference on applied computer science (ACS’10), pp 401–405Google Scholar
- Sahu S, Oono H, Ghosh S, Bandyopadhyay A, Fujita D, Peper F, Isokawa T, Pati R (2010) Molecular implementations of Cellular Automata. In: Proceedings of the 9th international conference on Cellular Automata for research and industry(ACRI’10), Lecture Notes in Computer Science, vol 6350, pp 650–659Google Scholar