We show how to simulate any BPP algorithm in polynomial time using a weak random source of min-entropy $r^{\gamma}$ for any $\gamma >0$. This follows from a more general result about {\em sampling\/} with weak random sources. Our result matches an information-theoretic lower bound and solves a question that has ... more >>>