3.Next

In theoretical computer science, a problem is one that asks for a solution in terms of an algorithm. For example, the problem of factoring

:"Given a positive integer n, find a nontrivial prime factor of n."

is a computational problem that has a solution, as there are many known integer factorization algorithms. A computational problem can be viewed as a set

3.Next