Turing Says No!

Was explaining how figuring out full dependency information in a system where you can run arbitrary code is hard to the point of impossibility. Think it is best summed up with this image, what I made in gimp.



Beneath it should of course be a proof of the undecidability of the halting problem.