KnowraDecision problemLinked fromLinked fromThe 20 pages that link to Decision problem, each with the reason it gives.All 20Broader topic 2Related 8Narrower topic 9Compared with 1Computable functionRelated: Its characteristic function is computable exactly when the problem is decidable.NP-hardnessRelated: NP is defined for decision problems, even when the target of a reduction is broader.Hilbert's problemsRelated: Hilbert's tenth problem asks whether integer polynomial solvability has such a procedure.Nondeterministic Turing machineRelated: Machine acceptance provides a formal way to decide yes-instances.Oracle Turing machineRelated: An oracle query asks precisely whether an input has a yes answer for a fixed problem.Quantifier eliminationRelated: Effective elimination can provide a decision procedure for a theory.Savitch's theoremRelated: The theorem compares which yes-or-no problems machines can solve within space bounds.Theory of computationRelated: Decidability and complexity classify which yes-or-no problems machines can solve.