An efficient time-free solution to SAT problem by P systems with proteins on membranes
P systems with proteins on membranes are a class of bio-inspired computing models,where the execution of each rule completes in exactly one time unit. However, in livingcells, the execution time of biochemical reactions is difficult to know precisely because ofvarious uncontrollable factors. In this...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2016 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/107940 |
| Acceso en línea: | https://hdl.handle.net/11441/107940 https://doi.org/10.1016/j.jcss.2016.03.008 |
| Access Level: | acceso abierto |
| Palabra clave: | P System Membrane protein Time-free uniform solution SAT |
| Sumario: | P systems with proteins on membranes are a class of bio-inspired computing models,where the execution of each rule completes in exactly one time unit. However, in livingcells, the execution time of biochemical reactions is difficult to know precisely because ofvarious uncontrollable factors. In this work, we present a time-free uniform solution toSATproblem by P systems with proteins on membranes in the sense that the correctnessof the solution is irrelevant to the times associated with the involved rules, and the Psystems are constructed from the sizes of instances. |
|---|