Invisible wrote:
> - If you have an arbitrary program written in a Turing-complete > language, which properties *can* you determine, and which ones *can't* > you determine?
This seems relevant:
http://en.wikipedia.org/wiki/Rice%27s_theorem
Now, if only it wasn't completely incomprehensible...
