Question

Computational complexity of classes of learning problems depends on which of the following?
A) The size or complexity of the hypothesis space considered by learner
B) the accuracy to which the target concept must be approximated
C) the probability that the learner will output a successful hypothesis
D) All of the above

Answer 1

Hi there,

Statement: Computational complexity of classes of learning problems depends on which of the following?

Answer: A) The size or complexity of the hypothesis space considered by learner

I hope the answer is helpful. Thanks.

Answer 2

"Computational complexity of classes of learning problems depends on the size or complexity of the hypothesis space considered by learner, the accuracy to which the target concept must be approximated, and the probability that the learner will output a successful hypothesis

Therefore, the right answer is D) All of the above

"