Re: Computing Randomness

From: Hal Ruhl <>
Date: Thu, 12 Apr 2001 08:06:43 -0700

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?

Received on Thu Apr 12 2001 - 05:08:53 PDT

This archive was generated by hypermail 2.3.0 : Fri Feb 16 2018 - 13:20:07 PST