sentence1: a pseudorandom generator is a function that maps a short , randomly chosen seed to a long pseudorandom sequence , which is computationally indistinguishable from a truly random string for any polynomial-time bounded adversary .
sentence2: obviously , every pseudorandom generator is a weakly pseudorandom every p-dense language over σ in generator .