Abstract
In this paper, we show that special relativity phenomenon can be used to reduce computation time of any algorithm from T to \(\sqrt{T}\). For this purpose, we keep computers where they are, but the whole civilization starts moving around the computers – at an increasing speed, reaching speeds close to the speed of light. A similar square-root speedup can be achieved if we place ourselves near a growing black hole. Combining the two schemes can lead to an even faster speedup: from time T to the 4-th order root \(\root 4 \of {T}\).
This work was supported in part by the US National Science Foundation grant HRD-1242122 (Cyber-ShARE Center of Excellence).
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
Andréka, H., Madarász, J.X., Németi, I., Németi, P., Székely, G.: Relativistic computation. In: Cuffaro, M.E., Fletcher, S.C. (eds.) Physical Perspectives on Computation, Computational Perspectives on Physics, pp. 195–215. Cambridge University Press, Cambridge (2018)
Feynman, R., Leighton, R., Sands, M.: The Feynman Lectures on Physics. Addison Wesley, Boston (2005)
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th ACM Symposium on Theory of Computing, pp. 212–219 (1996)
Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325–328 (1997)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Thorne, K.S., Blandford, R.D.: Modern Classical Physics: Optics, Fluids, Plasmas, Elasticity, Relativity, and Statistical Physics. Princeton University Press, Princeton (2017)
Acknowledgments
The authors are greatly thankful to the anonymous referees for valuable suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Kosheleva, O., Kreinovich, V. (2020). Relativistic Effects Can Be Used to Achieve a Universal Square-Root (Or Even Faster) Computation Speedup. In: Blass, A., Cégielski, P., Dershowitz, N., Droste, M., Finkbeiner, B. (eds) Fields of Logic and Computation III. Lecture Notes in Computer Science(), vol 12180. Springer, Cham. https://doi.org/10.1007/978-3-030-48006-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-48006-6_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-48005-9
Online ISBN: 978-3-030-48006-6
eBook Packages: Computer ScienceComputer Science (R0)