Title: Variants of P systems with activation and blocking of rules
Language: English
Authors: Alhazov, Artiom
Freund, Rudolf
Ivanov, Sergiu
Category: Research Article
Keywords: Activation of rules; Blocking of rules; Computational completeness; Derivation modes; P systems; Go beyond Turing
Issue Date: 2019
Journal: Natural Computing
We introduce new possibilities to control the application of rules based on the preceding applications, which can be defined in a general way for (hierarchical) P systems and the main known derivation modes. Computational completeness can be obtained even with non-cooperative rules and using both activation and blocking of rules, especially for the set modes of derivation, when allowing derivation steps with no rules being applied. When we allow the application of rules to influence the application of rules in previous derivation steps, applying a non-conservative semantics for what we consider to be a valid infinite derivation, we can even “go beyond Turing”.
DOI: 10.1007/s11047-019-09747-5
Library ID: AC15532394
URN: urn:nbn:at:at-ubtuw:3-7742
ISSN: 1572-9796
Organisation: E192 - Institut für Logic and Computation 
Publication Type: Article
Appears in Collections:Article

Files in this item:

File Description SizeFormat
Variants of P systems with activation and blocking of rules.pdf446.99 kBAdobe PDFThumbnail
Show full item record

Page view(s)

checked on Mar 1, 2021


checked on Mar 1, 2021

Google ScholarTM


This item is licensed under a Creative Commons License Creative Commons