We show what happen to learning if the learner can use NP-oracle.
A consequence of our results we show that
If NP\subset P/poly then the polynomial Hierarchy collapses to ZPP^NP

END_OF_DESCRIPTION
Contact: bshouty@cpsc.ucalgary.ca (Nader Bshouty)