4

I just ran across an answer to another question that references the Halting Problem. He starts with this snippet:

def halts( code_block ):
    # Some magical code

def whistler():
    while halts(whistler): 
        sys.whistle( 1 )

and then explains how the routine halts cannot be defined correctly because it essentially ends up being logically equivalent to "this sentence is false". Aside from the Python-style syntax, this is basically the standard explanation of the halting problem, and I've never understood the concept. Every time I look at that type of example, I think "but why in the world would anyone approach the problem in that way in the first place?"

If I wanted to determine a difficult property of a piece of code, such as answering the question of whether or not it halts, there's no way I would put the analysis inside the code to be analyzed! First off, that leads to contradictions like this example, and second, adding analysis code changes the nature of the thing being analyzed. I would almost certainly go about looking for the answer to the question with external tools, not internal ones.

So yes, I understand that there's no way to write a correct implementation of halts in the example above. But let's restrict ourselves solely to the realm of code that actually can be written correctly, instead of hypotheticals. What's an example of code that can actually be written and executed, for which it is impossible to determine by external analysis whether the code will end up in an infinite loop or whether it will terminate?

Mason Wheeler
  • 83,213

4 Answers4

6

Every time I look at that type of example, I think "but why in the world would anyone approach the problem in that way in the first place?"

If I wanted to determine a difficult property of a piece of code, such as answering the question of whether or not it halts, there's no way I would put the analysis inside the code to be analyzed!

The trick here is that this is a proof by contradiction : assume A, demonstrate it would imply a paradox, conclude assumption was wrong.

So the idea is not that we "would approach the problem in that way" or that we "would put the analysis inside the code to be analyzed". The idea is rather: suppose someone came up with a program and said "Look, I wrote a program that tell if any given program will halt or not". "Oh really? Lemme see what happens if I plug it into itself?" KABOOM!

There's no need to actually take an existing example: this already proves there's no way such a program could exist.

On a side note, it does not mean we cannot try to write such a halts function. It just means it is impossible to write a halts function that will work for any program.

Julien Guertault
  • 720
  • 4
  • 15
3

You are stating the answer to your question without realizing it.

So yes, I understand that there's no way to write a correct implementation of halts in the example above. But let's restrict ourselves solely to the realm of code that actually can be written correctly, instead of hypotheticals.

This is the essence of the halting problem. There is no way to write the halts function. There is no #some magical code. It cannot exist. The proof of the halting problem is a restriction on the realm of code that can be written.

What's an example of code that can actually be written and executed, for which it is impossible to determine by external analysis whether the code will end up in an infinite loop or whether it will terminate?

This is another important distinction to make. The halting problem says it is not possible to write a program that determines if any program will halt.

It is possible to write a program that determines if a particular program halts.

David
  • 329
2

If I wanted to determine a difficult property of a piece of code, such as answering the question of whether or not it halts, there's no way I would put the analysis inside the code to be analyzed! [...] I would almost certainly go about looking for the answer to the question with external tools, not internal ones.

If Turing's halting problem is really analogous Gödel's incompleteness theorems... then I think what it's really telling you is that you can never solve the problem without going to that external "layer" of meaning or representation.

Thus you cannot make an analyzer that works on itself, you can only make a meta-analyzer, and a meta-meta-analyzer for that, and a meta-meta-meta-analzyer for that, etc. (And you can't make reciprocal analyzers either.)

That's why the "nesting" is part of the problem.

Darien
  • 3,463
2

What's an example of code that can actually be written and executed, for which it is impossible to determine by external analysis whether the code will end up in an infinite loop or whether it will terminate?

The Collatz Conjecture, sometimes called the Syracuse Problem. http://en.wikipedia.org/wiki/Collatz_conjecture

Simple, and undecidable.

Need more? Here's a big list of problems you could write potentially correct algorithms for. Without a proof that your algorithm terminates, however, you don't ever really know if it's correct.

http://en.wikipedia.org/wiki/List_of_undecidable_problems

S.Lott
  • 45,522
  • 6
  • 93
  • 155