probability theory – Pseudorandomness and next-bit unpredictability for uniform algorithms

Yao’s theorem says that for a distribution, next bit unpredictability is equivalent to pseudo-randomness. This link proves Yao’s theorem, but the proof relies on non-uniform probabilistic polynomial time algorithms. Is there a proof of Yao’s theorem that instead relies on uniform probabilistic polynomial time algorithms?