4 ms·
Variation on the halting problem? Given infinite running time and arbitrary input, can you prove that a program will never access file X.
by dxhdr 12y ago
Variation on the halting problem? Given infinite running time and arbitrary input, can you prove that a program will never access file X.
- birdsbolt 12y agoThere's no general algorithm, but you could probably prove it, if you tried really hard for your given example. :D
- seanp2k2 12y agoI'm also interested if it's possible to say so with certainty.
- deleted 12y ago[deleted]
- michaelmior 12y agoAgreed that this seems equivalent to me. Assume instead of the instruction "access file X", the instruction is HALT.