https://hal.science/hal-03438339Alhazov, ArtiomArtiomAlhazovVladimir Andrunachievici Institute of Mathematics and Computer ScienceFreund, RudolfRudolfFreundFaculty of Informatics - TU Wien - Vienna University of TechnologyIvanov, SergiuSergiuIvanovIBISC - Informatique, BioInformatique, Systèmes Complexes - UEVE - Université d'Évry-Val-d'Essonne - Université Paris-SaclayVerlan, SergeySergeyVerlanLACL - Laboratoire d'Algorithmique Complexité et Logique - UPEC UP12 - Université Paris-Est Créteil Val-de-Marne - Paris 12Variants of derivation modes for which catalytic P systems with one catalyst are computationally completeHAL CCSD2021[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO]Davesne, Frédéric2021-11-21 15:59:512023-04-19 03:39:412021-11-21 15:59:51enJournal articles10.1007/s41965-021-00085-z1Abstract Catalytic P systems are among the first variants of membrane systems ever considered in this area. This variant of systems also features some prominent computational complexity questions, and in particular the problem of using only one catalyst: is one catalyst enough to allow for generating all recursively enumerable sets of multisets? Several additional ingredients have been shown to be sufficient for obtaining even computational completeness with only one catalyst. Last year we could show that the derivation mode $$max_{objects}$$ m a x objects , where we only take those multisets of rules which affect the maximal number of objects in the underlying configuration one catalyst is sufficient for obtaining computational completeness without any other ingredients. In this paper we follow this way of research and show that one catalyst is also sufficient for obtaining computational completeness when using specific variants of derivation modes based on non-extendable multisets of rules: we only take those non-extendable multisets whose application yields the maximal number of generated objects or else those non-extendable multisets whose application yields the maximal difference in the number of objects between the newly generated configuration and the current configuration. A similar computational completeness result can even be obtained when omitting the condition of non-extendability of the applied multisets when taking the maximal difference of objects or the maximal number of generated objects. Moreover, we reconsider simple P system with energy control—both symbol and rule energy-controlled P systems equipped with these new variants of derivation modes yield computational completeness.