Computational problems can be described in many ways. Almost every discipline has their own special or favorite way on defining and grouping the problems that they compute. In this section we shall characterize several classes of problems using methods familiar to mathematicians and computer scientists. Then we shall concentrate upon one very prevalent class of problems: those whose solutions can be verified easily but seem to require vast amounts of time to solve optimally.

The sections are: