Computation problem

In computability theory a computation problem is, informally speaking, any problem that one might attempt to solve using an algorithm. More formally, a computation problem is specified by a set of inputs and, for each input a non-empty set of valid outputs. When the outputs are always a Boolean value, it is customary to refer to the problem as a decision problem as opposed to function problems.