Universality in numerical computation with random data. Case studies, analytic results and some speculations
arXiv:1703.080925 citationsh-index: 58
AI Analysis
Provides insights into the behavior of standard algorithms on random data, relevant for understanding computational universality.
The paper explores universality in numerical computations with random data, presenting empirical observations and rigorous results, and speculates on broader computational implications.
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.