Skip to main content
Computer Science

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

4
  • $\begingroup$ Thanks, but couldn't one reframe these problems as optimization problems using a loss function? e.g. $\text{argmin}_x f(x)$, where f is a measure of error defined against the result of the desired problem. In other words, couldn't one argue that (many?) non-optimization problems are "easily" reducible to optimization problems? Or is that not always feasible? $\endgroup$ Commented Apr 21, 2020 at 12:01
  • $\begingroup$ @AmelioVazquez-Reina, yes for search problems, no for counting problems. Yes many problems are reducible to optimization problems, which is not the same as saying they are an optimization problem. $\endgroup$ Commented Apr 21, 2020 at 16:16
  • $\begingroup$ Thanks. Why yes for search but not for counting problems? $\endgroup$ Commented Apr 21, 2020 at 17:55
  • $\begingroup$ @AmelioVazquez-Reina, I don't know how to give a "why". I don't see how to usefully express a counting problem in that form. $\endgroup$ Commented Apr 21, 2020 at 18:59