Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks
From MaRDI portal
Publication:6084208
DOI10.1007/s11047-017-9648-8zbMath1528.68110arXiv1604.03687OpenAlexW2963617406MaRDI QIDQ6084208
David Doty, David Soloveichik, Robert Brijder
Publication date: 30 November 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.03687
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (1)
Cites Work
- Unnamed Item
- Deterministic function computation with chemical reaction networks
- Verification of population protocols
- Computation with finite stochastic chemical reaction networks
- On the reachability problem for 5-dimensional vector addition systems
- The computational power of population protocols
- Leaderless deterministic chemical reaction networks
- Probability 1 computation with chemical reaction networks
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Semigroups, Presburger formulas, and languages
- Parallel program schemata
- Robustness of Expressivity in Chemical Reaction Networks
- Output Stability and Semilinear Sets in Chemical Reaction Networks and Deciders
- Rate-independent computation in continuous chemical reaction networks
- Polylogarithmic-Time Leader Election in Population Protocols
- Stably computable predicates are semilinear
- Verification of Population Protocols
- Stable leader election in population protocols requires linear time
This page was built for publication: Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks
