Skip to main content

Additional Spatial Dimensions Can Help Speed Up Computations

  • Chapter
  • First Online:
Decision Making Under Uncertainty and Constraints

Part of the book series: Studies in Systems, Decision and Control ((SSDC,volume 217))

  • 449 Accesses

Abstract

While we currently only observe 3 spatial dimensions, according to modern physics, our space is actually at least 10-dimensional. In this paper, on different versions of the multi-D spatial models, we analyze how the existence of the additional spatial dimensions can help computations. It turns out that in all the versions, there is some speed up—moderate when the extra dimensions are actually compactified, and drastic if extra dimensions are separated by a potential barrier.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Feynman, R., Leighton, R., Sands, M.: The Feynman Lectures on Physics. Addison Wesley, Boston, Massachusetts (2005)

    MATH  Google Scholar 

  2. Green, M.B., Schwarz, J.H., Witten E.: Superstring Theory, Vols. 1, 2, Cambridge University Press (1988)

    Google Scholar 

  3. Kosheleva, O., Kreinovich, V.: Relativistic effects can be used to achieve a universal square-root (or even faster) computation speedup. In: Blass, A., Cegielsky, P., Dershowitz, N., Droste, M., Finkbeiner, B. (eds.) Fields of Logic and Computation III, pp. 179–189. Springer (2020)

    Google Scholar 

  4. Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer, Dordrecht (1998)

    Google Scholar 

  5. Morgenstein, D., Kreinovich, V.: Which algorithms are feasible and which are not depends on the geometry of space-time. Geombinatorics 4(3), 80–97 (1995)

    Google Scholar 

  6. Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading, Massachusetts (1994)

    Google Scholar 

  7. Polchinski, J.: String Theory, Vols. 1, 2, Cambridge University Press (1998)

    Google Scholar 

  8. Thorne, K.S., Blandford, R.D.: Modern Classical Physics: Optics, Fluids, Plasmas, Elasticity, Relativity, and Statistical Physics. Princeton University Press, Princeton, New Jersey (2017)

    Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Science Foundation grants 1623190 (A Model of Change for Preparing a New Generation for Professional Practice in Computer Science), and HRD-1834620 and HRD-2034030 (CAHSI Includes).

It was also supported by the program of the development of the Scientific-Educational Mathematical Center of Volga Federal District No. 075-02-2020-1478.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vladik Kreinovich .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Longpré, L., Kosheleva, O., Kreinovich, V. (2023). Additional Spatial Dimensions Can Help Speed Up Computations. In: Ceberio, M., Kreinovich, V. (eds) Decision Making Under Uncertainty and Constraints. Studies in Systems, Decision and Control, vol 217. Springer, Cham. https://doi.org/10.1007/978-3-031-16415-6_41

Download citation

Publish with us

Policies and ethics