Abstract
Does new physics give us a chance for designing computers, at least in principle, which could compute beyond the Turing barrier? By the latter we mean computers which could compute some functions which are not Turing computable. Part of what we call “new physics” is the surge of results in black hole physics in the last 15 years, which certainly changed our perspective on certain things [3], [9], [1]. The two main directions in this line seem to be quantum computers and relativistic, i.e. spacetime-theory-based, ones. We will concentrate on the relativistic case, e.g. [1], [2], [4], [6]. Is there a remote possibility that relativity can give some feedback to its “founding grandmother”, namely, to logic?
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Németi, I., Dávid, G.: Relativistic Computers and the Turing Barrier. Journal of Applied Mathematics and Computation (to appear), http://ftp.math-inst.hu/pub/algebraic-logic/beyondturing.pdf
Etesi, G., Németi, I.: Non-Turing Computations via Malament-Hogarth Space-Times. International Journal of Theoretical Physics 41(2), 341–370 (2002), http://arxiv.org/abs/gr-qc/0104023
Reynolds, C.S., Brenneman, L.W., Garofalo, D.: Black Hole Spin in AGN and GBHCs. ArXiv: astro-ph/0410116v1 (October 5, 2004), http://arxiv.org/abs/astro-ph/0410116 (This reference is about observational evidence for spinning black holes)
Hogarth, M.L.: Predictability, Computability, and Spacetime. PhD 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)
Earman, J., Norton, J.: Forever Is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes. Philosophy of Science 60, 22–42 (1993)
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)
Cooper, S.B.: Computability and Emergence. In: Gabbay, D.M., et al. (eds.) Mathematical Problems from Applied Logics. New Logics for the XXIst Century II. International Mathematical Series. Kluwer/Springer (2005)
Wüthrich, C.: On Time Machines in Kerr-Newman Spacetime. Master Theses, University of Berne (1999), http://www.itp.unibe.ch/diploma_thesis/wuthrich/wuthrichLiz.pdf
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., Andreka, H. (2006). New Physics and Hypercomputation. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds) SOFSEM 2006: Theory and Practice of Computer Science. SOFSEM 2006. Lecture Notes in Computer Science, vol 3831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11611257_6
Download citation
DOI: https://doi.org/10.1007/11611257_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31198-0
Online ISBN: 978-3-540-32217-7
eBook Packages: Computer ScienceComputer Science (R0)