3 ms·
This is my understanding as well, and underlies my assertions above. After all, if a compiler can tell you for certain that any given program written in a Turin
by kibwen 11y ago
This is my understanding as well, and underlies my assertions above. After all, if a compiler can tell you for certain that any given program written in a Turing-complete language will terminate, then you've literally just solved the halting problem. :P
- TheCoelacanth 11y agoOf course, it's true that it can't be proven whether any arbitrary program will halt or not, but in practice most (possibly all) useful programs can be proven to halt or not halt.