Abstract
Modern computational mathematics requires a philosophical perspective largely at odds with that of traditional mathematics, since current computational mathematics (as distinct from computer science) is by its very nature is discrete, not continuous, and tied to the real world in ways that the more theoretical branches of mathematics (and computer science) often are not. Indeed, computational mathematics provides a means to escape the trap feared by John von Neumann when he wrote,
[T]here is a grave danger that the subject [of mathematics] will develop along the line of least resistance, that the stream so far from its source [in empirical reality] will separate into a multitude of insignificant branches, and that the discipline will become a disorganized mass of details and complexities.
But even a computational approach to mathematics has limits, not the least of which are the uncertainties of errors in hardware, software and algorithms that inevitably are part-and-parcel with computation, although there are ways to limit these uncertainties. In our chapter, bulwarked by concrete examples, we will try to situate past, present and future mathematical views of space, time, infinity and certainty within a computational context in which, for example, error due to quantum effects begins to compete with traditional sources of logical and numerical inaccuracy. We shall also argue that traditional taxonomies of complexity and completeness are not only outmoded but actually destructive of progress.
\(^{\dagger }\) Borwein sadly passed away on 2nd August 2016
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Epstein, D., & Levy, S. (1995). Experimentation and proof in mathematics. Notices of the American Mathematical Society.
Borwein, J. M., & Bailey, D. H. (2008). Mathematics by experiment: Plausible reasoning in the 21st century (2nd ed.). Natick, MA: A. K. Peters Ltd.
Bailey, D. H., Borwein, P. B., & Plouffe, S. (1997). On the rapid computation of various polylogarithmic constants. Mathematics of Computation, 66, 903–913.
Carleson, L. A. E. University of St. Andrews, Scotland. http://www-groups.dcs.st-and.ac.uk/history/Biographies/Carleson.html.
Bailey, D. H., Borwein, J. M., & Stodden, V. (2016). Facilitating reproducibility in scientific computing: Principles and practice. In H. Atmanspacher & S. Maasen (Eds.), Reproducibility: Principles, problems, practices. New York: John Wiley and Sons. To appear.
Bailey, D. H., Borwein, J. M., Calude, C. S., Dinneen, M. J., Dumitrescu, M., & Yee, A. (2012). An empirical approach to the normality of pi. Experimental Mathematics, 21, 375–384.
Yee, A. J., & Kondo, S. 12.1 trillion digits of pi, and we’re out of disk space. http://www.numberworld.org/misc_runs/pi-12t/.
Borwein, J. M., Bailey, D. H., & Girgensohn, R. (2004). Experimentation in mathematics: Computational paths to discovery. Natick, MA: A. K. Peters Ltd.
MacHale, D. (1993). Comic sections: Book of mathematical jokes. New York: Humour: Wit and Wisdom, Boole Press Ltd.
Bailey, D. H., Borwein, J. M., Kapoor, V., & Weisstein, E. (2006). Ten problems in experimental mathematics. American Mathematical Monthly, 113, 481–509.
Bailey, D. H., & Borwein, J. M. (2011). Exploratory experimentation and computation. Notices of the American Mathematical Society, 58, 1410–1419.
Baillie, R., Borwein, D., & Borwein, J. (2008). Surprising sinc sums and integrals. American Mathematical Monthly, 115, 888–901.
Bekenstein, J. D. (1981). Universal upper bound on the entropy-to-energy ratio for bounded systems. Physical Review D, 23, 287–298.
Bekenstein bound. Wikipedia. Retrieved January 08, 2016 from https://en.wikipedia.org/wiki/Bekenstein_bound.
Vilenkin, A. (2006). Many words in one: The search for other universe. New York: Hill and Wang.
Holographic principle (2016). Wikipedia, Retrieved January 08, 2016 from https://en.wikipedia.org/wiki/Holographic_principle.
Tegmark, M. (2014). Our mathematical universe: My quest for the ultimate nature of reality. New York: Knopf.
Kline, M. (1980). Mathematics: The loss of certainty. London: Oxford University Press.
Borwein, J. M., & Borwein. (1997). Pi and the AGM: A study in analytic number theory and computational complexity. New York: John Wiley., paperback 1998.
P versus NP problem. Wikipedia. Retrieved January 10, 2016 from https://en.wikipedia.org/wiki/P_versus_NP_problem.
Borwein, J. M., & Vanderwerff, J. D. (2010). Functions. Convex. Constructions. Characterizations and Counterexamples. London: Cambridge University Press.
Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K. E., Santos, E., et al. (1993). LogP: Towards a realistic model of parallel computation. In proceedigns of the fourth ACM SIGPLAN symposium on principles and practice of parallel programming. CA: San Diego.
Williams, S. W. (2011). The roofline model. In D. H. Bailey, R. F. Lucas, & S. W. Williams (Eds.), Performance tuning of scientific applications. CRC Press.
Bailey, D. H., Wang, L.-W., Shan, H., Zhao, Z., Meza, J., Strohmaier, E., & Lee, B. (2011). Tuning an electronic structure code. In D. H. Bailey., R. F. Lucas., R. F., Williams, S. W. (Eds.) Performance tuning of scientific applications. CRC Press.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Bailey, D.H., Borwein, J.M. (2017). A Computational Mathematics View of Space, Time and Complexity. In: Wuppuluri, S., Ghirardi, G. (eds) Space, Time and the Limits of Human Understanding. The Frontiers Collection. Springer, Cham. https://doi.org/10.1007/978-3-319-44418-5_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-44418-5_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44417-8
Online ISBN: 978-3-319-44418-5
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)