Variants of P systems with activation and blocking of rules

Artiom Alhazov (1) , Rudolf Freund (2) , Sergiu Ivanov (3)

1 Vladimir Andrunachievici Institute of Mathematics and Computer Science
2 Faculty of Informatics
3 IBISC - Informatique, BioInformatique, Systèmes Complexes

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

Mots clés: Activation of rules; Blocking of rules; Computational completeness; Derivation modes; Go beyond Turing; P systems

Domaines: Théorie de l'information [cs.IT]; Informatique et théorie des jeux [cs.GT]

Artiom Alhazov, Rudolf Freund, Sergiu Ivanov. Variants of P systems with activation and blocking of rules. Natural Computing, 2019, 18 (3), pp.593--608. ⟨10.1007/s11047-019-09747-5⟩. ⟨hal-02275967⟩