Ponencia
About the Efficiency of Spiking Neural P Systems
Autor/es | Wang, Jun
Ishdorj, Tseren-Onolt Pan, Linqiang |
Fecha de publicación | 2009 |
Fecha de depósito | 2016-03-23 |
Publicado en |
|
ISBN/ISSN | 9788461328369 |
Resumen | Spiking neural P systems were proved to be Turing complete as function
computing or number generating devices. Moreover, it has been considered in several
papers that spiking neural P systems are also computationally ... Spiking neural P systems were proved to be Turing complete as function computing or number generating devices. Moreover, it has been considered in several papers that spiking neural P systems are also computationally efficient devices working in a non-deterministic way or with exponential pre-computed resources. In this paper, neuron budding rules are introduced in the framework of spiking neural P systems, which is biologically inspired by the growth of dendritic tree of neuron. Using neuron budding rules in SN P systems is a way to trade space for time to solve computational intractable problems. The approach is examined here with a deterministic and polynomial time solution to sat problem without using exponential pre-computed resources. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
22_SNP_neuron_production.pdf | 448.2Kb | [PDF] | Ver/ | |