Computationally complete spiking neural P systems without delay: two types of neurons are enough

Authors:
Rudolf Freund;Marian Kogler
Affiliations:
Faculty of Informatics, Vienna University of Technology, Vienna, Austria;Faculty of Informatics, Vienna University of Technology, Vienna, Austria and Institute of Computer Science, Martin Luther University Halle-Wittenberg, Halle, Saale, Germany
Venue:
CMC'10 Proceedings of the 11th international conference on Membrane computing
Year:
2010

Citing 8
Cited 0

Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Computation: finite and infinite machines

Computation: finite and infinite machines
Spiking Neural P Systems

Fundamenta Informaticae
Normal forms for spiking neural P systems

Theoretical Computer Science
Smaller Universal Spiking Neural P Systems

Fundamenta Informaticae
Homogeneous Spiking Neural P Systems

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.