2 ms·
Eh, modern SMT solvers are very practical tools, as are solvers for Mixed Integer Linear Programs. NP-completeness doesn't mean that you can't solve most instan
by adrianN 8y ago
Eh, modern SMT solvers are very practical tools, as are solvers for Mixed Integer Linear Programs. NP-completeness doesn't mean that you can't solve most instances you care about in reasonable time.
- red75prime 8y agoYes. And the halting problem doesn't preclude static program analysis even if it works with only a subset of all possible programs.
- adrianN 8y agoIt looks like we're in perfect agreement then.