2016-02-112016-02-11200484-688-6101-4http://hdl.handle.net/11441/34553The aim of this paper is to study the power of parallel multiset- rewriting systems with permitting context (or P systems with non-cooperative rules with promoters). The main result obtained is that if we use promoters of weight two, then the system is universal. Moreover, the construction satis¯es a special property we de¯ne: it is ulti- mately con°uent. This means that if the system allows at least one halting computation, then its ¯nal con¯guration is reachable from any reachable con- ¯guration.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/openAccess