Hacker News new | ask | show | jobs
by dxhdr 4076 days ago
Variation on the halting problem? Given infinite running time and arbitrary input, can you prove that a program will never access file X.
2 comments

Agreed that this seems equivalent to me. Assume instead of the instruction "access file X", the instruction is HALT.
There's no general algorithm, but you could probably prove it, if you tried really hard for your given example. :D
I'm also interested if it's possible to say so with certainty.