On the computational complexity of spiking neural P systems

DOI10.1007/S11047-010-9213-1zbMath1207.68141arXiv0912.0928OpenAlexW2397533176MaRDI QIDQ609034

Turlough Neary

Publication date: 30 November 2010

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0912.0928

zbMATH Keywords

computational complexitylinear timespiking neural P systemsmall universal spiking neural P systemtime efficient spiking neural P system

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (7)

Sequentiality Induced by Spike Number in SNP Systems: Small Universal Machines ⋮ Universal Sleptsov net ⋮ Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States ⋮ On solutions and representations of spiking neural P systems with rules on synapses ⋮ Three small universal spiking neural P systems ⋮ Small SNQ P systems with multiple types of spikes ⋮ Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application

Cites Work

• Unnamed Item
• Unnamed Item
• Small universal register machines
• A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems
• Solving Numerical NP-Complete Problems with Spiking Neural P Systems
• Counter machines and counter languages

This page was built for publication: On the computational complexity of spiking neural P systems