13th International Conference on Membrane Computing - MTA Sztaki

Membrane systems and hypercomputation
can also be ‘chained together’ to solve more complex problems. In joint work with
Marian Gheorghe, we have considered this problem in detail: we have shown how
a natural extension of the accelerated P system concept easily allows us to traverse
all levels of the arithmetic hierarchy, and that the higher systems have
even greater power – they can solve a problem that is too hard to belong to any
class in the hierarchy [GS12].
References
[CP04] C. S. Calude and Gh. Păun. Bio-steps beyond Turing. BioSystems, 77:175–
194, 2004.
[EN02] G. Etesi and I. Németi. Non-Turing computations via Malament-Hogarth
space-times. <strong>International</strong> Journal of Theoretical Physics, 41:341–370, 2002.
arXiv:gr-qc/0104023v2.
[G + 09] S. Gillessen et al. Monitoring stellar orbits around the Massive Black Hole in
the Galactic Center. The Astrophysical Journal, 692:1075–1109, 23 February
2009.
[GS12] M. Gheorghe and M. Stannett. Membrane system models for super-Turing
paradigms. Natural Computing, 11:253–259, 2012.
[Hog04] M. Hogarth. Deciding Arithmetic using SAD Computers. The British Journal
for the Philosophy of Science, 55:681–691, 2004.
[NC00] M. Nielsen and I. Chuang. Quantum Computation and Quantum Information.
Cambridge University Press, Cambridge, 2000.
[Pău11] Gh. Păun. Membrane Computing at Twelve Years (Back to Turku). In Proc.
UC 2011, volume 6714 of LNCS, pages 36–37. Springer, 2011.
[Pău12] Gh. Păun. Fypercomputations. In Marian Gheorghe, Gheorghe Păun, and
Mario J. Pérez-Jiménez, editors, Frontiers of Membrane Computing: Open
Problems and Research Topics, pages 207–209, to appear, 2012. http://www.
gcn.us.es/10BWMC/10BWMCvolI/papers/megaPfinal.pdf.
[Sho97] P. W. Shor. Polynomial-Time Algorithms for Prime Factorization and Discrete
Logarithms on a Quantum Computer. SIAM J. Comput., 26(5):1484–
1509, 1997.
[Tho54] J. F. Thomson. Tasks and Super-Tasks. Analysis, 15(1):1–13, October 1954.
65