In computational complexity theory and computability theory, a search problem is a computational problem of finding
an admissible answer for a given input value, provided that such an answer exists. In fact, a search problem is specified by a binary relation where if and only if " is an admissible answer given ".
If <math>R</math> is a binary relation such that <math>\operatorname{field}(R)\subseteq\Gamma^{+}</math> and <math>T</math> is a Turing machine, then <math>T</math> calculates <math>f</math> if: