Universality Results for Spiking Neural P Systems with Cooperating Rules
From International Center for Computational Logic
Universality Results for Spiking Neural P Systems with Cooperating Rules
Talk by Maximilian Marx
- Location: APB 3027
- Start: 4. May 2016 at 2:50 pm
- End: 4. May 2016 at 3:50 pm
- Research group: Knowledge-Based Systems
- Event series: KBS Seminar
- iCal
Metta, Raghuraman, and Krithivasan introduce the concept of Spiking Neural systems with cooperating rules, bringing the ideas behind cooperating distributed grammar systems (CD grammar systems) to the world of Spiking Neural P systems (SN P systems), a model for computation inspired by the functioning of neurons in a nervous system. An essential feature in these systems is the cooperation of multiple components according to some fixed cooperation protocol. Building on the proof by Metta, Raghuraman, and Krithivasan for the terminating protocol, we show that universality can be retained for the other cooperation protocols by slightly lifting some of the model’s restrictions, such as using the maximally parallel mode of derivation instead of the strongly sequential mode, or allowing for local synchronization in the asynchronous case. We present a concrete example demonstrating the power of the model by generating a non-semi-linear (and hence non-context-free) set of numbers, and contrast it with a CD grammar system generating the same set.