3 ms·
Just say yes (assuming you have done tests!) and have confidence in your changes. If it breaks something, put in some more tests to make sure it doesn't happen
by chris_wot 13y ago
Just say yes (assuming you have done tests!) and have confidence in your changes. If it breaks something, put in some more tests to make sure it doesn't happen again, or find the bug unveiled by your fix, then correct this!
I should note that this is legally unenforceable. Bad place to work, but if it ever came to court, you just cite the halting problem to show that you cannot say in all cases that a problem won't be halted. What is being asked in impossible, so unenforceable.
- munin 13y agoyour courtroom defense would hold until the expert witness reveals that you have not been programming a Turing machine with an infinite tape...
- chris_wot 13y agolol! Only flaw there is that the halting problem works on modern computing also :-)
- Robin_Message 13y agoNope, technically it has to be an infinite machine, otherwise it's just an over complicated finite state machine and proving termination in those is trivial. I/O (except to bounded sources like disks) could probably save you, but the proof will be harder.