Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T05:31:52.539Z Has data issue: false hasContentIssue false
  • English
  • Français

Turing universality of the Biochemical Ground Form

Published online by Cambridge University Press:  26 February 2010

LUCA CARDELLI and
GIANLUIGI ZAVATTARO
LUCA CARDELLI
Affiliation:
Microsoft Research, Cambridge, United Kingdom Email: luca@microsoft.com
GIANLUIGI ZAVATTARO
Affiliation:
Dip. Scienze dell'Informazione, Università di Bologna, Italy Email: zavattar@cs.unibo.it
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We explore the expressive power of languages that naturally model biochemical interactions relative to languages that only naturally model basic chemical reactions, identifying molecular association as the basic mechanism that distinguishes the former from the latter. We use a process algebra, the Biochemical Ground Form (BGF), that adds primitives for molecular association to CGF, which is a process algebra that has been proved to be equivalent to the traditional notations for describing basic chemical reactions. We first observe that, unlike CGF, BGF is Turing universal as it supports a finite precise encoding of Random Access Machines, which comprise a well-known Turing powerful formalism. Then we prove that the Turing universality of BGF derives from the interplay between the molecular primitives of association and dissociation. In fact, the elimination from BGF of the primitives already present in CGF does not reduce the computational strength of the process algebra, but if either association or dissociation is removed, BGF ceases to be Turing complete.

Information

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 20 , Special Issue 1: Expressiveness in Concurrency 2008 , February 2010, pp. 45 - 73
Copyright
Copyright © Cambridge University Press 2010

References

Busi, N. and Gorrieri, R. (2006) On the Computational Power of Brane Calculi. In: Transactions on Computational Systems Biology. Springer-Verlag Lecture Notes in Computer Science 4220 16–43.CrossRefGoogle Scholar
Busi, N., Gabbrielli, M. and Zavattaro, G. (2009) On the expressive power of recursion, replication and iteration in process calculi. Mathematical Structure in Computer Science 19 (6)1191–1222.CrossRefGoogle Scholar
Cardelli, L. (2008) On Process Rate Semantics. Theoretical Computer Science 391 (3)190–215.CrossRefGoogle Scholar
Credi, A., Garavelli, M., Laneve, C., Pradalier, S., Silvi, S. and Zavattaro, G. (2007) Modelization and Simulation of Nano Devices in nano-kappa Calculus. In: Proc. of Computational Methods in Systems Biology (CMSB07). Springer-Verlag Lecture Notes in Computer Science 4695 168–183.CrossRefGoogle Scholar
Cardelli, L. and Pradalier, S. (2005) Where Membranes Meet Complexes. In: Proc. of Concurrent Models in Molecular Biology (BioConcur05).Google Scholar
Cardelli, L. and Zavattaro, G. (2008) On the Computational Power of Biochemistry. In: Proc. of Algebraic Biology (AB08). Springer-Verlag Lecture Notes in Computer Science 5147 65–80.CrossRefGoogle Scholar
Danos, V., Feret, J., Fontana, W. and Krivine, J. (2007) Kappa Factory, 2007. Available at: http://www.plectix.com/introkappa.htm.Google Scholar
Delzanno, G., Giusto, C. D., Gabbrielli, M., Laneve, C. and Zavattaro, G. (2009) The κ-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages. In: Proc. of Computational Systems in Systems Biology (CMSB09). Springer-Verlag Lecture Notes in Computer Science 5688 158–172.CrossRefGoogle Scholar
Danos, V. and Laneve, C. (2004) Formal molecular biology. Theoretical Computer Science 325 (1)69–110.CrossRefGoogle Scholar
Esparza, J. and Nielsen, M. (1994) Decidability Issues for Petri Nets. Technical report BRICS RS-94-8.CrossRefGoogle Scholar
Kohn, K. W., Aladjem, M. I., Weinstein, J. N. and Pommier, Y. (2006) Molecular interaction maps of bioregulatory networks: a general rubric for systems biology. Molecular biology of the cell 17 (1)1–13.CrossRefGoogle ScholarPubMed
Kitano, H., Funahashi, A., Matsuoka, Y. and Oda, K. (2005) Using process diagrams for the graphical representation of biological networks. Nature Biotechnology 23 961–966.CrossRefGoogle ScholarPubMed
Liekens, A. M. L. and Fernando, C. T. (2007) Turing complete catalytic particle computers. In: Proc. of 9th European Conference on Artificial Life (ECAL07). Springer-Verlag Lecture Notes in Computer Science 4648 1202–1211.CrossRefGoogle Scholar
Milner, R. (1989) Communication and Concurrency, Prentice-Hall, 1989.Google Scholar
Milner, R., Parrow, J. and Walker, D. (1992) A calculus of mobile processes. Journal of Information and Computation 100 1–77.CrossRefGoogle Scholar
Minsky, M. L. (1967) Computation: finite and infinite machines, Prentice-Hall.Google Scholar
Maffeis, S. and Phillips, I. (2005) On the computational strength of pure ambient calculi. Theoretical Computer Science 330 (3)501–551.CrossRefGoogle Scholar
Priami, C. and Quaglia, P. (2004) Beta Binders for Biological Interactions. In: Proc. of Computational Methods in Systems Biology (CMSB04). Springer-Verlag Lecture Notes in Computer Science 3082 20–33.CrossRefGoogle Scholar
Priami, C., Regev, A., Shapiro, E. and Silverman, W. (2001) Application of a stochastic name-passing calculus to representation and simulation of molecular processes. Information Processing Letters 80 25–31.CrossRefGoogle Scholar
Reisig, W. (1985) Petri nets: an introduction, Springer-Verlag.CrossRefGoogle Scholar
Soloveichik, D., Cook, M., Winfree, E. and Bruck, J. (2008) Computation with Finite Stochastic Chemical Reaction Networks. Natural Computing 7 (4)615–633.CrossRefGoogle Scholar
Sauvage, J.-P. and Dietrich-Bucheker, C. O. (eds.) (1999) Molecular Catenanes, Rotaxanes and Knots, Wiley-VCH.CrossRefGoogle Scholar
Zavattaro, G. and Cardelli, L. (2008) Termination Problems in Chemical Kinetics. In: Proc. of Concurrency Theory (CONCUR08). Springer-Verlag Lecture Notes in Computer Science 5201 477–491.CrossRefGoogle Scholar