Re: Computing Randomness

[Hal Ruhl]

Dear Juergen:

In case what I tried to say was not clear the idea is that there are no 
more than 2^(N + c) shortest possible unique proofs in an N-bit FAS.  How 
can number theory if it is a finite FAS contain an infinite number of 
unique theorems?

Hal