Solving the SAT problem using spiking neural P systems with coloured spikes and division rules

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