Affiliation:
1. Silesian University in Opava
Abstract
Abstract
Spiking neural P systems (SNPS) are variants of the third-generation neural networks. In the last few decades, different variants of SNPS models have been introduced. In most of the SNPS models, spikes are represented using an alphabet with just one letter. In this paper we use a deterministic SNPS model with coloured spikes (i.e., the alphabet representing spikes contains multiple letters), together with neuron division rules to demonstrate an efficient solution to the SAT problem. As a result, we provide a simpler construction with significantly less class resources to solve the SAT problem in comparison to previously reported results using SNPSs.
MSC Classification: 68Q05 , 68Q42 , 68Q45 , 92D20
Publisher
Research Square Platform LLC
Reference34 articles.
1. Foster, Ian AND Kesselman, Carl The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, 1-55860-475-8, 1999, San Francisco
2. Ionescu, Mihai and P{\u{a}}un, Gheorghe and Yokomori, Takashi (2006) Spiking neural {P} systems. Fundamenta informaticae 71(2-3): 279--308 IOS Press
3. Ishdorj, Tseren-Onolt and Leporati, Alberto (2008) Uniform solutions to {SAT} and 3-{SAT} by spiking neural {P} systems with pre-computed resources. Natural Computing 7: 519--534 Springer
4. Ishdorj, Tseren-Onolt and Leporati, Alberto and Pan, Linqiang and Zeng, Xiangxiang and Zhang, Xingyi (2010) Deterministic solutions to {QSAT} and {Q3SAT} by spiking neural {P} systems with pre-computed resources. Theoretical Computer Science 411(25): 2345--2358 Elsevier
5. Leporati, Alberto and Guti{\'e}rrez-Naranjo, Miguel A (2008) Solving {Subset Sum} by spiking neural {P} systems with pre-computed resources. Fundamenta Informaticae 87(1): 61--77 IOS Press