Turing Says No!
Jun. 8th, 2012 08:59 pm![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
morwenWas 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.
Beneath it should of course be a proof of the undecidability of the halting problem.
no subject
Date: 2012-06-08 08:48 pm (UTC)