Re: Foundation for a Formal Refutation of the Original Halting Problem?

From: Kenneth Doyle (nobody_at_notmail.com)
Date: 08/05/04

Next message: Gordon Burditt: "Re: Reincarnation and change of laws"
Previous message: Archimedes Plutonium: "quantization of digits, letters and numbers"
In reply to: Peter Olcott: "Re: Foundation for a Formal Refutation of the Original Halting Problem?"
Next in thread: George Greene: "Re: Foundation for a Formal Refutation of the Original Halting Problem?"
Messages sorted by: [ date ] [ thread ]

Date: Thu, 05 Aug 2004 20:42:13 GMT

"Peter Olcott" <olcott@worldnet.att.net> wrote in
news:CwpQc.390740$Gx4.307021@bgtnsc04-news.ops.worldnet.att.net:

>
> Then the program being analyzed does modify its behavior based
> on the returned value from WillHalt() as contrasted with not
> receiving a value.

But you're insisting that it's not the program being analysed that's
modified, but WillHalt itself. Go and read EXACTLY and PRECISELY what you
wrote.

-- 
CodeCutter - good, fast and cheap; pick two.

Next message: Gordon Burditt: "Re: Reincarnation and change of laws"
Previous message: Archimedes Plutonium: "quantization of digits, letters and numbers"
In reply to: Peter Olcott: "Re: Foundation for a Formal Refutation of the Original Halting Problem?"
Next in thread: George Greene: "Re: Foundation for a Formal Refutation of the Original Halting Problem?"
Messages sorted by: [ date ] [ thread ]

Relevant Pages

Re: Can you find anything wrong with this solution to the Halting Problem?
... "Peter Olcott" wrote in ... > The only access that the LoopIfHalts() function has to ... > the WillHalt() function is through a function call. ... fast and cheap; ...
(sci.logic)
Re: Solution to the halting Problem?
... how can it be impossible to modify it so that it ... What are you referring to as "a single valid counter-example"? ... Or a single version of WillHalt that will not work with the original ... => The LoopIfHalts function can be constructed based on the ...
(comp.lang.cpp)
Re: Can you find anything wrong with this solution to the Halting Problem?
... > See if you can find any reason why this would not work. ... let me summarize your argument. ... Turing's proof relies on using the output of WillHalt in another program, ... it must be the case that it's impossible to modify P1 as I've described. ...
(comp.theory)
Re: Can you find anything wrong with this solution to the Halting Problem?
... > See if you can find any reason why this would not work. ... let me summarize your argument. ... Turing's proof relies on using the output of WillHalt in another program, ... it must be the case that it's impossible to modify P1 as I've described. ...
(sci.math)
Re: Foundation for a Formal Refutation of the Original Halting Problem?
... "Peter Olcott" wrote in ... > Then the program being analyzed does modify its behavior based ... modified, but WillHalt itself. ... fast and cheap; ...
(comp.theory)