  We study approximation and integration problems and compare the quality of
optimal information with the quality of random information. For some problems
random information is almost optimal and for some other problems random
information is much worse than optimal information. We prove new results and
give a short survey of known results.
