Pseudorandom generators indistinguishable by uniform deterministic adversaries I've seen pseudorandom generators defined for nonuniform efficient adversaries, or uniform probabilistic efficient adversaries.  (For example, a monograph Pseudorandomness by Vadhan (here's its draft does that.)

I believe that it's natural to think about pseudorandom generators indistinguishable by uniform deterministic efficient adversaries.  Has that notion studied before?  Does it have any significance to some degree?

EDIT: I was mistaken in that Vadhan defined pseudorandomness against uniform probabilistic adversaries: he did define indistinguishability by uniform probabilistic algorithms, but he neither defined, nor stated facts about, the corresponding notion of pseudorandomness.  My interest mostly concerned with uniform adversaries and my original question was about deterministic vs. probabilistic.
Yes, this notion has been studied. One interesting aspect is that the two notions of pseudorandomness known to be equivalent under the usual adversaries, "next bit predictability" and "indistinguishability", do not seem to be equivalent for deterministic adversaries. (If they were, we would have complexity class separations.) Here are three references; I'm sure there are more.

O. Goldreich and A. Wigderson. On pseudorandomness with respect to deterministic observers

O. Goldreich. In a world of P=BPP

R. Williams. Towards NEXP versus BPP?