Asynchronous Spiking Neural P Systems: Decidability and Undecidability

In search for “realistic” bio-inspired computing models, we consider asynchronous spiking neural P systems, in the hope to get a class of computing devices with decidable properties. However, although the non-synchronization is known in general to decrease the computing power, in the case of using extended rules (several spikes can be produced by a rule) we obtain again the equivalence with Turing machines (interpreted as generators of sets of vectors of numbers). The problem remains open for the case of restricted spiking neural P systems, whose rules can only produce one spike. On the other hand, we prove that asynchronous spiking neural P systems, with a specific way of halting, using extended rules and where each neuron is either bounded or unbounded, are equivalent to partially blind counter machines and, therefore, have many decidable properties. 1 Spiking Neural P Systems – An Informal Presentation In the present paper we continue the investigation of spiking neural P sys...

• Type: Conference
• Year: 2007
• Where: DNA
• Authors: Matteo Cavaliere, Ömer Egecioglu, Oscar H. Ibarra, Mihai Ionescu, Gheorghe Paun, Sara Woodworth
• Keywords: Asynchronous Spiking, Decidable Properties, DNA 2007, Neural