Data Structures and Algorithm Analysis - Computer Science at ...

Sec. 17.3 Impossible Problems 555algorithm match the lower bound for the problem with certainty, it is nearly asgood. Once we realize that a problem is N P-complete, then we know that our nextstep must either be to redefine the problem to make it easier, or else use one of the“coping” strategies discussed in this section.17.3 Impossible ProblemsEven the best programmer sometimes writes a program that goes into an infiniteloop. Of course, when you run a program that has not stopped, you do not knowfor sure if it is just a slow program or a program in an infinite loop. After “enoughtime,” you shut it down. Wouldn’t it be great if your compiler could look at yourprogram and tell you before you run it that it will get into an infinite loop? To bemore specific, given a program and a particular input, it would be useful to know ifexecuting the program on that input will result in an infinite loop without actuallyrunning the program.Unfortunately, the Halting Problem, as this is called, cannot be solved. Therewill never be a computer program that can positively determine, for an arbitraryprogram P, if P will halt for all input. Nor will there even be a computer programthat can positively determine if arbitrary program P will halt for a specified input I.How can this be? Programmers look at programs regularly to determine if they willhalt. Surely this can be automated. As a warning to those who believe any programcan be analyzed in this way, carefully examine the following code fragment beforereading on.while (n > 1)if (ODD(n))n = 3 * n + 1;elsen = n / 2;This is a famous piece of code. The sequence of values that is assigned to nby this code is sometimes called the Collatz sequence for input value n. Doesthis code fragment halt for all values of n? Nobody knows the answer. Everyinput that has been tried halts. But does it always halt? Note that for this codefragment, because we do not know if it halts, we also do not know an upper boundfor its running time. As for the lower bound, we can easily show Ω(log n) (seeExercise 3.14).Personally, I have faith that someday some smart person will completely analyzethe Collatz function, proving once and for all that the code fragment halts forall values of n. Doing so may well give us techniques that advance our ability todo algorithm analysis in general. Unfortunately, proofs from computability — thebranch of computer science that studies what is impossible to do with a computer— compel us to believe that there will always be another bit of program code that