Computation with finite stochastic chemical reaction networks

DOI10.1007/s11047-008-9067-yzbMath1187.68220OpenAlexW2008591003WikidataQ59328963 ScholiaQ59328963MaRDI QIDQ1035715

Matthew Cook, Jehoshua Bruck, Erik Winfree, David Soloveichik

Publication date: 4 November 2009

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

Full work available at URL: https://resolver.caltech.edu/CaltechPARADISE:2007.ETR085

zbMATH Keywords

stochastic chemical kineticsprobabilistic computationmolecular countsTuring-universal computation

Mathematics Subject Classification ID

Related Items (77)

Deterministic function computation with chemical reaction networks ⋮ Reachability bounds for chemical reaction networks and strand displacement systems ⋮ Modular verification of chemical reaction network encodings via serializability analysis ⋮ Simple and fast approximate counting and leader election in populations ⋮ The stochastic thermodynamics of computation ⋮ Robust Combinatorial Circuits in Chemical Reaction Networks ⋮ Unnamed Item ⋮ Terminating distributed construction of shapes and patterns in a fair solution of automata ⋮ Advances in parameterized verification of population protocols ⋮ Stochastic process semantics for dynamical grammars ⋮ Simulating and model checking membrane systems using strategies in Maude ⋮ An RNA-based theory of natural universal computation ⋮ Existence of a unique quasi-stationary distribution in stochastic reaction networks ⋮ Dominance and T-Invariants for Petri Nets and Chemical Reaction Networks ⋮ Universal Computation and Optimal Construction in the Chemical Reaction Network-Controlled Tile Assembly Model ⋮ Stochastic approximations of higher-molecular by bi-molecular reactions ⋮ Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy ⋮ 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 ⋮ Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes ⋮ Fast and succinct population protocols for Presburger arithmetic ⋮ Computing with chemical reaction networks: a tutorial ⋮ Approximate majority analyses using tri-molecular chemical reaction networks ⋮ Molecular computing for Markov chains ⋮ Reaction automata ⋮ Unnamed Item ⋮ Population protocols: beyond runtime analysis ⋮ Negative interactions in irreversible self-assembly ⋮ The Evolutionary Resilience of Distributed Cellular Computing ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computational Complexity of Atomic Chemical Reaction Networks ⋮ Termination Problems in Chemical Kinetics ⋮ Multi-scale verification of distributed synchronisation ⋮ Autocatalysis in reaction networks ⋮ Turing universality of the Biochemical Ground Form ⋮ Finding cut-offs in leaderless rendez-vous protocols is easy ⋮ Analysis and design of molecular machines ⋮ On the transformation capability of feasible mechanisms for programmable matter ⋮ Theory of reaction automata: a survey ⋮ A survey of size counting in population protocols ⋮ Parallel Computation Using Active Self-assembly ⋮ Leaderless Deterministic Chemical Reaction Networks ⋮ Modular Verification of DNA Strand Displacement Networks via Serializability Analysis ⋮ Leaderless deterministic chemical reaction networks ⋮ Parallel computation using active self-assembly ⋮ Verifying polymer reaction networks using bisimulation ⋮ Strand algebras for DNA computing ⋮ A renewable, modular, and time-responsive DNA circuit ⋮ Stochastic chemical reaction networks for robustly approximating arbitrary probability distributions ⋮ On the Computational Power of Biochemistry ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The complexity of verifying population protocols ⋮ Efficient Turing-Universal Computation with DNA Polymers ⋮ Clocked population protocols ⋮ Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach ⋮ Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach ⋮ Reachability Problems for Continuous Chemical Reaction Networks ⋮ Robust biomolecular finite automata ⋮ Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems ⋮ Emulating cellular automata in chemical reaction-diffusion networks ⋮ The computational capability of chemical reaction automata ⋮ Minimal output unstable configurations in chemical reaction networks and deciders ⋮ Probability 1 computation with chemical reaction networks ⋮ Dominance and deficiency for Petri nets and chemical reaction networks ⋮ Programming Discrete Distributions with Chemical Reaction Networks ⋮ Robustness of Expressivity in Chemical Reaction Networks ⋮ Chemical Reaction Network Designs for Asynchronous Logic Circuits ⋮ Time Complexity of Computation and Construction in the Chemical Reaction Network-Controlled Tile Assembly Model ⋮ Experiments on the reliability of stochastic spiking neural P systems ⋮ How many cooks spoil the soup? ⋮ Distributed computation with continual population growth ⋮ A Survey on Analog Models of Computation

Uses Software

• STOCKS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• A guide to membrane computing.
• Fast computation by population protocols with a leader
• Small fast universal Turing machines
• Parallel program schemata
• Stochastic approach to chemical kinetics

This page was built for publication: Computation with finite stochastic chemical reaction networks