Name
Abstract | ||
|---|---|---|
We consider extended spiking neural P systems with the additional possibility of so-called “white hole rules”, which send the complete contents of a neuron to other neurons, and we prove that this extension of the original model can easily simulate register machines. Based on this proof, we then define red–green variants of these extended spiking neural P systems with white hole rules and show how to go beyond Turing with these red–green systems. We also discuss the number of actor neurons needed, and the relation of this model to some special variants of Lindenmayer systems. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s11047-017-9649-7 | Natural Computing |
Keywords | Field | DocType |
Going beyond Turing,Red-green automata,Spiking neural P systems,White hole rules | Discrete mathematics,Turing,Mathematics,White hole | Journal |
Volume | Issue | ISSN |
17 | 2 | 1567-7818 |
Citations | PageRank | References |
1 | 0.35 | 16 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Artiom Alhazov | 1 | 642 | 68.17 |
| Rudolf Freund | 2 | 1000 | 109.64 |
| Sergiu Ivanov | 3 | 34 | 12.84 |
| Marion Oswald | 4 | 320 | 30.27 |
| Sergey Verlan | 5 | 415 | 45.40 |