Information Processing Letters
Communication and Concurrency
Theoretical Computer Science - Special issue: Computational systems biology
Computation: finite and infinite machines
Computation: finite and infinite machines
Theoretical Computer Science
Computation with finite stochastic chemical reaction networks
Natural Computing: an international journal
Turing complete catalytic particle computers
ECAL'07 Proceedings of the 9th European conference on Advances in artificial life
Modelization and simulation of nano devices in nanok calculus
CMSB'07 Proceedings of the 2007 international conference on Computational methods in systems biology
On the computational power of brane calculi
Transactions on Computational Systems Biology VI
Beta binders for biological interactions
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Biochemical Tuple Spaces for Self-organising Coordination
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Programming in Biomolecular Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient turing-universal computation with DNA polymers
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Rule-based modeling of transcriptional attenuation at the tryptophan operon
Winter Simulation Conference
Computational biology: a programming perspective
Formal modeling
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Rule-Based modeling of transcriptional attenuation at the tryptophan operon
Transactions on Computational Systems Biology XII
Maximally Parallel Probabilistic Semantics for Multiset Rewriting
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Self-organized Patterning by Diffusible Factors: Roles of a Community Effect
Fundamenta Informaticae - Watching the Daisies Grow: from Biology to Biomathematics and Bioinformatics — Alan Turing Centenary Special Issue
| Hi-index | 0.00 |
We explore the computational power of biochemistry with respect to basic chemistry, identifying complexation as the basic mechanism that distinguishes the former from the latter. We use two process algebras, the Chemical Ground Form (CGF) which is equivalent to basic chemistry, and the Biochemical Ground Form (BGF) which is a minimalistic extension of CGF with primitives for complexation. We characterize an expressiveness gap: CGF is not Turing complete while BGF supports a finite precise encoding of Random Access Machines, a well-known Turing powerful formalism.