Deterministic Function Computation with Chemical Reaction Networks

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 (i.e., able to simulate arbitrary algorithms) 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 (a multi-dimensional generalization of "eventually periodic" sets). We introduce the notion of function, rather than predicate, computation by representing the output of a function f : ℕ → ℕ by a count of some molecular species, i.e., if the CRN starts with x₁, …, x molecules of some "input" species X₁, …, X , the CRN is guaranteed to converge to having f(x₁, …, x ) molecules of the "output" species Y₁, …, Y . We show that a function f : ℕ → ℕ is deterministically computed by a CRN if and only if its graph {(x, y) ∈ ℕ × ℕ ∣ f(x) = y} is a semilinear set. Finally, we show that each semilinear function f (a function whose graph is a semilinear set) can be computed by a CRN on input x in expected time O(polylog ∥x∥₁).