Papers in Relativistic Computing

• Relativistic Computation. In: M. E. Cuffaro, S. C. Fletcher eds., Physical Perspectives on Computation, Computational Perspectives on Physics. Cambridge University Press, Cambridge, 2018. pp.195-216. Andréka, H., Madarász. J., Németi, I., Németi, P. and Székely, G.
• Closed timelike curves in relativistic computation. Parallel Processing Letters 22,3 (2012), 1240010. Andréka, H., Németi, I. and Székely, G.
• General relativistic hypercomputing and foundation of mathematics.  Natural Computing 8,3 (2009) 499-516. Andréka, H., Németi, I. and Németi, P.
• New Physics and Hypercomputation. SOFSEM 06, Invited Talks, paper online, pp.1-12. Németi,I. and Andréka, H.
• Can general relativistic computers break the Turing barrier? In: Arnold Beckmann, Ulrich Berger, Benedikt Löwe, and John V Tucker (eds.): Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, July 2006, Proceedings, Lecture Notes in Computer Science 3988, Springer-Verlag Berlin Heidelberg 2006. pp.398-412. Németi, I. and Andréka, H.
• Can general relativistic computers break the Turing barrier? Computation in Europe 06, Invited talks, online presentation. Németi, I. and Andréka, H.
• New Physics and Hypercomputation. In: SOFSEM 2006: Theory and Practice of Computer Science (32nd Conf. on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 2006, Proceedings), LNCS 3831, eds: J. Wiedermann, G. Tel, J. Pokorny, M. Bielikova, J. Stuller (eds), Springer Verlag, Berlin, 2006. p.63. (Abstract in the Invited Talks section.) Németi, I. and Andréka, H.
• Can new physics challenge "old" computational barriers?  Manuscript, 2006. Németi, I. and Andréka, H.

---