Re: OPPOSITE OF all coin sequences are computable to infinite length ?
From: |-|erc (h_at_r.c)
Date: 01/08/05
- Next message: Lefty: "Re: Division by Zero in Nature, and Decomposition of Time."
- Previous message: Stephen Montgomery-Smith: "Re: ordinal logics and Diophantine equations"
- In reply to: Timothy Little: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Next in thread: Timothy Little: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Messages sorted by: [ date ] [ thread ]
Date: Sat, 8 Jan 2005 11:54:18 +1000
"Timothy Little" <tim-via-n.i.net@little-possums.net> wrote in
> 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.
>
>
by citing the subject line as an axiom?
Herc
- Next message: Lefty: "Re: Division by Zero in Nature, and Decomposition of Time."
- Previous message: Stephen Montgomery-Smith: "Re: ordinal logics and Diophantine equations"
- In reply to: Timothy Little: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Next in thread: Timothy Little: "Re: OPPOSITE OF all coin sequences are computable to infinite length ?"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
