Re: [PO] halting problem: existence proofs
From: Peter Olcott (olcott_at_worldnet.att.net)
Date: 08/30/04
- Next message: Peter Olcott: "Re: [PO] halting problem reading comprehension"
- Previous message: Peter Olcott: "Re: [PO] halting problem reading comprehension"
- In reply to: Mitch Harris: "Re: [PO] halting problem: existence proofs"
- Next in thread: The Ghost In The Machine: "Re: Can a regular Turing Machine provide Protected Memory?"
- Messages sorted by: [ date ] [ thread ]
Date: Mon, 30 Aug 2004 23:21:20 GMT
"Mitch Harris" <harrisq@tcs.inf.tu-dresden.de> wrote in message news:2pgmmmFkoa6tU1@uni-berlin.de...
> Peter Olcott wrote:
> >
> > I am limiting this to every existing proof...
>
> That is a pretty bold statement you've been making. Who
> knows what other kinds of proofs there are?
>
> Maybe you mean every proof that uses diagonalization?
>
> --
> Mitch Harris
> (remove q to reply)
>
It is still limited. It does not include every possible
proof, at least not yet.
- Next message: Peter Olcott: "Re: [PO] halting problem reading comprehension"
- Previous message: Peter Olcott: "Re: [PO] halting problem reading comprehension"
- In reply to: Mitch Harris: "Re: [PO] halting problem: existence proofs"
- Next in thread: The Ghost In The Machine: "Re: Can a regular Turing Machine provide Protected Memory?"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
