Re: Computing Randomness

From: Hal Ruhl <hjr.domain.name.hidden>
Date: Mon, 16 Apr 2001 18:41:23 -0700

Dear Hal

Let me give my view one more try.

An N-bit FAS is N-bits because that is its compressed form. I see it as
nothing but a bag of elegant proofs. There are only 2^(N + c) that can fit
in the bag.

Hal
Received on Mon Apr 16 2001 - 15:50:07 PDT