Turing universality of sequential spiking neural P systems with polarizations as number accepting devices

To take full advantage of the information transfer mechanism of biological nervous systems, we consider a new computational model of spiking neural P systems with polarizations (PSN P systems). Compared to spiking neural P systems (SN P systems), PSN P systems use more simple formal language rules, and the behavioral changes of each neuron are jointly controlled by the number of spikes and the polarity state (+, 0, - charge), making systems also have a powerful distributed parallel computing capability. Following the fact that SN P systems can operate as different modes, we consider the computation power of sequential PSN P systems in the accepting mode. In this work, we prove Turing universality of PSN P systems using the min-sequentiality and max-sequentiality strategies as number accepting devices by simulating the deterministic register machine.