Proof techniques in Membrane Computing
From the creation of the field of Membrane Computing in 1998, several research lines havebeen opened. On the one hand, theoretical questions like the computational power and thecomputational efficiency of P systems have been studied. In this sense, several techniquesto demonstrate the ability of the...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2021 |
| 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/107709 |
| Acceso en línea: | https://hdl.handle.net/11441/107709 https://doi.org/10.1016/j.tcs.2020.09.041 |
| Access Level: | acceso abierto |
| Palabra clave: | Membrane Computing Computability theory Computational complexity theory |
| Sumario: | From the creation of the field of Membrane Computing in 1998, several research lines havebeen opened. On the one hand, theoretical questions like the computational power and thecomputational efficiency of P systems have been studied. In this sense, several techniquesto demonstrate the ability of these systems to provide solutions to computational problemshave been explored. The study of efficient(polynomial-time) solutions to presumably hardproblems for finding thin frontiers of efficiency is a very active area. On the other hand,several applications in biology, ecology, economy, robotics and fault diagnosis, amongothers, have been investigated. Real systems with some characteristics seem to be easyto model with membrane systems due to their behaviour. In this work, a survey of thetheoretical part will be given, explaining techniques both in the field of computabilitytheory and in the field of computational complexity theory. |
|---|