Re: Revised Computing Randomness & the UD

From: Hal Ruhl <hjr.domain.name.hidden>
Date: Fri, 20 Apr 2001 19:43:37 -0700

Dear Russell:

As simple as I can get the idea:

The UD [a simple FAS] - uses an incredibly complex proof [known by the UD
it to be elegant and incredibly complex] - to exhibit "all theorems" [an
object of extremely low complexity].

This does not work.

Hal
Received on Fri Apr 20 2001 - 16:55:15 PDT