@ comingstorm: Quasi Monte Carlo often outperforms Monte Carlo integration for problems of small dimensionality involving “smooth” integrands. This is, however, not yet rigorously understood. (The proven bounds on performance for medium dimensionality seem to be extremely loose.)
Besides, MC doesn’t require randomness in the “Kolmogorov complexity == length” sense, but in the “passes statistical randomness tests” sense. Eliezer has, as far as I can see, not talked about the various definitions of randomness.
@ comingstorm: Quasi Monte Carlo often outperforms Monte Carlo integration for problems of small dimensionality involving “smooth” integrands. This is, however, not yet rigorously understood. (The proven bounds on performance for medium dimensionality seem to be extremely loose.)
Besides, MC doesn’t require randomness in the “Kolmogorov complexity == length” sense, but in the “passes statistical randomness tests” sense. Eliezer has, as far as I can see, not talked about the various definitions of randomness.