Re: Disproof of the Halting Problem's Conclusion

From: >parr\(*> (KurlyGina_at_tenretnitb.moc)
Date: 07/17/04 

Date: Sat, 17 Jul 2004 05:46:12 +0000 (UTC)

"Peter Olcott" <olcott@worldnet.att.net> wrote in message
news:H1ZJc.102348$OB3.64898@bgtnsc05-news.ops.worldnet.att.net...
|
| > However, that does not prove it is possible to create
| > WillHaltPO(M,w). In the absence of code for such a program, we
| > simply don't know one way or the other.
| >
| > Restating those two positions:
| > To show that the Halting Problem Conclusion has not
| > been refuted, it is still necessary to show that
| > WillHaltPO(M,w) cannot exist.
| >
| > In order to refute the Halting Problem conclusion
| > fully, it is still necessary to prove the existence
| > of WillHaltPO(M,w).
| >
| > Do you agree so far?
|
| I would say that proving that their proof does not prove
| what the conclusion concludes would be a complete refutation.
|
|
| X ="A Solution to the Halting Problem can not possibly exist."
|
| You say that you proved X.
| I prove that you did not prove X.

OK

You believe you have proved the existence of WillHaltPO(M,w). And
that it's just ordinary software. It has the following properties:

    1. It can't work if its code were known.
    2. It can't work if its output could be
        accessed by another program.
    3. It can't work unless it is armed with a
        random number generator which allows it to
        speak in code to its user.

OK

Let's get another point clarified before we continue.

Your program needs a random number generator to make it work
successfully.

Is your rng software based? Remember that software based rngs are
deterministic and can be predicted. 

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

Relevant Pages

  • Re: Disproof of the Halting Problems Conclusion
    ... |> To show that the Halting Problem Conclusion has not ... |> In order to refute the Halting Problem conclusion ... You believe you have proved the existence of WillHaltPO. ... Is your rng software based? ...
    (sci.logic)
  • Re: Solution to the halting Problem?
    ... >> The authors misinterpretation of the halting problem seems to ... LoopIfHaltsto function does not refute this method. ... One single case where the security is not ... that causes the WillHaltmethod to fail, and then says that this is not ...
    (comp.lang.cpp)
  • Re: Yet another Attempt at Disproving the Halting Problem
    ... > result to the function being analyzed, and you leap to the stupid ... > you expect to refute me if you don't even know what i am saying ??? ... No one has to read your silly bumbling at the URL noted to refute you. ... You have claimed both that the proof of the halting problem is flawed ...
    (comp.theory)
  • Re: Yet another Attempt at Disproving the Halting Problem
    ... > result to the function being analyzed, and you leap to the stupid ... > you expect to refute me if you don't even know what i am saying ??? ... No one has to read your silly bumbling at the URL noted to refute you. ... You have claimed both that the proof of the halting problem is flawed ...
    (sci.logic)
  • Re: Can you find anything wrong with this solution to the Halting Problem?
    ... >> halting problem. ... >My counter-example attempts to directly refute this statement. ... That's exactly the statement that led to my "huh". ... making access to the key impossible is simply _irrelevant_. ...
    (sci.logic)
Loading