Re: OPPOSITE OF all coin sequences are computable to infinite length ?

From: The Ghost In The Machine (ewill_at_sirius.athghost7038suus.net)
Date: 01/09/05 

Date: Sun, 09 Jan 2005 03:00:10 GMT

In sci.math, |-|erc
<h@r.c>
 wrote
on Sun, 9 Jan 2005 11:00:34 +1000
<34be16F482n1bU1@individual.net>:
>
>> [crunch]
>>
>> > All coin sequences are computable to infinite length,
>> > the proposition stands.
>>
>> Chaitin's Omega.
>>
>> [crunch]
>
> <spit>
>
> define a TM
> prove it is impossible
> define a number using impossible TM

The TM for computing Chaitin's Constant is a mutation of
the TM for computing the halting problem.

[spitsnip] 

-- 
#191, ewill3@earthlink.net
It's still legal to go .sigless.