3 ms·
It doesn't appear to be a general-case fix (which makes sense, because that would be impossible), but a method for certifying a subset of algorithms against hal
by amalcon 17y ago
It doesn't appear to be a general-case fix (which makes sense, because that would be impossible), but a method for certifying a subset of algorithms against halting problems in finite time (while giving no information for all other algorithms). We have a number of those.
- likpok 17y agoMore specifically, this appears to allow for more general model-checking, as most programming languages do not explicitly work on transitions (some declarative languages can be exceptions).