Any (Turing-complete) instruction set can be translated/compiled/interpreted-by any other (Turing-complete) instruction set, given a suitable translator/compiler/interpreter. Since we're running all programs, we will eventually run all translators/compilers/interpreters, so no matter what instruction set we choose, we will start running programs from every other. The longer we leave it running, the more of a mixture we end up with. Since Chaitin's Constant is the (uncomputable) result of letting such a scheme run forever, it contains a perfect mixture of all instruction sets, and is thus independent of whichever one we choose.
Chaitin has also uploaded the full text (pdf) of the book to Arxiv.org [2].
[1] http://www.amazon.co.uk/Meta-Maths-Gregory-J-Chaitin/dp/1843...
For me, I immediately think of:
What instruction set are we considering? Is the instruction set bounded by human language?
Human language does not have the same extent as thought -- or does it? Is the indescribable as cardinal as the unthinkable?
What is the Chatlin's constant for average human thought process.. ie. a subset of our brain programming?
Man, what an interesting subject.