On the power of elementary features in spiking neural P systems

  • Authors:

  • Marc García-Arnau;David Pérez;Alfonso Rodríguez-Patón;Petr Sosík

  • Affiliations:

  • Departamento de Inteligencia Artificial, Facultad de Informática, Universidad Politécnica de Madrid --- UPM, Boadilla del Monte, Spain 28660;Departamento de Inteligencia Artificial, Facultad de Informática, Universidad Politécnica de Madrid --- UPM, Boadilla del Monte, Spain 28660;Departamento de Inteligencia Artificial, Facultad de Informática, Universidad Politécnica de Madrid --- UPM, Boadilla del Monte, Spain 28660;Departamento de Inteligencia Artificial, Facultad de Informática, Universidad Politécnica de Madrid --- UPM, Boadilla del Monte, Spain 28660 and Institute of Computer Science, Silesian U ...

  • Venue:
  • Natural Computing: an international journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Since their first publication in 2006, spiking neural (SN) P systems have already attracted the attention of a lot of researchers. This might be owing to the fact that this abstract computing device follows basic principles known from spiking neural nets, but its implementation is discrete, using membrane computing background. Among the elementary properties which confer SN P systems their computational power one can count the unbounded fan-in (indegree) and fan-out (outdegree) of each "neuron", synchronicity of the whole system, the possibility of delaying and/or removing spikes in neurons, the capability of evaluating arbitrary regular expressions in neurons in constant time and some others. In this paper we focus on the power of these elementary features. Particularly, we study the power of the model when some of these features are disabled. Rather surprisingly, even very restricted SN P systems keep their universal computational power. Certain important questions regarding this topic still remain open.