Universality of Enzymatic Numerical P systems

Abstract

This paper provides the proof that Enzymatic Numerical P systems with deterministic, but parallel, execution model are universal, even when the production functions used are polynomials of degree 1. This extends previous known results and provides the optimal case in terms of polynomial degree.

Keywords:

• membrane computing
• Numerical P systems
• Enzymatic Numerical P systems
• Turing universality
• bio-inspired computing

2010 AMS Subject Classifications :

• 68Q05
• 68Q10
• 68Q17
• 68Q85

Acknowledgements

The authors thank Gheorghe P˘aun for useful discussions and suggestions regarding the universality of ENP systems. The authors would also like to thank the anonymous reviewers for useful comments and suggestions. This work is supported by the Sectorial Operational Programme Human Resources Development (SOP HRD), financed from the European Social Fund and by the Romanian Government under the contract number SOP HRD/107/1.5/S/82514.