On the computational complexity of spiking neural P systems

Details On the computational complexity of spiking neural P systems On the computational complexity of spiking neural P systems

2009-12-04

arxiv.org/abs/0912.0928v1

Computer Science

Computational Complexity

Scientific paper

It is shown that there is no standard spiking neural P system that simulates Turing machines with less than exponential time and space overheads. The spiking neural P systems considered here have a constant number of neurons that is independent of the input length. Following this we construct a universal spiking neural P system with exhaustive use of rules that simulates Turing machines in linear time and has only 10 neurons.

Affiliated with

Also associated with

No associations

Rating

On the computational complexity of spiking neural P systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the computational complexity of spiking neural P systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the computational complexity of spiking neural P systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-706334