Leaderless deterministic chemical reaction networks

DOI10.1007/s11047-014-9435-8zbMath1415.68080OpenAlexW2168988021MaRDI QIDQ2003464

Monir Hajiaghayi, David Doty

Publication date: 8 July 2019

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

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20140530-105253322

zbMATH Keywords

time complexityleader electionchemical reaction networksemilinear function

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (7)

Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks ⋮ Verifying chemical reaction network implementations: a bisimulation approach ⋮ Unnamed Item ⋮ Computational Complexity of Atomic Chemical Reaction Networks ⋮ Verifying polymer reaction networks using bisimulation ⋮ Unnamed Item ⋮ Composable computation in discrete chemical reaction networks

Cites Work

• Computation with finite stochastic 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
• Rate-independent computation in continuous chemical reaction networks
• Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems
• 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
• Timing in chemical reaction networks

This page was built for publication: Leaderless deterministic chemical reaction networks