Artículo
Computational efficiency and universality of timed P systems with membrane creation
Autor/es | Song, Bosheng
Pérez Jiménez, Mario de Jesús Pan, Linqiang |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2015 |
Fecha de depósito | 2021-05-20 |
Publicado en |
|
Resumen | P systems are a class of distributed parallel computing
models inspired by the structure and the functioning
of a living cell, where the execution of each rule is
completed in exactly one time unit (a global clock ... P systems are a class of distributed parallel computing models inspired by the structure and the functioning of a living cell, where the execution of each rule is completed in exactly one time unit (a global clock is assumed). How-ever, in living cells, the execution time of different biological processes is difficult to know precisely and very sensi-tive to environmental factors that might be hard to control. Inspired from this biological motivation, in this work, timed polarization P systems with membrane creation are intro-duced and their computational efficiency and universality are investigated. Specifically, we give a time-free semi-uniform solution to the SAT problem by a family of P systems with membrane creation in the sense that the correctness of the solution is irrelevant to the times associated with the involved rules. We also prove that timefree P systems with membrane creation are computationally universal. |
Agencias financiadoras | Ministerio de Economía y Competitividad (MINECO). España |
Identificador del proyecto | TIN2012-37434 |
Cita | Song, B., Pérez Jiménez, M.d.J. y Pan, L. (2015). Computational efficiency and universality of timed P systems with membrane creation. Soft Computing, 19 (11), 3043-3053. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Computational efficiency and ... | 486.2Kb | [PDF] | Ver/ | |