# Decision problem

In computability theory and computational complexity theory, a **decision problem** is a question in some formal system with a yes-or-no answer, depending on the values of some input parameters. Decision problems typically appear in mathematical questions of decidability, that is, the question of the existence of an effective method to determine the existence of some object or its membership in a set; some of the most important problems in mathematics are undecidable.

For example, the problem "given two numbers *x* and *y*, does *x* evenly divide *y*?" is a decision problem. The answer can be either 'yes' or 'no', and depends upon the values of *x* and *y*. A method for solving a decision problem, given in the form of an algorithm, is called a **decision procedure** for that problem. A decision procedure for the decision problem "given two numbers *x* and *y*, does *x* evenly divide *y*?" would give the steps for determining whether *x* evenly divides *y*, given *x* and *y*. One such algorithm is long division, taught to many school children. If the remainder is zero the answer produced is 'yes', otherwise it is 'no'. A decision problem which can be solved by an algorithm, such as this example, is called *decidable*.

The field of computational complexity categorizes *decidable* decision problems by how difficult they are to solve. "Difficult", in this sense, is described in terms of the computational resources needed by the most efficient algorithm for a certain problem. The field of recursion theory, meanwhile, categorizes *undecidable* decision problems by Turing degree, which is a measure of the noncomputability inherent in any solution. Decision problems are closely related to function problems, which can have answers that are more complex than a simple 'yes' or 'no'. A corresponding function problem is "given two numbers *x* and *y*, what is *x* divided by *y*?". They are also related to optimization problems, which are concerned with finding the *best* answer to a particular problem. There are standard techniques for transforming function and optimization problems into decision problems, and vice versa, that do not significantly change the computational difficulty of these problems. For this reason, research in computability theory and complexity theory have typically focused on decision problems.

## Definition

A *decision problem* is any arbitrary yes-or-no question on an infinite set of inputs. Because of this, it is traditional to define the decision problem equivalently as: the set of possible inputs together with the set of inputs for which the problem returns *yes*.

These inputs can be natural numbers, but may also be values of some other kind, such as strings over the binary alphabet {0,1} or over some other finite set of symbols. The subset of strings for which the problem returns "yes" is a formal language, and often decision problems are defined in this way as formal languages.

Alternatively, using an encoding such as Gödel numberings, any string can be encoded as a natural number, via which a decision problem can be defined as a subset of the natural numbers.

## Examples

A classic example of a decidable decision problem is the set of prime numbers. It is possible to effectively decide whether a given natural number is prime by testing every possible nontrivial factor. Although much more efficient methods of primality testing are known, the existence of any effective method is enough to establish decidability.

## Decidability

A decision problem *A* is called *decidable* or *effectively solvable* if *A* is a recursive set. A problem is called *partially decidable*, *semidecidable*, *solvable*, or *provable* if *A* is a recursively enumerable set. Problems that are not decidable are called *undecidable*.

The halting problem is an important undecidable decision problem; for more examples, see list of undecidable problems.

## Complete problems

Decision problems can be ordered according to many-one reducibility and related to feasible reductions such as polynomial-time reductions. A decision problem *P* is said to be *complete* for a set of decision problems *S* if *P* is a member of *S* and every problem in *S* can be reduced to *P*. Complete decision problems are used in computational complexity to characterize complexity classes of decision problems. For example, the Boolean satisfiability problem is complete for the class NP of decision problems under polynomial-time reducibility.

## Equivalence with function problems

A function problem consists of a partial function *f*; the informal "problem" is to compute the values of *f* on the inputs for which it is defined.

Every function problem can be turned into a decision problem; the decision problem is just the graph of the associated function. (The graph of a function *f* is the set of pairs (*x*,*y*) such that *f*(*x*) = *y*.) If this decision problem were effectively solvable then the function problem would be as well. This reduction does not respect computational complexity, however. For example, it is possible for the graph of a function to be decidable in polynomial time (in which case running time is computed as a function of the pair (*x*,*y*) ) when the function is not computable in polynomial time (in which case running time is computed as a function of *x* alone). The function *f*(*x*) = *2*^{x} has this property.

Every decision problem can be converted into the function problem of computing the characteristic function of the set associated to the decision problem. If this function is computable then the associated decision problem is decidable. However, this reduction is more liberal than the standard reduction used in computational complexity (sometimes called polynomial-time many-one reduction); for example, the complexity of the characteristic functions of an NP-complete problem and its co-NP-complete complement is exactly the same even though the underlying decision problems may not be considered equivalent in some typical models of computation.

## See also

- ALL (complexity)
- Computational problem
- Decidability (logic) – for the problem of deciding whether a formula is a consequence of a logical theory.
- yes-no question
- Optimization problem
- Search problem
- Counting problem (complexity)
- Function problem
- Word problem (mathematics)

## References

- Kozen, D.C. (1997),
*Automata and Computability*, Springer. - Hartley Rogers, Jr.,
*The Theory of Recursive Functions and Effective Computability*, MIT Press, ISBN 0-262-68052-1 (paperback), ISBN 0-07-053522-1 - Sipser, M. (1996),
*Introduction to the Theory of Computation*, PWS Publishing Co. - Robert I. Soare (1987),
*Recursively Enumerable Sets and Degrees*, Springer-Verlag, ISBN 0-387-15299-7 - Daniel Kroening & Ofer Strichman,
*Decision procedures*, Springer, ISBN 978-3-540-74104-6 - Aaron Bradley & Zohar Manna,
*The calculus of computation*, Springer, ISBN 978-3-540-74112-1