Computing with membranes
type: Item
instance of: scholarly article
title: Computing with membranes
zbMATH Open document ID: 0956.68055
author: Gheorghe Păun
published in: Journal of Computer and System Sciences
publication date: 2001-01-11T00:00:00Z
review text: New models of massive parallel computation devices are suggested. The basic idea of these devices is the modelling of the evolution of a family of cells. It is a modification of DNA-computers or neural networks or abstract chemistry machines. Three versions of the device are defined, the first one computes subsets of natural numbers, the second (or third) type of the device computes subsets of strings -- languages -- using rewriting (or splicing) rules. It is proved that all suggested models compute exactly recursive enumerable sets, even strong restricted conditions on them are given. Some open problems concerning effectiveness of computations are formulated.
reviewed by: Václav Koubek
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1515684
zbMATH Keywords: a membrane structure
zbMATH Keywords: a natural computing
zbMATH Keywords: a recursively enumerable set
MaRDI profile type: Publication
OpenAlex ID: W2158708642
cites work: The chemical abstract machine
cites work: Mobile ambients
cites work: Q4763798
cites work: On the computational completeness of context-free parallel communicating grammar systems
cites work: Q4453227
cites work: Petri net algorithms in the theory of matrix grammars
cites work: Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
cites work: 2-testability and relabelings produce everything
cites work: Q4223673
cites work: Q3982094
cites work: Q4267179
cites work: Q4520789
cites work: Q4140407
cites work: Q4714446
DOI: 10.1006/JCSS.1999.1693
description: scientific article; zbMATH DE number 1515684