Spiking neural P systems with an exhaustive use of rules

We consider spiking neural P systems with a new type of rule application: whenever a rule is enabled in a neuron, it is used in an exhaustive manner, i.e., as many times as possible for the number of spikes from that neuron. Thus, also the number of spikes produced at a time in that neuron can be arbitrarily large; all produced spikes are transmitted to neighboring neurons through synapses. A result is associated with a computation as usual, in the form of the number of time units elapsed between the first two steps when the Output neuron spikes. In this framework, we prove the computational completeness of Our systems, both as number generating devices and as number accepting devices. Several research topics are also pointed out.