On a partial affirmative answer for a Paun's Conjecture
At the beginning of 2005, Gheorghe Pun formulated a conjecture stating that in the framework of recognizer P systems with active membranes (evolution rules, communication rules, dissolution rules and division rules for elementary membranes), polarizations cannot be avoided in order to solve computat...
| Autores: | , , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2011 |
| País: | España |
| Recursos: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/156952 |
| Acesso em linha: | https://hdl.handle.net/11441/156952 https://doi.org/10.1142/S0129054111007824 |
| Access Level: | acceso abierto |
| Palavra-chave: | Active membranes Computational complexity Dissolution rules Polarizationless P systems Tractability |
| Resumo: | At the beginning of 2005, Gheorghe Pun formulated a conjecture stating that in the framework of recognizer P systems with active membranes (evolution rules, communication rules, dissolution rules and division rules for elementary membranes), polarizations cannot be avoided in order to solve computationally hard problems efficiently (assuming that P ≠ NP). At the middle of 2005, a partial positive answer was given, proving that the conjecture holds if dissolution rules are forbidden. In this paper we give a detailed and complete proof of this result modifying slightly the notion of dependency graph associated with recognizer P systems. |
|---|