Re: OPPOSITE OF all coin sequences are computable to infinite length ?
From: robert j. kolker (nowhere_at_nowhere.net)
Date: 01/07/05
- Next message: |-|erc: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Previous message: Will Twentyman: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- In reply to: Daryl McCullough: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Next in thread: Daryl McCullough: "Re: OPPOSITE OF all coin sequences are computable to infinite length"
- Reply: Daryl McCullough: "Re: OPPOSITE OF all coin sequences are computable to infinite length"
- Messages sorted by: [ date ] [ thread ]
Date: Thu, 06 Jan 2005 21:32:56 -0500
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.
Bob Kolker
- Next message: |-|erc: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Previous message: Will Twentyman: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- In reply to: Daryl McCullough: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Next in thread: Daryl McCullough: "Re: OPPOSITE OF all coin sequences are computable to infinite length"
- Reply: Daryl McCullough: "Re: OPPOSITE OF all coin sequences are computable to infinite length"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
