Abstract
We introduce a simple model of P system motivated by certain restrictions found in biological systems. Its computational power is rather limited and corresponds to that of a finite transducer. An important characteristics of the model is its interactive behavior. Then we study the computational power of evolutionary lineages of such P systems. Referring to known results from the structural complexity theory (Karp and Lipton, Wiedermann and van Leeuwen), we show that a super-Turing computational potential can emerge in non-uniform lineages of these restricted P systems.
Furthermore, key features of our model are related to lineages of biological systems. In this way, our results provide another argument supporting the thesis from [14] and others that a super-Turing potential is naturally and inherently present in evolution of living organisms.
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
Balcazar, J.L., Diaz, J., Gabarro, J.: Structural Complexity I,, 2nd edn. Springer, Berlin (1995)
Calude, C.S., Păun, G.: Bio-steps beyond Turing. Biosystems 77, 175–194 (2004)
Copeland, B.J. (ed.): Minds and Machines 12(4) (2002); 13(1) (2003)
Eberbach, E., Wegner, P.: Beyond Turing machines. Bulletin of the EATCS 81, 279–304 (2003)
Freund, R., Oswald, M., Staiger, L.: ω-P automata with communication rules. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 203–217. Springer, Heidelberg (2004)
Karp, R.M., Lipton, R.J.: Some connections between nonuniform and uniform complexity classes. In: Proc. 12th Annual ACM Symposium on the Theory of Computing (STOC 1980), pp. 302–309 (1980)
Kelemen, J., Kelemenova, A., Păun, G., colonies, P.: Workshop on Artificial Chemistry. In: Bedan, M., et al. (eds.) ALIFE9, Boston, USA, pp. 82–86 (2004)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61, 108–143 (2000)
Păun, G.: Membrane Computing: An Introduction. Springer, Berlin (2002)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Turing, A.M.: Systems of logic based on the ordinals. Proceedings of the London Mathematical Society 45, 161–228 (1939)
van Leeuwen, J., Wiedermann, J.: Beyond the Turing limit: evolving interactive systems. In: Pacholski, L., Ružička, P. (eds.) SOFSEM 2001. LNCS, vol. 2234, pp. 90–109. Springer, Heidelberg (2001)
van Leeuwen, J., Wiedermann, J.: The Turing machine paradigm in contemporary computing. In: Enquist, B., Schmidt, W. (eds.) Mathematics Unlimited – 2001 and Beyond, pp. 1139–1155. Springer, Berlin (2001)
Wiedermann, J., van Leeuwen, J.: The emergent computational potential of evolving artificial living systems. AI Communications 15, 205–216 (2002)
Wiedermann, J.: Coupling computational and non-computational processes: minimal artificial life. In: Mauri, G., Păun, G., Zandron, C. (eds.) Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), University of Milan – Bicocca, pp. 432–445 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sosík, P., Valík, O. (2006). On Evolutionary Lineages of Membrane Systems. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2005. Lecture Notes in Computer Science, vol 3850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603047_5
Download citation
DOI: https://doi.org/10.1007/11603047_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30948-2
Online ISBN: 978-3-540-32340-2
eBook Packages: Computer ScienceComputer Science (R0)