Invisible wrote:
> Sure. Because working out what order an arbitrary program wants to 
> access its data in is not, in any way, equivilent to the halting 
> problem. No sir!

Remember, the Halting Problem is unsolvable in the general case, but may 
be solvable in specific cases.

It's the same thing with compiled code.  While the compiler can't 
guarantee that *every* code file will be compiled to its optimal machine 
code, it can guarantee that *sets* of code files will.  The job of the 
compiler developer is to identify these potential sets, and teach the 
compiler to recognize them.

-- 
Chambers

Post a reply to this message