Deterministic function computation with chemical reaction networks
From MaRDI portal
Recommendations
- Deterministic Function Computation with Chemical Reaction Networks
- Leaderless Deterministic Chemical Reaction Networks
- Leaderless deterministic chemical reaction networks
- Rate-independent computation in continuous chemical reaction networks
- Composable rate-independent computation in continuous chemical reaction networks
Cites work
- scientific article; zbMATH DE number 5605125 (Why is no real title available?)
- Chemical implementation of neural networks and Turing machines.
- Computation in networks of passively mobile finite-state sensors
- Computation with finite stochastic chemical reaction networks
- Deterministic Function Computation with Chemical Reaction Networks
- Fast computation by population protocols with a leader
- Hardness vs randomness
- Leaderless Deterministic Chemical Reaction Networks
- Less haste, less waste: on recycling and its limits in strand displacement systems
- Parallel program schemata
- Reachability bounds for chemical reaction networks and strand displacement systems
- Space and energy efficient computation with DNA strand displacement systems
- Stably computable predicates are semilinear
- Strand algebras for DNA computing
- Termination Problems in Chemical Kinetics
Cited in
(47)- Universal computation and optimal construction in the chemical reaction network-controlled tile assembly model
- Programming discrete distributions with chemical reaction networks
- Testing binomiality of chemical reaction networks using comprehensive Gröbner systems
- Molecular computing for Markov chains
- Simple and fast approximate counting and leader election in populations
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
- Composable computation in leaderless, discrete chemical reaction networks
- Chemical reaction network designs for asynchronous logic circuits
- Terminating distributed construction of shapes and patterns in a fair solution of automata
- Leaderless deterministic chemical reaction networks
- Synthesizing and tuning chemical reaction networks with specified behaviours
- Verifying polymer reaction networks using bisimulation
- On chemical reaction network design by a nested evolution algorithm
- A survey of size counting in population protocols
- Decomposition and factorization of chemical reaction transducers
- Computation with finite stochastic chemical reaction networks
- Chemical mass-action systems as analog computers: implementing arithmetic computations at specified speed
- Message complexity of population protocols
- Speed faults in computation by chemical reaction networks
- Verifying chemical reaction network implementations: a bisimulation approach
- Probability 1 computation with chemical reaction networks
- Extracting reaction systems from function behavior
- Chemical reaction network designs for asynchronous logic circuits
- How Many Cooks Spoil the Soup?
- Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks
- Rate-independent computation in continuous chemical reaction networks
- Algebraic biochemistry: a framework for analog online computation in cells
- Composable computation in discrete chemical reaction networks
- scientific article; zbMATH DE number 7561449 (Why is no real title available?)
- How many cooks spoil the soup?
- Computing with biological switches and clocks
- Composable rate-independent computation in continuous chemical reaction networks
- Robust biomolecular finite automata
- Distributed computation with continual population growth
- Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs
- Leaderless Deterministic Chemical Reaction Networks
- Hairpin completions and reductions: semilinearity properties
- Computing with chemical reaction networks: a tutorial
- A Survey on Analog Models of Computation
- Polylogarithmic-time leader election in population protocols
- Timing in chemical reaction networks
- Robustness of expressivity in chemical reaction networks
- Probability 1 computation with chemical reaction networks
- Programming discrete distributions with chemical reaction networks
- Deterministic Function Computation with Chemical Reaction Networks
- Speed Faults in Computation by Chemical Reaction Networks
- The stochastic thermodynamics of computation
This page was built for publication: Deterministic function computation with chemical reaction networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q268444)
