%0 Generic
%D 2012
%T Towards Fypercomputations (in Membrane Computing)
%A Gheorghe Paun
%C Amsterdam, The Netherlands
%I Springer
%K Complexity; Hypercomputing; Membrane computing; Turing computing
%P 207-220
%R 10.1007/978-3-642-31644-9-14
%U http://www.scopus.com/record/display.url?eid=2-s2.0-84866988988&origin=resultslist&sort=plf-f&src=s&st1=George+Paun&sid=Gm8vRBqePqkt9Oqhy9PyzBi%3a440&sot=b&sdt=b&sl=43&s=AUTHOR-NAME%28George+Paun%29+AND+PUBYEAR+%3E+2008&relpos=0&relpos=0&searchTerm=AUTHOR
%V 7300
%X 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.