Recent work in Relativistic Computing

• Relativistic computers and the Turing barrier. Applied Mathematics and Computation 178 (2006), 118-142. Németi, I. and Dávid, Gy.
• Non-Turing computations via Malament-Hogarth space-times. International Journal of Theoretical Physics 41,2 (2002), 341-370. Etesi, G. and Németi, I.
• 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.