Variants of P systems with activation and blocking of rules

Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu

doi:10.1007/s11047-019-09747-5

Record link:

https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:3-7742
http://hdl.handle.net/20.500.12708/729

Title:

Variants of P systems with activation and blocking of rules

Citation:

Alhazov, A., Freund, R., & Ivanov, S. (2019). Variants of P systems with activation and blocking of rules. Natural Computing. https://doi.org/10.1007/s11047-019-09747-5

Publisher DOI:

10.1007/s11047-019-09747-5

CatalogPlus:

AC15532394

Publication Type:

Article - Original Research Article

Language:

English

Authors:

Alhazov, Artiom
Freund, Rudolf
Ivanov, Sergiu

Organisational Unit:

E192 - Institut für Logic and Computation

Journal:

Natural Computing

ISSN:

1567-7818

Date (published):

Sep-2019

Publisher:

Springer

Peer reviewed:

Yes

Keywords:

Activation of rules; Blocking of rules; Computational completeness; Derivation modes; P systems; Go beyond Turing

Abstract:

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”.

License:

CC BY 4.0