Spiking neural P systems with neuron division

Abstract

Spiking neural P systems (SN P systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. The features of neuron division and neuron budding are recently introduced into the framework of SN P systems, and it was shown that SN P systems with neuron division and neuron budding can efficiently solve computationally hard problems. In this work, the computation power of SN P systems with neuron division only, without budding, is investigated; it is proved that a uniform family of SN P systems with neuron division can efficiently solve SAT in a deterministic way, not using budding, while additionally limiting the initial size of the system to a constant number of neurons. This answers an open problem formulated by Pan et al. © 2010 Springer-Verlag.