Re: Disproof of the Halting Problem's Conclusion
From: Peter Olcott (olcott_at_att.net)
Date: 07/14/04
- Next message: Acid Pooh: "Re: The natural numbers are uncountable"
- Previous message: Acid Pooh: "Re: non-pseudo random number generators"
- In reply to: G. Frege: "Re: Disproof of the Halting Problem's Conclusion"
- Next in thread: Martin Shobe: "Re: Disproof of the Halting Problem's Conclusion"
- Reply: Martin Shobe: "Re: Disproof of the Halting Problem's Conclusion"
- Reply: Tiefling: "RE: Disproof of the Halting Problem's Conclusion"
- Messages sorted by: [ date ] [ thread ]
Date: Wed, 14 Jul 2004 02:04:38 GMT
> All we need for the proof is the _assumption_ that there might be a
> function which is able to determine correctly for every program P and
> input I if P halts on input I or not.
>
> Now you claim that WillHalt() i s able to perform that. But that
> assumption leads directly to a contradiction.
>
No it does not. You still have not bothered to read through
everything that I have said.
http://home.att.net/~olcott/halts.html
Read it very carefully so you are sure that you know
exactly what I am saying. Especially read the Bases
for Refutation section. This section was formed
specifically to address your "refutation".
- Next message: Acid Pooh: "Re: The natural numbers are uncountable"
- Previous message: Acid Pooh: "Re: non-pseudo random number generators"
- In reply to: G. Frege: "Re: Disproof of the Halting Problem's Conclusion"
- Next in thread: Martin Shobe: "Re: Disproof of the Halting Problem's Conclusion"
- Reply: Martin Shobe: "Re: Disproof of the Halting Problem's Conclusion"
- Reply: Tiefling: "RE: Disproof of the Halting Problem's Conclusion"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|