P Systems with Anti-Matter

The concept of a matter object being annihilated when meeting its corresponding anti-matter object is investigated in the context of P systems. Computational completeness can be obtained with using only non-cooperative rules besides these matter/anti-matter annihilation rules if these annihilation rules have priority over the other rules. Without this priority condition, in addition catalytic rules with one single catalyst are needed to get computational completeness. Even deterministic systems are obtained in the accepting case. Allowing anti-matter objects as input and/or output, we even get a computationally complete computing model for computations on integer numbers. Interpreting sequences of symbols taken in from and/or sent out to the environment as strings, we get a model for computations on strings, which can even be interpreted as representations of elements of a group based on a computable finite presentation.

[1]  Gabriel Ciobanu,et al.  Applications of Membrane Computing , 2006, Applications of Membrane Computing.

[2]  Tao Song,et al.  Small Universal Spiking Neural P Systems with Anti-Spikes , 2013 .

[3]  Artiom Alhazov,et al.  Static Sorting P Systems , 2006, Applications of Membrane Computing.

[4]  Rudolf Freund,et al.  Event-Related Outputs of Computations in P Systems , 2006, J. Autom. Lang. Comb..

[5]  Andrei Paun,et al.  Small universal spiking neural P systems , 2007, Biosyst..

[6]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[7]  Miguel Ángel Gutiérrez Naranjo,et al.  Antimatter as a Frontier of Tractability in Membrane Computing , 2014 .

[8]  Fan Xiaoping,et al.  Homogeneous Spiking Neural P Systems with Anti-spikes , 2013 .

[9]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

[10]  Xun Wang,et al.  Homogenous spiking neural P systems with anti-spikes , 2013, Neural Computing and Applications.

[11]  Christopher J. Bishop,et al.  Pulsed Neural Networks , 1998 .

[12]  Artiom Alhazov,et al.  Antimatter as a Frontier of Tractability in Membrane Computing , 2014, Fundam. Informaticae.

[13]  Rudolf Freund,et al.  Computationally universal P systems without priorities: two catalysts are sufficient , 2005, Theor. Comput. Sci..

[14]  Marian Gheorghe,et al.  Research Frontiers of membrane Computing: Open Problems and Research Topics , 2013, Int. J. Found. Comput. Sci..

[15]  Gheorghe Paun,et al.  Spiking Neural P Systems with Anti-Spikes , 2009, Int. J. Comput. Commun. Control.

[16]  Artiom Alhazov,et al.  Matter and Anti-Matter in Membrane Systems , 2014, DCFS.

[17]  Erzsébet Csuhaj-Varjú,et al.  P Automata or Purely Communicating Accepting P Systems , 2002, WMC-CdeA.

[18]  Alica Kelemenová,et al.  Universality of Spiking Neural P Systems with Anti-spikes , 2014, TAMC.

[19]  Xiangxiang Zeng,et al.  Spiking neural P systems with anti-spikes and without annihilating priority working in a 'flip-flop' way , 2013, Int. J. Comput. Sci. Math..

[20]  Oscar H. Ibarra,et al.  Normal forms for spiking neural P systems , 2007, Theor. Comput. Sci..

[21]  Rudolf Freund,et al.  How to Obtain Computational Completeness in P Systems with One Catalyst , 2013, MCU.

[22]  Kamala Krithivasan,et al.  On String Languages Generated by Spiking Neural P Systems with Anti-Spikes , 2011, Int. J. Found. Comput. Sci..

[23]  Gheorghe Paun.  Spiking Neural P Systems: A Tutorial , 2007, Bull. EATCS.

[25]  Florent Jacquemard,et al.  An Analysis of a Public Key Protocol with Membranes , 2005 .

[26]  E. O'Brien,et al.  Handbook of Computational Group Theory , 2005 .

[27]  Jozef Gruska.  Descriptional Complexity of Context-Free Languages , 1973, MFCS.

[28]  Rudolf Freund,et al.  Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness , 2015, Fundam. Informaticae.

[29]  Rudolf Freund,et al.  A Small Universal Antiport P System with Forbidden Context , 2006, DCFS.

[30]  Pierluigi Frisco,et al.  Applications of Membrane Computing in Systems and Synthetic Biology , 2014 .

[31]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[32]  Sydney S. Weinstein,et al.  Flip/flop , 1993 .

[33]  Manfred Kudlek,et al.  Small universal Turing and circular Post machines , 2002 .

[34]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[35]  Kamala Krithivasan,et al.  Modelling and analysis of spiking neural P systems with anti-spikes using Pnet lab , 2011, Nano Commun. Networks.

[37]  Kamala Krithivasan,et al.  COMPUTABILITY OF SPIKING NEURAL P SYSTEMS WITH ANTI-SPIKES , 2012 .

[38]  Kenneth Foster,et al.  New math , 2009, IEEE Spectrum.

[39]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[40]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[41]  Ivan Korec,et al.  Small Universal Register Machines , 1996, Theor. Comput. Sci..