On Mon, 28 Aug 2006, Travis H. wrote:
On 8/23/06, Alexander Klimov [EMAIL PROTECTED] wrote:
A random bit stream should have two properties: no bias and no
dependency between bits. If one has biased but independent bits he
can use the von Neumann algorithm to remove the bias, but if there is
On 8/29/06, Alexander Klimov [EMAIL PROTECTED] wrote:
Well, it not really a claim since there was no definition, here it is:
A ``dependency stripping'' algorithm is a deterministic algorithm that
gets a stream of unbiased (but not necessary independent bits) and
produces a stream of several
On Aug 9, 2006, at 8:44 PM, Travis H. wrote:
Hey,
I was mulling over some old emails about randomly-generated numbers
and realized that if I had an imperfectly random source (something
less than 100% unpredictable), that compressing the output would
compress it to the point where it was
I was mulling over some old emails about randomly-generated
numbers and realized that if I had an imperfectly random
source (something less than 100% unpredictable), that
compressing the output would compress it to the point where
it was nearly so. Would there be any reason to choose one
On Wed, 9 Aug 2006, Travis H. wrote:
Hey,
I was mulling over some old emails about randomly-generated numbers
and realized that if I had an imperfectly random source (something
less than 100% unpredictable), that compressing the output would
compress it to the point where it was nearly so.
