Robust Real-time Computing with Chemical Reaction Networks

Recent research into analog computing has introduced new notions of computing real numbers. Huang, Klinge, Lathrop, Li, and Lutz defined a notion of computing real numbers in real-time with chemical reaction networks (CRNs), introducing the classes RLCRN (the class of all Lyapunov CRN-computable real numbers) and RRTCRN (the class of all real-time CRN-computable numbers). In their paper, they show the inclusion of the real algebraic numbers ALG Ď RLCRN Ď RRTCRN and that ALG Ř RRTCRN but leave open where the inclusion is proper. In this paper, we resolve this open problem and show ALG “ RLCRN Ř RRTCRN. However, their definition of real-time computation is fragile in the sense that it is sensitive to perturbations in initial conditions. To resolve this flaw, we further require a CRN to withstand these perturbations. In doing so, we arrive at a discrete model of memory. This approach has several benefits. First, a bounded CRN may compute values approximately in finite time. Second, a CRN can tolerate small perturbations of its species’ concentrations. Third, taking a measurement of a CRN’s state only requires precision proportional to the exactness of these approximations. Lastly, if a CRN requires only finite memory, this model and Turing machines are equivalent under real-time simulations.

[1]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[2]  Irving R. Epstein,et al.  An Introduction to Nonlinear Chemical Dynamics: Oscillations, Waves, Patterns, and Chaos , 1998 .

[3]  François Fages,et al.  Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs , 2017, CMSB.

[4]  Harold R. Parks,et al.  A Primer of Real Analytic Functions , 1992 .

[5]  Erik Winfree,et al.  Stochastic Chemical Reaction Networks for Robustly Approximating Arbitrary Probability Distributions , 2018, Theor. Comput. Sci..

[6]  Xiaoyuan Li,et al.  Real-Time Computability of Real Numbers by Chemical Reaction Networks , 2017, UCNC.

[7]  Matthew J. Patitz,et al.  Geometric Tiles and Powers and Limitations of Geometric Hindrance in Self-Assembly , 2019, UCNC.

[8]  Amaury Pouly,et al.  Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length , 2016, J. ACM.

[9]  David Furcy,et al.  Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D , 2021, Theor. Comput. Sci..

[10]  Lulu Qian,et al.  Programming and simulating chemical reaction networks on a surface , 2020, Journal of the Royal Society Interface.

[11]  Xiaoyuan Li,et al.  Real-time computability of real numbers by chemical reaction networks , 2018, Natural Computing.

[12]  Pierre Fraigniaud,et al.  Computing with Large Populations Using Interactions , 2012, MFCS.

[13]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[14]  David Doty,et al.  Composable computation in discrete chemical reaction networks , 2019, Distributed Computing.

[15]  Jack H. Lutz,et al.  Robust Biomolecular Finite Automata , 2015, Theor. Comput. Sci..

[16]  Matthew J. Patitz,et al.  Geometric tiles and powers and limitations of geometric hindrance in self-assembly , 2021, Nat. Comput..

[17]  Titus H. Klinge,et al.  Real-Time Equivalence of Chemical Reaction Networks and Analog Computers , 2019, DNA.

[18]  Titus H. Klinge,et al.  ALCH: An imperative language for chemical reaction network-controlled tile assembly , 2022, DNA.

[19]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[20]  David Doty,et al.  Composable computation in discrete chemical reaction networks , 2020, Distributed Computing.

[21]  Olivier Bournez,et al.  The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation , 2006, TAMC.

[22]  I. Epstein,et al.  An Introduction to Nonlinear Chemical Dynamics , 1998 .