Abstract
Looking for ideas which would lead to computing devices able to compute “beyond the Turing barrier” is already a well established research area of computing theory; such devices are said to be able of doing hypercomputations. It is also a dream and a concern of computability to speed-up computing devices; we propose here a name for the case when this leads to polynomial solutions to problems known to be (at least) NP-complete: fypercomputing – with the initial F coming from “fast”.
In short: fypercomputing means going polynomially beyond NP.
The aim of these notes is to briefly discuss the existing ideas in membrane computing which lead to fypercomputations and to imagine new ones, some of them at the level of speculations, subject for further investigation.
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
Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 226, 1021–1024 (1994)
Arulanandham, J.J.: Implementing Bead-Sort with P Systems. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol. 2509, pp. 115–125. Springer, Heidelberg (2002)
Arulanandham, J.J., Calude, C.S., Dinneen, M.J.: Balance Machines: Computing = Balancing. In: Jonoska, N., Păun, G., Rozenberg, G. (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 36–48. Springer, Heidelberg (2003)
Calude, C.S., Păun, G.: Bio-steps beyond Turing. BioSystems 77, 175–194 (2004)
Castellanos, J., Păun, G., Rodriguez-Patón, A.: Computing with membranes: P systems with worm-objects. In: Proc. IEEE 7th. Intern. Conf. on String Processing and Information Retrieval, SPIRE 2000, La Coruna, Spain, pp. 64–74 (2000)
Copeland, J.: Hypercomputation. Minds and Machines 12, 461–502 (2002)
Dassow, J., Păun, G.: On the power of membrane computing. J. of Universal Computer Science 5, 33–49 (1999)
Davis, M.: Why there is no such discipline as hypercomputation. Applied Mathematics and Computation (Special Issue on Hypercomputation) 178, 4–7 (2006)
Eberbach, E., Wegner, P.: Beyond Turing machines. Bulletin of the EATCS 81, 279–304 (2003)
Ehrenfeucht, A., Rozenberg, G.: Basic Notions of Reaction Systems. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 27–29. Springer, Heidelberg (2004)
Ehrenfeucht, A., Rozenberg, G.: Reaction systems. Fundamenta Informaticae 75, 263–280 (2007)
Ehrenfeucht, A., Rozenberg, G.: Introducing time in reaction systems. Theoretical Computer Sci. 410, 310–322 (2009)
Ionescu, M., Păun, G., Yokomori, T.: Spiking neural P systems. Fundamenta Informaticae 71, 279–308 (2006)
Ishdorj, T.-O., Leporati, A.: Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources. Natural Computing 7, 519–534 (2008)
Leporati, A., Gutiérrez-Naranjo, M.A.: Solving SUBSET-SUM by spiking neural P systems with pre-computed resources. Fundamenta Informaticae 87, 61–77 (2008)
Martin-Vide, C., Păun, G., Rodriguez-Patón, A.: On P systems with membrane creation. Computer Science J. of Moldova 9, 134–145 (2001)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61, 108–143 (2000) (first circulated as Turku Center for Computer Science-TUCS Report 208 (November 1998), www.tucs.fi
Păun, G.: P systems with active membranes: Attacking NP-complete problems. J. Automata, Languages, and Combinatorics 6, 75–90 (2001)
Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)
Păun, G., Pérez-Jiménez, M.J.: Towards bridging two cell-inspired models: P systems and R systems. Theoretical Computer Sci. (to appear)
Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press (2010)
Pérez-Jímenez, M.J.: An Approach to Computational Complexity in Membrane Computing. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 85–109. Springer, Heidelberg (2005)
Pérez-Jiménez, M.J., Riscos-Núñez, A., Romero-Jiménez, A., Woods, D.: Complexity – Membrane Division, Membrane Creation. In: [21], ch. 12, pp. 302–336
Putz, V., Svozil, K.: Can a computer be “pushed” to perform faster-than-light? In: Proc. UC 2010 Hypercomputation Workshop “HyperNet 2010”, Univ. of Tokyo, June 22 (2010)
Siegelmann, H.: Computation beyond the Turing limit. Science 238, 632–637 (1995)
Sosík, P., Valík, O.: On Evolutionary Lineages of Membrane Systems. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 67–78. Springer, Heidelberg (2006)
Syropoulos, A.: Hypercomputation: Computing Beyond the Church-Turing Barrier. Springer, Berlin (2008)
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)
Zandron, C.: A Model for Molecular Computing: Membrane Systems. PhD thesis, Milano Univ., Italy (2002)
The P Systems Website, http://ppage.psystems.eu
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Păun, G. (2012). Towards “Fypercomputations” (in Membrane Computing). In: Bordihn, H., Kutrib, M., Truthe, B. (eds) Languages Alive. Lecture Notes in Computer Science, vol 7300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31644-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-31644-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31643-2
Online ISBN: 978-3-642-31644-9
eBook Packages: Computer ScienceComputer Science (R0)