Re: Attempt to Refute the Halting Problem's Refutation

From: >parr\(*> (gniKyruaL_at_tenretnitb.moc)
Date: 08/15/04 

Date: Sun, 15 Aug 2004 04:06:59 +0000 (UTC)

"peter_douglass" <baisly@gis.net> wrote in message
news:LazTc.11925$TI1.5985@attbi_s52...
|
| "Daryl McCullough" <daryl@atc-nycorp.com> wrote in message
| news:cflkcn02c8q@drn.newsguy.com...
|
| > Turing's proof, which was that
| > there is no program H(x,y) that returns 1 if and only if x
| > is a code for a program that halts on input y.
|
| and 0 otherwise!

This is a 121 between newstone & Peter. Ideally, it would be done by
email, but Peter's trolling for attention, and refuses to go
off-group.

The idea is to see if newstone can manage to keep his cool, and maybe
even get Peter to see that he's wrong.

Let them get on with it - there are other threads on the go for your
to join in on. 

--
)>==ss$$%PARR(º>   Parr

Relevant Pages

  • Re: Attempt to Refute the Halting Problems Refutation
    ... | "Daryl McCullough" wrote in message ... This is a 121 between newstone & Peter. ... )>==ss$$%PARR(º> Parr ...
    (comp.theory)
  • Re: Continuum hypothesis
    ... Daryl McCullough wrote: ... Peter said, then ask followup questions. ... Peter to give me a course in mathematical logic. ... "sufficiently strong" to use the more usual phrase) can be cashed out ...
    (sci.logic)
  • Re: Halting Problem for Humans
    ... The halting problem is a well defined question while ... your questions to Peter and Daryl are not. ... Daryl McCullough wrote: ... translates to DIFFERENT input-strings for the two machines, ...
    (sci.logic)
  • Re: Continuum hypothesis
    ... Daryl McCullough wrote: ... >> There are a few reasons, but at minimum one could readily suspect something ... Now perhaps Peter or Chris or you could go back over exchanged posts ... that the informality of "as strong as arithmetic" can be disproved by the ...
    (sci.logic)
Quantcast