Recursive calculus with membranes

Authors:
Adrian Atanasiu;Carlos Martín-Vide
Affiliations:
Faculty of Mathematics, Bucharest University Str. Academiei 14 70109 Bucharest, Romania;Rovira i Virgili University Pl. Imperial Tárraco 1, 43005 Tarragona, Spain
Venue:
Fundamenta Informaticae - Membrane computing
Year:
2002

Citing 4
Cited 2

Computability and logic

Computability and logic
Computing with membranes

Journal of Computer and System Sciences
Handbook of Formal Languages

Handbook of Formal Languages
Computing with Membranes: Attacking NP-Complete Problems

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation

A guide to membrane computing

Theoretical Computer Science - Natural computing
Authentication of Messages Using P Systems

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

P systems are computing models where certain objects evolve in parallel in a hierarchical membrane structure. Recent results show that this model is a promising framework for solving NP-complete problems in polynomial time. A variant of P systems with active membranes is proposed in this paper. It uses a new operation called "subordonation", based on the process of "endocytosis" of membranes: a membrane can be entirely absorbed by another membrane, preserving its content. This class of P systems with active membranes can compute all Turing computable mappings. Arithmetical operations defined in [1] can be obtained as particular cases of primitive recursive functions, but with a higher complexity degree.