Re: OPPOSITE OF all coin sequences are computable to infinite length ?
From: Will Twentyman (wtwentyman_at_read.my.sig)
Date: 01/07/05
- Next message: robert j. kolker: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Previous message: Mark Adkins: "Cantor K.O.'d -- again!"
- In reply to: |-|erc: "OPPOSITE OF all coin sequences are computable to infinite length ?"
- Next in thread: |-|erc: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Messages sorted by: [ date ] [ thread ]
Date: Thu, 06 Jan 2005 21:29:31 -0500
|-|erc wrote:
> one day I'll get one of you to admit a random list contains all sequences.
>
>
> Is this TRUE?
> all coin sequences are computable to infinite length ?
Using the standard method of negating a statement that involves a
quantifier:
Some coin sequences are not computable to infinite length.
> What is its negative proposition?
There are, of course, other possibilities.
-- Will Twentyman email: wtwentyman at copper dot net
- Next message: robert j. kolker: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Previous message: Mark Adkins: "Cantor K.O.'d -- again!"
- In reply to: |-|erc: "OPPOSITE OF all coin sequences are computable to infinite length ?"
- Next in thread: |-|erc: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
Loading
