Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alhazov, A., Aman, B., Freund, R., Păun, Gh.: Matter and Anti-Matter in Membrane Systems. In: Macías-Ramos, L.F., Martínez-del-Amor, M.Á., Păun, Gh., Riscos-Núñez, A., Valencia-Cabrera, L. (eds.) Proceedings of the Twelfth Brainstorming Week on Membrane Computing, pp. 1–26. Fénix Editora, Sevilla (2014)
Alhazov, A., Sburlan, D.: Static Sorting P Systems. In: Ciobanu, G., Păun, Gh., Pérez-Jiménez, M.J. (eds.) Applications of Membrane Computing. Natural Computing Series, pp. 215–252. Springer (2005)
Cavaliere, M., Freund, R., Leitsch, A., Păun, Gh.: Event-Related Outputs of Computations in P Systems. Journal of Automata, Languages and Combinatorics 11(3), 263–278 (2006)
Csuhaj-Varjú, E., Vaszil, Gy.: P Automata or Purely Communicating Accepting P Systems. In: Păun, Gh., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC-CdeA 2002. LNCS, vol. 2597, pp. 219–233. Springer, Heidelberg (2003)
Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. Springer (1989)
Díaz-Pernil, D., Peña-Cantillana, F., Gutiérrez-Naranjo, M.A.: Antimatter as a Frontier of Tractability in Membrane Computing. In: Macías-Ramos, L.F., Martínez-del-Amor, M.Á., Păun, Gh., Riscos-Núñez, A., Valencia-Cabrera, L. (eds.) Proceedings of the Twelfth Brainstorming Week on Membrane Computing, pp. 155–168. Fénix Editora, Sevilla (2014)
Freund, R.: Purely Catalytic P Systems: Two Catalysts Can Be Sufficient for Computational Completeness. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Yu. (eds.) CMC14 Proceedings - The 14th International Conference on Membrane Computing, pp. 153–166. Institute of Mathematics and Computer Science, Academy of Sciences of Moldova (2013)
Freund, R., Kari, L., Oswald, M., Sosík, P.: Computationally Universal P Systems without Priorities: Two Catalysts Are Sufficient. Theoretical Computer Science 330, 251–266 (2005)
Freund, R., Oswald, M.: A Small Universal Antiport P System with Forbidden Context. In: Leung, H., Pighizzini, G. (eds.) 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006. Las Curces, New Mexico, USA, June 21–23. Proceedings DCFS, pp. 259–266. New Mexico State University, Las Cruces (2006)
Freund, R., Oswald, M., Păun, Gh.: Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness. Fundamenta Informaticae 136, 59–84 (2015)
Freund, R., Păun, Gh.: How to Obtain Computational Completeness in P Systems with One Catalyst. In: Neary, T., Cook, M. (eds.) Proceedings Machines, Computations and Universality 2013, MCU 2013, Zürich, Switzerland, September 9–11. EPTCS, vol. 128, pp. 47–61 (2013)
Holt, D.F., Eick, B., O’Brien, E.A.: Handbook of Computational Group Theory. CRC Press (2005)
Korec, I.: Small Universal Register Machines. Theoretical Computer Science 168, 267–301 (1996)
Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)
Pan, L., Păun, Gh.: Spiking Neural P Systems with Anti-Matter. International Journal of Computers, Communications & Control 4(3), 273–282 (2009)
Păun, Gh.: Computing with Membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000) (and Turku Center for Computer Science-TUCS Report 208, November 1998, www.tucs.fi)
Păun, Gh.: Membrane Computing: An Introduction. Springer (2002)
Păun, Gh., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press (2010)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, 3 vol. Springer (1997)
The P Systems Website: www.ppage.psystems.eu
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Alhazov, A., Aman, B., Freund, R. (2014). P Systems with Anti-Matter. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Sosík, P., Zandron, C. (eds) Membrane Computing. CMC 2014. Lecture Notes in Computer Science(), vol 8961. Springer, Cham. https://doi.org/10.1007/978-3-319-14370-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-14370-5_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14369-9
Online ISBN: 978-3-319-14370-5
eBook Packages: Computer ScienceComputer Science (R0)