Re: POLL: Some finite coin sequences are not computable

From: Will Twentyman (wtwentyman_at_read.my.sig)
Date: 01/07/05 

Date: Thu, 06 Jan 2005 21:27:01 -0500

|-|erc wrote:

> "Will Twentyman" <wtwentyman@read.my.sig> wrote in
>
>>|-|erc wrote:
>>
>>>"Will Twentyman" <wtwentyman@read.my.sig> wrote in
>>>
>>>
>>>>|-|erc wrote:
>>>>
>>>>
>>>>
>>>>>1 Some finite coin sequences are not computable
>>>>
>>>>false.
>>>>
>>>>
>>>>
>>>>>2 All coin sequences are computable to infinite length.
>>>>
>>>>false.
>>>>
>>>
>>>
>>>
>>>To contradict "all coin sequences are computable to infinite length"
>>
>>3' : Some coin sequences are not computable to infinite length
>>
>>>3 Some coin sequences are only computable to finite length.
>>>Contradiction. [~1] <-/-> [3]
>>
>>Where do you see a contradiction?
>
>
> 3

Care to elaborate a little? I don't see a contradiction. 

-- 
Will Twentyman
email: wtwentyman at copper dot net

Relevant Pages