Re: What is the Result from Invoking this Halt Function?
From: Peter Olcott (olcott_at_worldnet.att.net)
Date: 08/11/04
- Next message: Peter Olcott: "Re: What is the Result from Invoking this Halt Function?"
- Previous message: Peter Olcott: "Re: What is the Result from Invoking this Halt Function?"
- In reply to: Will Twentyman: "Re: What is the Result from Invoking this Halt Function?"
- Next in thread: David C. Ullrich: "Re: What is the Result from Invoking this Halt Function?"
- Reply: David C. Ullrich: "Re: What is the Result from Invoking this Halt Function?"
- Reply: Will Twentyman: "Re: What is the Result from Invoking this Halt Function?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Tue, 10 Aug 2004 23:44:43 GMT
"Will Twentyman" <wtwentyman@read.my.sig> wrote in message news:4118e82c$1_5@newsfeed.slurp.net...
> Peter Olcott wrote:
>
> > "Marc Goodman" <marc.goodman@comcast.net> wrote in message news:U_XRc.277260$Oq2.198273@attbi_s52...
> >
> >>Peter Olcott wrote:
> >>
> >>>>Isn't it about time you started to read Turing's proof so you can
> >>>>pinpoint the exact line which is in error?
> >>>
> >>>It looks like the error is in its application to the Halting Problem.
> >>>I did print it out. There is some material that is interesting and easy.
> >>
> >>So, Peter, just to make sure I understand...
> >>You now say that since your refutation of Turing's proof does
> >>not actually apply to Turing's proof, that it's because Turing's
> >>proof has been erroneously applyed to halting problem? Or, your
> >
> >
> > It looks like Turing's proof may be erroneously applied to the
> > Halting Problem. It looks like Turing might have assumed that
> > the Halt function must always return a result to all callers.
>
> That is basically what the Halt function is *defined* to do. "return a
> result to all callers," is not how it is normally defined, but that is a
> fairly good description of the required behavior.
How about this?
A halt function that correctly determines whether any element in the
universal set of Turing Machines will execute in a finite number of
steps for any specific input data.
This one is no longer impossible. I will update my website
very soon, and provide a good write-up of this much simpler
proof.
> It appears that you don't understand what the Halting Problem is talking
> about.
>
> --
> Will Twentyman
> email: wtwentyman at copper dot net
>
- Next message: Peter Olcott: "Re: What is the Result from Invoking this Halt Function?"
- Previous message: Peter Olcott: "Re: What is the Result from Invoking this Halt Function?"
- In reply to: Will Twentyman: "Re: What is the Result from Invoking this Halt Function?"
- Next in thread: David C. Ullrich: "Re: What is the Result from Invoking this Halt Function?"
- Reply: David C. Ullrich: "Re: What is the Result from Invoking this Halt Function?"
- Reply: Will Twentyman: "Re: What is the Result from Invoking this Halt Function?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|