Ponencia
Improving the Universality Results of Enzymatic Numerical P Systems
Autor/es | Vasile, Cristian Ioan
Pavel, Ana Brandusa Dumitrache, Ioan |
Fecha de publicación | 2012 |
Fecha de depósito | 2016-02-05 |
Publicado en |
|
ISBN/ISSN | 978-84-940056-6-4 |
Resumen | This paper provides the proof that Enzymatic Numerical P Sytems with
deterministic, but parallel, execution model are universal, even when the production
functions used are polynomials of degree 1. This extends previous ... This paper provides the proof that Enzymatic Numerical P Sytems 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
ENPSPoly1.pdf | 87.50Kb | [PDF] | Ver/ | |