Universality of a reversible two-counter machine
Theoretical Computer Science - Special issue on universal machines and computations
Membrane Computing: An Introduction
Membrane Computing: An Introduction
A Simple Universal Logic Element and Cellular Automata for Reversible Computing
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Computation: finite and infinite machines
Computation: finite and infinite machines
Reversible P Systems to Simulate Fredkin Circuits
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Membrane Computing
Logical reversibility of computation
IBM Journal of Research and Development
A universal reversible turing machine
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Reversibility and determinism in sequential multiset rewriting
UC'10 Proceedings of the 9th international conference on Unconventional computation
Sequential and maximally parallel multiset rewriting: reversibility and determinism
Natural Computing: an international journal
Properties of membrane systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Reversible spiking neural P systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
Membrane computing is a formal framework of distributed parallel computing. In this paper we study the reversibility and maximal parallelism of P systems from the computability point of view. The notions of reversible and strongly reversible systems are considered. The universality is shown for reversible P systems with either priorities or inhibitors, and a negative conjecture is stated for reversible P systems without such control. Strongly reversible P systems without control have shown to only generate sub-finite sets of numbers; this limitation does not hold if inhibitors are used. Another concept considered is strong determinism, which is a syntactic property, as opposed to the determinism typically considered in membrane computing. Strongly deterministic P systems without control only accept sub-regular sets of numbers, while systems with promoters and inhibitors are universal.