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

From: Daryl McCullough (daryl_at_atc-nycorp.com)
Date: 01/07/05 

Date: 6 Jan 2005 19:05:16 -0800

robert j. kolker says...

>Daryl McCullough wrote:

>> To say that an infinite coin sequence cs is computable to infinite
>> length is to say that there is a single computable function f that
>> can compute all the places in cs. The negation is this:
>>
>> Every computable function f computes only finitely many places in cs.
>
>What about alternating heads/tails forever. That is a trivial function
>which computers all the places. Odd places have heads, even places have
>tails.

Yeah. What I meant was that for every function f, there is a maximum
natural m such that f correctly computes places 0 through m. 

--
Daryl McCullough
Ithaca, NY
Quantcast