Composable computation in discrete chemical reaction networks

DOI10.1007/s00446-020-00378-zOpenAlexW3022482581MaRDI QIDQ2064055

David Doty, Eric E. Severson, David K. Haley

Publication date: 4 January 2022

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

Full work available at URL: https://arxiv.org/abs/1903.02637

zbMATH Keywords

chemical reaction networksemilinearpopulation protocolcomposable computation

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

Robust real-time computing with chemical reaction networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic function computation with chemical reaction networks
• Strand algebras for DNA computing
• Composable rate-independent computation in continuous chemical reaction networks
• The complexity of the word problems for commutative semigroups and polynomial ideals
• 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
• Parallel program schemata
• Time-Space Trade-offs in Population Protocols
• Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols
• Stably computable predicates are semilinear
• Brief Announcement
• Stable leader election in population protocols requires linear time

This page was built for publication: Composable computation in discrete chemical reaction networks