2 ms·
As far as I know formal verification doesn’t necessarily give way for much parallelism, and the halting problem will not become obsolete, and the latter is a lo
by kaba0 6y ago
As far as I know formal verification doesn’t necessarily give way for much parallelism, and the halting problem will not become obsolete, and the latter is a lower bound on many interesting properties.
So unless there is a radically new way to serial computations, that is orders of magnitude faster, I doubt much would change. CPUs are already quite at the limit with super-scalar architectures.
- jerome-jh 6y agoOf course verification in its full generality is a dead end. However expressing an algorithm in a sound logical system, and proving properties of the algorithm is quite fruitful. That's the approach taken by Coq and probably others. Most of the time the prover still needs some guidance from the user though.