Turing's Halting Algorithm Question

From: phl (killkennyhouse_at_hotmail.com)
Date: 12/24/04 

Date: 24 Dec 2004 03:35:18 -0800

Hi

I have been trying to understand the basics of Turing machines and I am
having some problem understanding the halting algorithm. The book I
have states that last two instructions are:

-If U(Universal Turing machine) stops with input data d+d (where
d=code(Program)), repeat this step indefintely.

-If U does not stop with with input data d+d, then stop.

How is this done in practice? THe book states that you just leave out
the stop instructions in d, then thats how you would know if it gets
stuck. But really, how do you know its going stop at all at any point
of the analysis? Was Turing going wait just for a certain time
depending on the complexity of his program?

Can someone please shed some light on this? the book I have tries to
explain it in a few pages. I would like to understand his eventual
conclusion on this.

Cheers

Relevant Pages

  • Re: Foundation for a Formal Refutation of the Original Halting Problem?
    ... > same input data, must always produce the same results. ... back to properly substantiated claims that your claims were incorrect. ... It's based on the fact that Turing Machines are completely ... > would appear to an outside observer to be the most correct. ...
    (sci.logic)
  • Re: Foundation for a Formal Refutation of the Original Halting Problem?
    ... > same input data, must always produce the same results. ... back to properly substantiated claims that your claims were incorrect. ... It's based on the fact that Turing Machines are completely ... > would appear to an outside observer to be the most correct. ...
    (comp.theory)
  • Re: Turings Halting Algorithm Question
    ... > I have been trying to understand the basics of Turing machines and I am ... > having some problem understanding the halting algorithm. ... One version of the formal proof depends on a diagonalization ...
    (comp.theory)