Leaderless Deterministic Chemical Reaction Networks
From MaRDI portal
Publication:5168497
DOI10.1007/978-3-319-01928-4_4zbMath1409.68100arXiv1304.4519OpenAlexW3022729193MaRDI QIDQ5168497
Publication date: 7 July 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.4519
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biochemistry, molecular biology (92C40)
Related Items
Deterministic function computation with chemical reaction networks ⋮ Polylogarithmic-Time Leader Election in Population Protocols ⋮ Speed faults in computation by chemical reaction networks ⋮ Computing with chemical reaction networks: a tutorial ⋮ Functional Analysis of Large-Scale DNA Strand Displacement Circuits ⋮ Minimal output unstable configurations in chemical reaction networks and deciders ⋮ How Many Cooks Spoil the Soup? ⋮ Robustness of Expressivity in Chemical Reaction Networks ⋮ How many cooks spoil the soup?
Cites Work
- Strand algebras for DNA computing
- Computation with finite stochastic chemical reaction networks
- Computation in networks of passively mobile finite-state sensors
- Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems
- Fast Computation by Population Protocols with a Leader
- Termination Problems in Chemical Kinetics
- Chemical implementation of neural networks and Turing machines.
- Stably computable predicates are semilinear
- Deterministic Function Computation with Chemical Reaction Networks
- Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems
- Space and Energy Efficient Computation with DNA Strand Displacement Systems
