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

中文翻译：

---

具有激活和禁止规则的P系统的变体

我们引入了基于先前应用程序来控制规则应用程序的新可能性，可以以通用方式为（分层）P系统和主要的已知派生模式定义规则。当允许不应用任何规则的推导步骤时，即使使用非合作规则，也可以使用规则的激活和阻止来获得计算完整性。如果我们允许规则的应用影响先前推导步骤中规则的应用，对我们认为有效的无限推导应用非保守语义，我们甚至可以“超越图灵”。