Re: Computing Randomness

[Hal Ruhl]

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