News for hackers. Stuff that matters.
Re:Unprovability comes to machine learning by red75prime on Wednesday January 09, 2019 @02:56AM (#18863083)
If the halting problem was merely NP complex, it would have still limited practical possibilities of static analysis.
Re:Unprovability comes to machine learning by adrianN on Wednesday January 09, 2019 @03:50AM (#18863313)
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.
Re:Unprovability comes to machine learning by red75prime on Wednesday January 09, 2019 @03:55AM (#18863339)
Yes. And the halting problem doesn't preclude static program analysis even if it works with only a subset of all possible programs.
Re:Unprovability comes to machine learning by adrianN on Wednesday January 09, 2019 @03:57AM (#18863345)
It looks like we're in perfect agreement then.