Open Access
Spiking Neural dP Systems
Mihai Ionescu,Gheorge Paun,Mario de Jesús Pérez Jiménez,Takashi Yokomori +3 more
- pp 193-208
TLDR
This work brings together two topics recently introduced in membrane computing, the much investigated spiking neural P systems and the distributed P systems, and introduces SN dP systems, with the possibility to input, at their request, spikes from the environment.About:
The article was published on 2011-01-01 and is currently open access. It has received 109 citations till now.read more
Citations
More filters
Journal ArticleDOI
On spiking neural P systems
TL;DR: This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some variants, and proposes a methodology based on the information given by the transition diagram associated with an SN P system which establishes the soundness and completeness of the system with respect to the problem it tries to resolve.
Journal ArticleDOI
Spiking Neural P Systems with Anti-Spikes
Linqiang Pan,Gheorghe Paun +1 more
TL;DR: This simple extension of spiking neural P systems is shown to considerably simplify the universality proofs in this area, where all rules become of the form bc → b′ or bc → lambda , where b,b′ are spikes or anti-spikes.
Journal ArticleDOI
Computational complexity of tissue-like P systems
TL;DR: A new class of tissue-like P systems with cell separation, a feature which allows the generation of new workspace is presented, and it is concluded that a borderline between efficiency and non-efficiency exists in terms of the length of communication rules.
Journal ArticleDOI
Spiking neural P systems with request rules
Tao Song,Linqiang Pan +1 more
TL;DR: It is obtained that SN P systems with request rules are Turing universal, even with a small number of neurons, and with 47 neurons such systems can compute any Turing computable function.
Journal ArticleDOI
Spiking neural P systems with multiple channels
TL;DR: It is proved that SNP-MC systems are Turing universal as both number generating and number accepting devices.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book
Computation: Finite and Infinite Machines
TL;DR: In this article, the authors present an abstract theory that categorically and systematically describes what all these machines can do and what they cannot do, giving sound theoretical or practical grounds for each judgment, and the abstract theory tells us in no uncertain terms that the machines' potential range is enormous and that its theoretical limitations are of the subtlest and most elusive sort.
Book
Membrane Computing: An Introduction
TL;DR: This chapter discusses Membrane Computing, What It Is and What It is Not, and attempts to get back to reality with open problems and Universality results.
Book
The Oxford Handbook of Membrane Computing
TL;DR: This handbook provides both a comprehensive survey of available knowledge and established research topics, and a guide to recent developments in the field, covering the subject from theory to applications.
Book
Communication Complexity and Parallel Computing
TL;DR: This book is written as a textbook for undergraduate and graduate students and provides a careful explanation of the subject as well as motivation for further research.