Re: OPPOSITE OF all coin sequences are computable to infinite length ?
From: Timothy Little (tim-via-n.i.net_at_little-possums.net)
Date: 01/07/05
- Next message: Timothy Little: "Re: Towards disproof of Omega"
- Previous message: Timothy Little: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- In reply to: Richard Tobin: "Re: 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 ?"
- Reply: |-|erc: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 7 Jan 2005 22:31:11 GMT
Richard Tobin wrote:
> Obviously A is false, since there are uncountably many different
> sequences a_n, but only countably many programs P.
Shh. I didn't want to break his brain.
- Tim
- Next message: Timothy Little: "Re: Towards disproof of Omega"
- Previous message: Timothy Little: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- In reply to: Richard Tobin: "Re: 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 ?"
- Reply: |-|erc: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|
