Deterministic Function Computation with Chemical Reaction Networks
From MaRDI portal
Publication:5200596
Abstract: Chemical reaction networks (CRNs) formally model chemistry in a well-mixed solution. CRNs are widely used to describe information processing occurring in natural cellular regulatory networks, and with upcoming advances in synthetic biology, CRNs are a promising language for the design of artificial molecular control circuitry. Nonetheless, despite the widespread use of CRNs in the natural sciences, the range of computational behaviors exhibited by CRNs is not well understood. CRNs have been shown to be efficiently Turing-universal when allowing for a small probability of error. CRNs that are guaranteed to converge on a correct answer, on the other hand, have been shown to decide only the semilinear predicates. We introduce the notion of function, rather than predicate, computation by representing the output of a function f:N^k --> N^l by a count of some molecular species, i.e., if the CRN starts with n_1,...,n_k molecules of some "input" species X1,...,Xk, the CRN is guaranteed to converge to having f(n_1,...,n_k) molecules of the "output" species Y1,...,Yl. We show that a function f:N^k --> N^l is deterministically computed by a CRN if and only if its graph {(x,y) | f(x) = y} is a semilinear set. Furthermore, each semilinear function f can be computed on input x in expected time O(polylog(|x|)).
Recommendations
- Deterministic function computation with chemical reaction networks
- Composable Computation in Discrete Chemical Reaction Networks
- Composable computation in discrete chemical reaction networks
- Computation with finite stochastic chemical reaction networks
- Composable rate-independent computation in continuous chemical reaction networks
- Rate-independent computation in continuous chemical reaction networks
- Programming discrete distributions with chemical reaction networks
- Programming discrete distributions with chemical reaction networks
- Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs
- The computational capability of chemical reaction automata
Cited in
(35)- Testing binomiality of chemical reaction networks using comprehensive Gröbner systems
- Deterministic function computation with chemical reaction networks
- Reachability bounds for chemical reaction networks and strand displacement systems
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
- Leaderless deterministic chemical reaction networks
- Synthesizing and tuning chemical reaction networks with specified behaviours
- On chemical reaction network design by a nested evolution algorithm
- Decomposition and factorization of chemical reaction transducers
- The computational capability of chemical reaction automata
- Dominance and T-Invariants for Petri Nets and Chemical Reaction Networks
- Modular verification of chemical reaction network encodings via serializability analysis
- Computation with finite stochastic chemical reaction networks
- Speed faults in computation by chemical reaction networks
- Probability 1 computation with chemical reaction networks
- Extracting reaction systems from function behavior
- Theory of reaction automata: a survey
- Rate-independent computation in continuous chemical reaction networks
- Algebraic biochemistry: a framework for analog online computation in cells
- Composable computation in discrete chemical reaction networks
- Modular verification of DNA strand displacement networks via serializability analysis
- Functional analysis of large-scale DNA strand displacement circuits
- The importance of thermodynamics for molecular systems, and the importance of molecular systems for thermodynamics
- Composable rate-independent computation in continuous chemical reaction networks
- Robust biomolecular finite automata
- Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs
- Leaderless Deterministic Chemical Reaction Networks
- Autocatalysis in reaction networks
- Computing with chemical reaction networks: a tutorial
- Minimal output unstable configurations in chemical reaction networks and deciders
- Dominance and deficiency for Petri nets and chemical reaction networks
- Timing in chemical reaction networks
- Robustness of expressivity in chemical reaction networks
- On a model of online analog computation in the cell with absolute functional robustness: algebraic characterization, function compiler and error control
- Programming discrete distributions with chemical reaction networks
- Speed Faults in Computation by Chemical Reaction Networks
This page was built for publication: Deterministic Function Computation with Chemical Reaction Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200596)
