Re: Revised Computing Randomness & the UD

From: Russell Standish <>
Date: Fri, 20 Apr 2001 14:15:25 +1000 (EST)

I disagree. The UD will have a particular way of generating (or
enumerating) the theorems of the FAS, such that it doesn't generate
the same theorem twice. However, that is not to say that the proofs it
generates are elegant, as other proof algorithms exist, which may
generate shorter proofs. I would think that moreover it is impossible
to ascertain in general whether a particular proof output by the UD is
elegant or not, as this appears to be equivalent to the problem of
evaluating the K-complexity of a given program, which is known to be


Hal Ruhl wrote:
> Dear Russell:
> To condense the idea the UD is generating the collection of strings by the
> only path it has so the proof is automatically elegant.
> It is also extremely complex.
> Hal

Dr. Russell Standish Director
High Performance Computing Support Unit, Phone 9385 6967
UNSW SYDNEY 2052 Fax 9385 6965
Room 2075, Red Centre
Received on Thu Apr 19 2001 - 21:22:26 PDT

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