Spiking neural P systems

Mihai Ionescu, Gheorghe Pǎun, Takashi Yokomori

Research output: Contribution to journalArticle

507 Citations (Scopus)

Abstract

This paper proposes a way to incorporate the idea of spiking neurons into the area of membrane computing, and to this aim we introduce a class of neural-like P systems which we call spiking neural P systems (in short, SN P systems). In these devices, the time (when the neurons fire and/or spike) plays an essential role. For instance, the result of a computation is the time between the moments when a specified neuron spikes. Seen as number computing devices, SN P systems are shown to be computationally complete (both in the generating and accepting modes, in the latter case also when restricting to deterministic systems). If the number of spikes present in the system is bounded, then the power of SN P systems falls drastically, and we get a characterization of semilinear sets. A series of research topics and open problems are formulated.

Original languageEnglish
Pages (from-to)279-308
Number of pages30
JournalFundamenta Informaticae
Volume71
Issue number2-3
Publication statusPublished - 2006 Jan 1

    Fingerprint

Keywords

  • Membrane computing
  • Semilinear set
  • Spiking neurons
  • Turing computability

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Information Systems
  • Computational Theory and Mathematics

Cite this

Ionescu, M., Pǎun, G., & Yokomori, T. (2006). Spiking neural P systems. Fundamenta Informaticae, 71(2-3), 279-308.