True positives and false negatives are computationally easy to compute, as they only require evaluating S(x) on all the positive inputs x in D test all .
without any structural assumptions on S, it is computationally infeasible to exactly compute the number of false positives, as that would require evaluating S on every negative example in D test all , which is too large to enumerate.