Deterministic function computation with chemical reaction networks

DOI10.1007/s11047-013-9393-6zbMath1353.68081OpenAlexW1991095994WikidataQ34460719 ScholiaQ34460719MaRDI QIDQ268444

David Doty, Ho-Lin Chen, David Soloveichik

Publication date: 15 April 2016

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

Full work available at URL: http://europepmc.org/articles/pmc4221813

zbMATH Keywords

distributed computingmolecular programmingpopulation protocolssemilinear functionsstochastic chemical kinetics

Mathematics Subject Classification ID

Related Items (28)

Polylogarithmic-Time Leader Election in Population Protocols ⋮ Simple and fast approximate counting and leader election in populations ⋮ The stochastic thermodynamics of computation ⋮ Terminating distributed construction of shapes and patterns in a fair solution of automata ⋮ Universal Computation and Optimal Construction in the Chemical Reaction Network-Controlled Tile Assembly Model ⋮ Computing with biological switches and clocks ⋮ Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks ⋮ Chemical reaction network designs for asynchronous logic circuits ⋮ Programming discrete distributions with chemical reaction networks ⋮ Speed faults in computation by chemical reaction networks ⋮ Verifying chemical reaction network implementations: a bisimulation approach ⋮ Hairpin completions and reductions: semilinearity properties ⋮ Computing with chemical reaction networks: a tutorial ⋮ Molecular computing for Markov chains ⋮ Unnamed Item ⋮ Computational Complexity of Atomic Chemical Reaction Networks ⋮ A survey of size counting in population protocols ⋮ Verifying polymer reaction networks using bisimulation ⋮ Unnamed Item ⋮ Probability 1 computation with chemical reaction networks ⋮ Composable computation in discrete chemical reaction networks ⋮ How Many Cooks Spoil the Soup? ⋮ Programming Discrete Distributions with Chemical Reaction Networks ⋮ Robustness of Expressivity in Chemical Reaction Networks ⋮ Chemical Reaction Network Designs for Asynchronous Logic Circuits ⋮ How many cooks spoil the soup? ⋮ Distributed computation with continual population growth ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Strand algebras for DNA computing
• Computation with finite stochastic chemical reaction networks
• Hardness vs randomness
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• Parallel program schemata
• 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.
• Leaderless Deterministic Chemical Reaction Networks
• 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

This page was built for publication: Deterministic function computation with chemical reaction networks