Aspects of Molecular Computing pp 322-337 | Cite as

# Membrane Computing: Some Non-standard Ideas

## Abstract

We introduce four new variants of P systems, which we call non-standard because they look rather “exotic” in comparison with systems investigated so far in the membrane computing area: (1) systems where the rules are moved across membranes rather than the objects processed by these rules, (2) systems with reversed division rules (hence entailing the elimination of a membrane when a membrane with an identical contents is present nearby), (3) systems with accelerated rules (or components), where any step except the first one takes half of the time needed by the previous step, and (4) *reliable* systems, where, roughly speaking, all possible events actually happen, providing that “enough” resources exist. We only briefly investigate these types of P systems, the main goal of this note being to formulate several related open problems and research topics.

## Keywords

Turing Machine Conjunctive Normal Form Mathematical Linguistics Synchronization Problem Membrane Computing## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Copeland, B.J.: Even Turing machines can compute uncomputable functions. In: Calude, C.S., Casti, J., Dinneen, M.J. (eds.) Unconventional Models of Computation, pp. 150–164. Springer, Heidelberg (1998)Google Scholar
- 2.Copeland, B.J., Sylvan, R.: Beyond the universal Turing machine. Australasian Journal of Phylosophy 77, 46–66 (1999)CrossRefGoogle Scholar
- 3.Ord, T.: Hypercomputation: compute more than the Turing machine, Honorary Thesis, Department of Computer Science. Univ. of Melbourne, Australia (2002), available at http://arxiv.org/ftp/math/papers/0209/0209332.pdf
- 4.Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)Google Scholar
- 5.Păun, G., Rozenberg, G.: A guide to membrane computing. Theoretical Computer Science 287, 73–100 (2002)zbMATHCrossRefMathSciNetGoogle Scholar