5 ms·
The thing to note about the halting problem is that it's impossible to create a general solution that works for all the input programs. That said, one could cre
by amix 18y ago
The thing to note about the halting problem is that it's impossible to create a general solution that works for all the input programs. That said, one could create an approximative solution and even solve the halting problem for non-turning complete languages.
A lot of the time when we actually solve "hard" problems, we only find approximative solutions (this is for example true when doing static code analysis). Asking does program X have any non-trivial property G is impossible to do in the general case, so we find an approximative solution that can answer this in most of the cases.
- Freaky 18y agohttp://research.microsoft.com/Terminator/ http://research.microsoft.com/Terminator/ The ultimate goal of the TERMINATOR project is develop automatic techniques (and tools that implement them) that will allow us to prove that industrial software components cannot hang.
- deleted 18y ago[deleted]
- cabalamat 18y ago(Said in an Austrian accent:) They'll be back.
- marvin 18y agoThis is actually pretty interesting. They aren't claiming that they are trying to make a general solution, just one that works in most cases. It might even be possible, AFAIK there hasn't been very much research in this area.
- LogicHoleFlaw 18y agoMy father designs HVAC systems for nuclear missile silos. I was asked him about how the embedded controls software works, and how they handle error conditions. The biggest concern? EMP blasts. The solution? Mechanical failsafes.