Probability 1 computation with chemical reaction networks

DOI10.1007/s11047-015-9501-xzbMath1415.68077OpenAlexW2129767065MaRDI QIDQ2311222

David Doty, David Soloveichik, Rachel Cummings

Publication date: 10 July 2019

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

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20160620-093414531

zbMATH Keywords

arithmetical hierarchychemical reaction networkprobabilistic computationdeterministic computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Classical flows, reactions, etc. in chemistry (92E20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks ⋮ The complexity of verifying population protocols ⋮ Data collection in population protocols with non-uniformly random scheduler ⋮ Composable computation in discrete chemical reaction networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic function computation with chemical reaction networks
• Strand algebras for DNA computing
• Computation with finite stochastic chemical reaction networks
• Parallel program schemata
• On degrees of unsolvability
• Output Stability and Semilinear Sets in Chemical Reaction Networks and Deciders
• Termination Problems in Chemical Kinetics
• Stably computable predicates are semilinear

This page was built for publication: Probability 1 computation with chemical reaction networks