Re: Disproof of the Halting Problem's Conclusion

From: Peter Olcott (olcott_at_worldnet.att.net)
Date: 07/16/04 

Date: Fri, 16 Jul 2004 12:16:19 GMT

"Sander Bruggink" <bruggink.at.phil.uu.nl@no.spam.please> wrote in message
news:cd883j$dog$1@husserl.admin.phil.uu.nl...
> Peter Olcott wrote:
> [Will Twentyman wrote:]
> >>It would be nice if they mentioned the restriction that the programming
> >>language needs to be Turing-Complete for the problem to apply.
> >
> > If one program could correctly determine if every other program
> > halts, I am sure that your specific type of program would be
> > included in the universal set of all programs, don't you think?
>
> Of course, but would you halting function be also of that specific type
> of program?
>
> Answer: NO, because *that* is what Turing proved.
>
> groente
> -- Sander
>
Then show me where my proof fails to be correct.
Note please stay within the restriction of the Possible Bases
for Refutation section.

Relevant Pages