Re: Computing Randomness

From: <juergen.domain.name.hidden>
Date: Thu, 12 Apr 2001 14:54:59 +0200

> From: Hal Ruhl Thu Apr 12 14:07:54 2001
>
> 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, here is an infinite chain of provable unique theorems:
1+1=2, 2+1=3, 3+1=4, 4+1=5, ...

Juergen
Received on Thu Apr 12 2001 - 05:57:58 PDT