Speed faults in computation by chemical reaction networks

DOI10.1007/S00446-015-0255-6zbMath1425.68108OpenAlexW2240903249MaRDI QIDQ1689751

David Soloveichik, Ho-Lin Chen, David Doty, Rachel Cummings

Publication date: 17 January 2018

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20140904-140207026

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Classical flows, reactions, etc. in chemistry (92E20) Biochemistry, molecular biology (92C40)

Related Items (8)

Speed faults in computation by chemical reaction networks ⋮ Computing with chemical reaction networks: a tutorial ⋮ Brief Announcement: Population Protocols Decide Double-exponential Thresholds ⋮ Computational Complexity of Atomic Chemical Reaction Networks ⋮ Automatic Analysis of Expected Termination Time for Population Protocols ⋮ Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits ⋮ Stable leader election in population protocols requires linear time ⋮ Simple and efficient local codes for distributed stable network construction

Cites Work

• Unnamed Item
• Deterministic function computation with chemical reaction networks
• A simple population protocol for fast robust approximate majority
• Strand algebras for DNA computing
• Computation with finite stochastic chemical reaction networks
• On the reachability problem for 5-dimensional vector addition systems
• Speed faults in computation by chemical reaction networks
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• Parallel program schemata
• Probability 1 Computation with Chemical Reaction Networks
• Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems
• Leaderless Deterministic Chemical Reaction Networks
• Stably computable predicates are semilinear
• Timing in chemical reaction networks
• Stable leader election in population protocols requires linear time

This page was built for publication: Speed faults in computation by chemical reaction networks