Re: [PO] halting problem reading comprehension

From: >parr\(*> (laurykingno_at_SPAMbtinternet.moc)
Date: 09/04/04 

Date: Sat, 4 Sep 2004 17:17:53 +0000 (UTC)

"Peter Olcott" <olcott@worldnet.att.net> wrote in message
news:nbk_c.305593$OB3.148669@bgtnsc05-news.ops.worldnet.att.net...
|
| If I write it to write only memory that should make it that another
| TM can't read it. I didn't figure in all the possible lying and
cheating.
| When people pointed out all the lying and cheating, they forgot to
| mention that this could be used as input to a Halt Analyzer, rather
| than merely a way to break my Halt Analyzer.
|
| It was like this: I can use write only memory. Well that memory
| can be replaced with read write memory. That does not refute
| the case where the memory is not replaced.
|
| This would have broken this chain:
| I won't replace the memory on your machine, I will replace the
| memory on a copy of your machine. Then I will use this copy
| of your machine to form one input that your machine can not
| process.
|
| This was the key missing piece in every refutation. They never
| bothered to say that it would be used as input to my unmodified
| Halt Analyzer. If they would have said this then the whole issue
| of not meeting the burden of proof of proving a negative would
| have never arisen.

Protected memory will do no more good than the CRT did.

Why not look up the "Program Equivalence Problem"? There you will see
that it has been proved that, no matter what you do, you cannot write a
program which can detect for absolute certain whether one program is
exactly equivalent in its outputs to another. In other words, even if
you write a halting program with all its twists and turns, it will not
be able to detect every other program which is also a halt detector.
Hence your version of the halting program will have to give up if it is
faced with a loopifhalts based on a different halt detector.

And should you believe that such a challenge is not fair, there are
numerous undecidable problems which your halt detector wouldn't be able
to resolve. 

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

Relevant Pages

  • Re: [PO] halting problem reading comprehension
    ... >mention that this could be used as input to a Halt Analyzer, ... I can use write only memory. ... >> David C. Ullrich ...
    (comp.theory)
  • Re: [PO] halting problem reading comprehension
    ... >mention that this could be used as input to a Halt Analyzer, ... I can use write only memory. ... >> David C. Ullrich ...
    (sci.logic)
  • Re: [PO] halting problem reading comprehension
    ... | than merely a way to break my Halt Analyzer. ... I can use write only memory. ... be able to detect every other program which is also a halt detector. ... Hence your version of the halting program will have to give up if it is ...
    (comp.theory)
  • Re: [PO] halting problem reading comprehension
    ... >>mention that this could be used as input to a Halt Analyzer, ... > silliness you think makes a difference. ... t' is to be used as input to my unmodified halt analyzer. ... >>can be replaced with read write memory. ...
    (comp.theory)