Cellular Automata and Discrete Complex Systems

Molecular robotics is an emerging area of research aiming at building robots made of components such as sensors, computers, and actuators, which are all implemented as molecular devices. The molecular robot is supposed to react autonomously to its environment by receiving chemical/physical signals and decides behavior by molecular computation [1–3]. Firstly, I would like to introduce some basic principles of molecular computation based on hybridization reactions of DNA molecules. Various computational methods ranging from signal amplification, logic operation to reaction-diffusion-like computation have been proposed so far, will be implemented as computational components for the molecular robots. Despite extensive efforts, however, systems having all three functions (sensing, computation, and actuation) are still difficult to realize, because integrating different chemical components in the same spatio-temporal space causes a lot of undesired spurious interactions among them. How to integrate chemical devices into a consistent network is the central issue of molecular robotics indeed. I think new architectures are necessary to cope with this intrinsic difficulty. Proposed models of computation for molecular robots such as single-molecular computing, computing in liposomes and computing in gel will be introduced to show the current level of research in this field.

[1]  Kenichi Morita,et al.  Reversible computing and cellular automata - A survey , 2008, Theor. Comput. Sci..

[2]  Robert Morris Minimal Percolating Sets in Bootstrap Percolation , 2009, Electron. J. Comb..

[3]  Christian Choffrut,et al.  On real-time cellular automata and trellis automata , 2004, Acta Informatica.

[4]  Rolf Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[5]  M. Newman Power laws, Pareto distributions and Zipf's law , 2005 .

[6]  Jia Lee,et al.  General design of reversible sequential machines based on reversible logic elements , 2015, Theor. Comput. Sci..

[7]  Serafino Amoroso,et al.  Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures , 1972, J. Comput. Syst. Sci..

[8]  Dirk Helbing,et al.  Are Random Trading Strategies More Successful than Technical Ones? , 2013, PloS one.

[9]  Alessandro Pluchino,et al.  The Peter Principle Revisited: A Computational Study , 2009, Physica A: Statistical Mechanics and its Applications.

[10]  Pierre McKenzie,et al.  Reversible space equals deterministic space , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[11]  Pedro P. B. de Oliveira,et al.  Derivation and Representation of One-Dimensional, Reversible, Number-Conserving Cellular Automata Rules , 2011, J. Cell. Autom..

[12]  Paola Flocchini,et al.  On time versus size for monotone dynamic monopolies in regular topologies , 2000, SIROCCO.

[13]  Jarkko Kari,et al.  Theory of cellular automata: A survey , 2005, Theor. Comput. Sci..

[14]  Fabrizio Luccio,et al.  Dynamic monopolies in tori , 2004, Discret. Appl. Math..

[15]  Satoshi Kobayashi,et al.  Molecular Robotics: A New Paradigm for Artifacts , 2012, New Generation Computing.

[16]  Vincent Larivière,et al.  Concentration of research funding leads to decreasing marginal returns , 2016, ArXiv.

[17]  A. Pluchino,et al.  Micro and macro benefits of random investments in financial markets , 2014, 1405.5805.

[18]  Bruno Durand Inversion of 2D Cellular Automata: Some Complexity Results , 1994, Theor. Comput. Sci..

[19]  Martin Kutrib,et al.  Cellular Automata and Language Theory , 2009, Encyclopedia of Complexity and Systems Science.

[20]  Eli Berger Dynamic Monopolies of Constant Size , 2001, J. Comb. Theory, Ser. B.

[21]  Dana Angluin,et al.  Inference of Reversible Languages , 1982, JACM.

[22]  R. Merton The Matthew Effect in Science, II: Cumulative Advantage and the Symbolism of Intellectual Property , 1988, Isis.

[23]  Martin Kutrib,et al.  One-way reversible multi-head finite automata , 2012, Theor. Comput. Sci..

[24]  Martin Kutrib,et al.  Fast reversible language recognition using cellular automata , 2007, Inf. Comput..

[25]  Stephen Wolfram,et al.  A New Kind of Science , 2003, Artificial Life.

[26]  Martin Kutrib,et al.  Real-time reversible iterative arrays , 2010, Theor. Comput. Sci..

[27]  Alessandro Pluchino,et al.  Efficient Promotion Strategies in a Hierarchical Organization , 2011, ArXiv.

[28]  Jean-Éric Pin,et al.  On Reversible Automata , 1992, LATIN.

[29]  N. Margolus,et al.  Invertible cellular automata: a review , 1991 .

[30]  A. Barabasi,et al.  Quantifying the evolution of individual scientific impact , 2016, Science.

[31]  Jarkko Kari,et al.  Reversibility and Surjectivity Problems of Cellular Automata , 1994, J. Comput. Syst. Sci..

[32]  Kenichi Morita,et al.  Two-Way Reversible Multi-Head Finite Automata , 2011, Fundam. Informaticae.

[33]  Sarah Spence Adams,et al.  Dynamic monopolies and feedback vertex sets in hexagonal grids , 2011, Comput. Math. Appl..

[34]  Alessandro Pluchino,et al.  The Beneficial Role of Random Strategies in Social and Financial Systems , 2012, Journal of Statistical Physics.

[35]  Nicola Santoro,et al.  Optimal irreversible dynamos in chordal rings , 2001, Discret. Appl. Math..

[36]  Dirk Helbing,et al.  Reducing financial avalanches by random investments. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[37]  R. Jackson,et al.  The Matthew Effect in Science , 1988, International journal of dermatology.

[38]  Alessandro Pluchino,et al.  Accidental Politicians: How Randomly Selected Legislators Can Improve Parliament Efficiency , 2011, ArXiv.

[39]  Jarkko Kari,et al.  A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata , 2005, ICALP.

[40]  Fred S. Roberts,et al.  Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion , 2009, Discret. Appl. Math..

[41]  Martin Kutrib,et al.  Cellular Automata - A Computational Point of View , 2008, New Developments in Formal Languages and Applications.

[42]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[43]  Fabrizio Luccio,et al.  Irreversible Dynamos in Butterflies , 1999, Colloquium on Structural Information & Communication Complexity.

[44]  Felipe García-Ramos,et al.  Product decomposition for surjective 2-block NCCA , 2011, Automata.

[45]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[46]  Y. Rondelez Competition for catalytic resources alters biological network dynamics. , 2012, Physical review letters.

[47]  David Peleg,et al.  Local majorities, coalitions and monopolies in graphs: a review , 2002, Theor. Comput. Sci..

[48]  Martin Kutrib,et al.  Reversible pushdown automata , 2012, J. Comput. Syst. Sci..

[49]  D. Watts Everything Is Obvious: *Once You Know the Answer , 2011 .