Lets assume we have a DRGB (deterministic random bit generator) which is seeded by a good true RBG (random bit generator). Before any bit has been read from the DRBG, the entropy is clearly the number of bits of the seed.
But is entropy lost, when I read out the bits of the DRBG? From an information theoretical point , one could say that entropy will diminish by 1 with every bit I read from the DRBG. But how could this be defined from a complexity theoretic point? Does there exist a precise mathematical definition of a "complexity theoretic entropy measure" ?
Maybe that question sounds a bit philosophical, but it also has practical impact, because one can decide when its time to reseed.