English

Output-Oblivious Stochastic Chemical Reaction Networks

Computational Complexity 2022-08-31 v2

Abstract

We classify the functions f:N2Nf:\mathbb{N}^2 \rightarrow \mathbb{N} which are stably computable by output-oblivious Stochastic Chemical Reaction Networks (CRNs), i.e., systems of reactions in which output species are never reactants. While it is known that precisely the semilinear functions are stably computable by CRNs, such CRNs sometimes rely on initially producing too many output species and then consuming the excess in order to reach a correct stable state. These CRNs may be difficult to integrate into larger systems: if the output of a CRN C\mathcal{C} becomes the input to a downstream CRN C\mathcal{C}', then C\mathcal{C}' could inadvertently consume too many outputs before C\mathcal{C} stabilizes. If, on the other hand, C\mathcal{C} is output-oblivious then C\mathcal{C}' may consume C\mathcal{C}'s output as soon as it is available. In this work we prove that a semilinear function f:N2Nf:\mathbb{N}^2 \rightarrow \mathbb{N} is stably computable by an output-oblivious CRN with a leader if and only if it is both increasing and either grid-affine (intuitively, its domains are congruence classes), or the minimum of a finite set of fissure functions (intuitively, functions behaving like the min function).

Keywords

Cite

@article{arxiv.1812.04401,
  title  = {Output-Oblivious Stochastic Chemical Reaction Networks},
  author = {Ben Chugg and Anne Condon and Hooman Hashemi},
  journal= {arXiv preprint arXiv:1812.04401},
  year   = {2022}
}

Comments

Published in OPODIS 2018. Latest version adds appendix containing all proofs