Journal
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
Volume 90, Issue 4, Pages 869-879Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207160.2012.748897
Keywords
membrane computing; Numerical P systems; Enzymatic Numerical P systems; Turing universality; bio-inspired computing; 68Q05; 68Q10; 68Q17; 68Q85
Categories
Funding
- Sectorial Operational Programme Human Resources Development (SOP HRD)
- European Social Fund
- Romanian Government [SOP HRD/107/1.5/S/82514]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
