Computing with membranes (Q1582013): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The chemical abstract machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile ambients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational completeness of context-free parallel communicating grammar systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4453227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri net algorithms in the theory of matrix grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-testability and relabelings produce everything / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3982094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank

Revision as of 16:19, 30 May 2024

scientific article
Language Label Description Also known as
English
Computing with membranes
scientific article

    Statements

    Computing with membranes (English)
    0 references
    0 references
    11 January 2001
    0 references
    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.
    0 references
    a membrane structure
    0 references
    a natural computing
    0 references
    a recursively enumerable set
    0 references

    Identifiers