Turing universality of the biochemical ground form
From MaRDI portal
(Redirected from Turing universality of the biochemical ground form)
Recommendations
Cites work
- A calculus of mobile processes. I
- Application of a stochastic name-passing calculus to representation and simulation of molecular processes
- Computation with finite stochastic chemical reaction networks
- Formal molecular biology
- scientific article; zbMATH DE number 3885321 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- On process rate semantics
- On the Computational Power of Biochemistry
- On the computational strength of pure ambient calculi
- On the expressive power of recursion, replication and iteration in process calculi
- Termination Problems in Chemical Kinetics
Cited in
(7)- On the computational power of BlenX
- Modelling, simulating and verifying Turing-powerful strand displacement systems
- Universality in Molecular and Cellular Computing
- On the Computational Power of Biochemistry
- A Survey on Analog Models of Computation
- Strand algebras for DNA computing
- Programming in biomolecular computation
This page was built for publication: Turing universality of the biochemical ground form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550701)