Abstract
- Can general relativistic computers break the Turing barrier? – Are there final limits to human knowledge? – Limitative results versus human creativity (paradigm shifts). – Gödel’s logical results in comparison/combination with Gödel’s relativistic results. – Can Hilbert’s programme be carried through after all?
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Andréka, H., Madarász, J.X., Németi, I.: Logic of Spacetime. In: Aiello, M., van Benthem, J., Hartman-Pratt, I. (eds.) Logic of Space. Kluwer Academic Publishers, Dordrecht (in preparation)
Andréka, H., Madarász, J.X., Németi, I.: Logical axiomatizations of spacetime. In: Prékopa, A., Molnár, E. (eds.) Non-Euclidean Geometries, János Bolyai Memorial. Mathematics and its Applications, vol. 581, pp. 155–185. Springer, Heidelberg (2006)
Andréka, H., Madarász, J.X., Németi, I., Andai, A., Sain, I., Sági, G., Tőke, C., Vályi, S.: On the logical structure of relativity theories. Internet book, Budapest (2000), http://www.math-inst.hu/pub/algebraic-logic/olsort.html
Andréka, H., Németi, I., Wüthrich.: A twist in the geometry of rotating black holes: seeking the cause of acausality, 15 pages (manuscript, 2005)
Cooper, S.B.: How Can Nature Help Us Compute? In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 1–13. Springer, Heidelberg (2006)
Earman, J.: Bangs, crunches, whimpers, and shrieks. Singularities and acausalities in relativistic spacetimes. Oxford university Press, Oxford (1995)
Etesi, G., Németi, I.: Turing computability and Malament-Hogarth spacetimes. International Journal of Theoretical Physics 41(2), 342–370 (2002)
Gödel, K.: Lecture on rotating universes. In: Feferman, S., Dawson, J.S., Goldfarb, W., Parson, C., Solovay, R.N. (eds.) Kurt Gödel Collected Works, vol. III, pp. 261–289. Oxford University Press, Oxford (1995)
Hogarth, M.L.: Predictability, computability, and spacetime. Ph.D Dissertation, University of Cambridge, UK (2000), http://ftp.math-inst.hu/pub/algebraic-logic/Hogarththesis.ps.gz
Hogarth, M.L.: Deciding arithmetic using SAD computers. Brit. J. Phil. Sci. 55, 681–691 (2004)
Madarász, J.X., Németi, I., Székely, G.: Twin Paradox and the logical foundation of space-time. Foundation of Physics (to appear) arXiv:gr-qc/0504118
Madarász, J.X., Németi, I., Székely, G.: First-order logic foundation of relativity theories. In: Mathematical problems from applied logic II. International Mathematical Series. Springer, Heidelberg (to appear)
Madarász, J.X., Székely, G.: The effects of gravitation on clocks, proved in axiomatic relativity. In: Abstracts for the conference Logic in Hungary (2005), http://atlas-conferences.com/cgi.bin/abstract.caqb-41
Németi, I.: On logic, relativity, and the limitations of human knowledge. Iowa State University, Department of Mathematics, Ph. D. course during the academic year (1987/1988)
Németi, I., Dávid, G.: Relativistic computers and the Turing barrier. Journal of Applied Mathematics and Computation (to appear)
Ori, A.: On the traversability of the Cauchy horizon: Herman and Hiscock’s argument revisited. In: Ori, A., Ori, L.M. (eds.) Internal Structures of Black Holes and Spacetime Singularitites. Ann. Isra. Phys. Soc, vol. 13, IOP (1997)
Reynolds, C.C., Brenneman, L.W., Garofalo, D.: Black hole spin in AGN and GBHCs. October 5 (2004) arXiv:astro-ph/0410116 (Evidence for rotating black holes)
Strohmayer, T.E.: Discovery of a 450 HZ quasi-periodic oscillation from the microquasar GRO J1655-40 wtih the Rossi X-Ray timing explorer. The Astrophysical Journal 553(1), L49–L53 (2001) (Evidence for rotating black holes.) arXiv:astro-ph/0104487
Taylor, E.F., Wheeler, J.A.: Black Holes. Addison, Wesley, Longman, San Francisco (2000)
Tegmark, M.: Parallel Universes. Scientific American, 41–51 (May 2003)
Wiedermann, J., van Leeuwen, J.: Relativistic computers and non-uniform complexity theory. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol. 2509, pp. 287–299. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Németi, I., Andréka, H. (2006). Can General Relativistic Computers Break the Turing Barrier?. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780342_42
Download citation
DOI: https://doi.org/10.1007/11780342_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35466-6
Online ISBN: 978-3-540-35468-0
eBook Packages: Computer ScienceComputer Science (R0)