News for hackers. Stuff that matters.
Re:There Will Be a Scientific Theory of Deep Learning by imtringued on Saturday April 25, 2026 @05:26AM (#47900009)
An NP problem can contain subproblems that are not worst case problems.

It's similar to the gap between pushdown automata and Turing machines. You can check if pushdown automata will terminate or not. You can't do it for Turing machines, but this doesn't stop you from running a pushdown automata algorithm on the turning machine with decidable termination.

There are no comments on this comment yet.