Opened Access About the Efficiency of Spiking Neural P Systems
Estadísticas
Icon
Exportar a
Autor: Wang, Jun
Ishdorj, Tseren-Onolt
Pan, Linqiang
Fecha: 2009
Publicado en: Proceedings of the Seventh Brainstorming Week on Membrane Computing, vol.II, 235-251. Sevilla, E.T.S. de Ingeniería Informática, 2-6 de Febrero, 2009
ISBN/ISSN: 9788461328369
Tipo de documento: Ponencia
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 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.
Tamaño: 448.2Kb
Formato: PDF

URI: http://hdl.handle.net/11441/38945

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones