A Programmer is right in his answer.
I got curious and went for more material. I found this on Wikipedia:
In computability theory and computational complexity theory a decision problem is a question about a formal system with a yes-or-no answer. For example, the problem: "data two numbers x and y, y is divisible by x?" is a decision problem. (...)
So for all practical purposes, we can interpret this as "anything you can represent with a function/method that considers a condition and returns boolean".
There are actually many implications for those who study mathematics scientifically, or for those who do research on the history of computing. But for most of us it turns out to be just a curiosity.
That does not mean that this is not of great importance. Alan Turing developed all his work on computing machines to solve problems such as the decision problem. If these problems hadn’t been proposed, we wouldn’t have all the technology we have today.
Can you be a little less succinct? For example, any and all boolean expressions, where the possible results are
true
andfalse
, are classified as a decision problem?– Woss
It means you can take on the states at the same time 0 and 1?
– gato
How I answered 0 OR 1, not 0 AND 1.
– Um Programador
@Cat, that’s a quantum thing. Quantum decision problems return a qubit, but the qubit only remains in that state until it is evaluated by an external system; type, quantum machines return qubits only to other quantum machines. By the way, a qubit is the overlap between
true
andfalse
, which means that something can be 73% true is 27% false, not just half and half– Jefferson Quesado