Ininvertible cellular automata: a review
Physica D
Universality of a reversible two-counter machine
Theoretical Computer Science - Special issue on universal machines and computations
Journal of Computer and System Sciences
Handbook of Formal Languages
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
On string languages generated by spiking neural P systems with exhaustive use of rules
Natural Computing: an international journal
Irreversibility and heat generation in the computing process
IBM Journal of Research and Development
Logical reversibility of computation
IBM Journal of Research and Development
Homogeneous Spiking Neural P Systems
Fundamenta Informaticae
Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
Theoretical Computer Science
A universal reversible turing machine
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Spiking neural p systems with weights
Neural Computation
Time-free spiking neural p systems
Neural Computation
Spiking neural p systems with astrocytes
Neural Computation
On reversibility and determinism in p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
On String Languages Generated by Spiking Neural P Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Fundamenta Informaticae
Reversible P Systems to Simulate Fredkin Circuits
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Hi-index | 0.00 |
Spiking neural (SN) P systems are a class of distributed parallel computing devices inspired by the way neurons communicate by means of spikes. In this work, we investigate reversibility in SN P systems, as well as the computing power of reversible SN P systems. Reversible SN P systems are proved to have Turing creativity, that is, they can compute any recursively enumerable set of non-negative integers by simulating universal reversible register machine.