Re: The Halting Problem
From: Rick Decker (rdecker_at_hamilton.edu)
Date: 11/03/04
- Next message: Anonymous: "Re: P vs NP craziness & Diaby was already refuted... in 1988"
- Previous message: Torben Ęgidius Mogensen: "Re: single-combinator basis with direct algebraic characterisation?"
- In reply to: Kent Paul Dolan: "Re: The Halting Problem"
- Next in thread: Kent Paul Dolan: "Re: The Halting Problem"
- Reply: Kent Paul Dolan: "Re: The Halting Problem"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Wed, 03 Nov 2004 07:47:12 -0500
Kent Paul Dolan wrote:
> mfag@online.no (Martin Johansen) wrote:
>
>
>>I have some points on the Halting Problem:
>
>
> Dear Klortho, _NO_!
>
> We just suffered though _months_, and thousands
> of postings, trying to counter the indelible
> ignorance of one Peter Olcott on the question
> of "The Halting Problem".
>
<snip>
>
> Newsgroup comp.theory deserves at _least_ an entire
> decade free of the muddlings of those convinced that
> Turing's proof that the Halting Problem _cannot_ be
> solved in general by a single piece of software is
> somehow flawed, despite its review by every single
> computer science graduate (of a competent
> university's curriculum) in history since Turing.
>
Wonderful idea. That way we could concentrate on
the perennial threads devoted to misguided "proofs"
that P = NP.
Regards,
Rick
(followups trimmed)
- Next message: Anonymous: "Re: P vs NP craziness & Diaby was already refuted... in 1988"
- Previous message: Torben Ęgidius Mogensen: "Re: single-combinator basis with direct algebraic characterisation?"
- In reply to: Kent Paul Dolan: "Re: The Halting Problem"
- Next in thread: Kent Paul Dolan: "Re: The Halting Problem"
- Reply: Kent Paul Dolan: "Re: The Halting Problem"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|
