Decision problem
Builds on Formal languageEncoding of data
Definition
Let be an alphabet. A decision problem over is a formal language . Its instances are the strings , the yes-instances are the strings in , and the no-instances are the strings not in .
More generally, a decision problem is given by a set of instances and a subset of yes-instances. With an encoding , it corresponds to the language .
Remarks
Example: PRIMES is the set of binary numerals of prime numbers, a language over . The string is a yes-instance, since is prime, and is a no-instance, since is not. Non-example: computing the greatest common divisor of two numbers is not a decision problem. Its answers are numbers, not yes or no. It is a function problem; a related decision problem asks whether the greatest common divisor of and equals . For computability, the choice of a reasonable encoding does not matter. For complexity, the encoding should not inflate the input. Writing in unary instead of binary can change a running time from exponential to polynomial in the input length.
Reading path
To understand this page from the ground up, read these 27 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Injective function concept
- Monoid concept
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Function definition
- Codomain definition
- Injective function definition
- Free monoid definition
- Surjective function definition
- Bijective function definition
- Equinumerous sets definition
- Finite set definition
- Alphabet definition
- String definition
- Encoding of data definition
- Formal language definition
- Decision problem definition
Further reading
About this page
| Tag | B3DM1AYBVE |
|---|---|
| URI | m2://B3DM1AYBVE |
| Kind | definition |
| Writing | W0 stub |
| MSC | 68Q01, 03D35 |
| Defines | Decision problem |
| Uses | Formal language, Encoding of data |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.