Now showing items 17-19 of 19

    • Icon

      The "Catalytic Borderline" Between Universality and Non-Universality of P Systems  [Presentation]

      Paun, Gheorghe (Fénix Editora, 2013)
      P systems are computing models inspired by the structure and the function- ing of the living cells; they are the basic computing devices of membrane computing, a branch of natural computing. The present note is an overview ...
    • Icon

      Turing Incompleteness of Asynchronous P Systems with Active Membranes  [Presentation]

      Leporati, Alberto; Manzoni, Luca; Porreca, Antonio E. (Fénix Editora, 2013)
      We prove that asynchronous P systems with active membranes without divi- sion rules can be simulated by place/transition Petri nets, and hence are computationally weaker than Turing machines. This result holds even if ...
    • Icon

      Universal P Systems: One Catalyst Can Be Suficient  [Presentation]

      Freund, Rudolf; Paun, Gheorghe (Fénix Editora, 2013)
      Whether P systems with only one catalyst can already be universal, is still an open problem. Here we establish universality (computational completeness) by using speci c variants of additional control mechanisms. At each ...