Re: Computing Randomness

From: Hal Ruhl <hjr.domain.name.hidden>
Date: Fri, 13 Apr 2001 18:15:03 -0700

Dear Hal

Here is the second quote. It is from Chaitin's "The Limits of Mathematics"
page 90.

"The first of these theorems states that an N-bit formal axiomatic system
cannot enable one to exhibit any specific object with a program-size
complexity greater than N + c."

Hal
Received on Fri Apr 13 2001 - 15:19:27 PDT