Turing universality of the Biochemical Ground Form
From MaRDI portal
Publication:3550701
DOI10.1017/S0960129509990259zbMath1191.68301DBLPjournals/mscs/CardelliZ10WikidataQ56981958 ScholiaQ56981958MaRDI QIDQ3550701
Gianluigi Zavattaro, Luca Cardelli
Publication date: 1 April 2010
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biochemistry, molecular biology (92C40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (4)
Programming in Biomolecular Computation ⋮ Strand algebras for DNA computing ⋮ Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems ⋮ A Survey on Analog Models of Computation
Cites Work
- Unnamed Item
- Unnamed Item
- Computation with finite stochastic chemical reaction networks
- A calculus of mobile processes. I
- Application of a stochastic name-passing calculus to representation and simulation of molecular processes
- On the computational strength of pure ambient calculi
- Formal molecular biology
- On process rate semantics
- Termination Problems in Chemical Kinetics
- On the Computational Power of Biochemistry
- On the expressive power of recursion, replication and iteration in process calculi
This page was built for publication: Turing universality of the Biochemical Ground Form
