Spiking neural P systems with anti-spikes （ASN P systems） are variant forms of spiking neural P systems, which are inspired by inhibitory impulses/spikes or inhibitory synapses. The typical feature of ASN P systems ...Spiking neural P systems with anti-spikes （ASN P systems） are variant forms of spiking neural P systems, which are inspired by inhibitory impulses/spikes or inhibitory synapses. The typical feature of ASN P systems is when a neuron contains both spikes and anti-spikes, spikes and anti-spikes wil immediately annihilate each other in a maximal way. In this paper, a restricted variant of ASN P systems, cal ed ASN P systems without anni-hilating priority, is considered, where the annihilating rule is used as the standard rule, i.e., it is not obligatory to use in the neuron associated with both spikes and anti-spikes. If the annihilating rule is used in a neuron, the annihilation wil consume one time unit. As a result, such systems using two categories of spiking rules （identified by （a, a） and （a,a^-）） can achieve Turing completeness as number accepting devices.展开更多
基金supported by the National Natural Science Foundation of China(6103300361100145+1 种基金91130034)the China Postdoctoral Science Foundation(2014M550389)
文摘Spiking neural P systems with anti-spikes （ASN P systems） are variant forms of spiking neural P systems, which are inspired by inhibitory impulses/spikes or inhibitory synapses. The typical feature of ASN P systems is when a neuron contains both spikes and anti-spikes, spikes and anti-spikes wil immediately annihilate each other in a maximal way. In this paper, a restricted variant of ASN P systems, cal ed ASN P systems without anni-hilating priority, is considered, where the annihilating rule is used as the standard rule, i.e., it is not obligatory to use in the neuron associated with both spikes and anti-spikes. If the annihilating rule is used in a neuron, the annihilation wil consume one time unit. As a result, such systems using two categories of spiking rules （identified by （a, a） and （a,a^-）） can achieve Turing completeness as number accepting devices.
