Computationally Complete Spiking Neural P Systems without Delay: Two Types of Neurons Are Enough
In this paper, we consider spiking neural P systems without delay with specific restrictions on the types of neurons. Two neurons are considered to be of the same type if the rules, the number of spikes in the initial configuration and the number of outgoing synapses are identical. We show that comp...
Saved in:
Published in | Membrane Computing pp. 198 - 207 |
---|---|
Main Authors | , |
Format | Book Chapter |
Language | English |
Published |
Berlin, Heidelberg
Springer Berlin Heidelberg
|
Series | Lecture Notes in Computer Science |
Online Access | Get full text |
Cover
Loading…
Summary: | In this paper, we consider spiking neural P systems without delay with specific restrictions on the types of neurons. Two neurons are considered to be of the same type if the rules, the number of spikes in the initial configuration and the number of outgoing synapses are identical. We show that computational completeness can be achieved in both the generating and the accepting case with only two types of neurons, where the number of neurons with unbounded rules is constant even minimal. |
---|---|
ISBN: | 3642181228 9783642181221 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-642-18123-8_16 |