Universality in Numerical Computation with Random Data: Case Studies, Analytical Results and Some Speculations
We discuss various universality aspects of numerical computations using standard algorithms. These aspects include empirical observations and rigorous results. We also make various speculations about computation in a broader sense.
One of the authors (P.D.) would like to thank the organizers for the invitation to participate in the Abel Symposium 2016 “Computation and Combinatorics in Dynamics, Stochastics and Control”. During the symposium he gave a talk on a condensed version of the paper below.
- 5.Deift, P., Trogdon, T.: Universality for the Toda algorithm to compute the largest eigenvalue of a random matrix. Commun. Pure Appl. Math. arXiv:1604.07384Google Scholar
- 6.Deift, P., Trogdon, T.: Universality for eigenvalue algorithms on sample covariance matrices. arXiv:1701.01896Google Scholar
- 7.Markus, G.: Face it, your brain is a computer. New York Times, 27 June 2015Google Scholar
- 12.Sagun, L., Trogdon, T., LeCun, Y.: Universal halting times in optimization and machine learning. arXiv:1511.06444Google Scholar
- 14.University of Colorado at Boulder: Human brain region functions like a digital computer. Science Daily, 6 Oct 2006Google Scholar