Using the Halting Problem to Measure Software Complexity

5 Using the Halting Problem to Measure Software Complexity 

The trouble with insight problems is that they are not reliably solved by individuals. They are unreliably solvable - in other words, a solution is possible, but there is no analytic procedure to do so. Even worse, if programmers do not realize that they are looking at an insight problem, they might not know that special care must be taken. 

So how is an insight problem in code recognized Since the types of programming structures which make a program universal have already been determined (i.e., arbitrary looping structures), those structures in code can therefore be detected. 

For most programming languages, the main structures which must be detected are the following  

Loops where the iterations are not implicit in the control structure (called open-ended loops) 

---