In
theoretical computer science, a computational problem is a
mathematical object representing a question that
computers might want to solve. For example, "given any number x, determine whether x is prime" is a computational problem. Computational problems are one of the main objects of study in theoretical computer science, because nearly any task one would want to accomplish is an example of a computational problem. In the field of
algorithms, we study methods of solving computational problems; in the complementary field of
computational complexity theory, we organize computational problems based on how difficult they are to solve.
See more at Wikipedia.org...
Free Download Now!
