Characterizing the learnability of Kolmogorov easy circuit expressions
José Luis Balcázar Navarro, Harry Buhrman Canal · 1996
We show that Kolmogorov easy circuit expressions can be learned with membership queries in polynomial time if and only if every NE-predicate is E-solvable. Moreover we show that the previously known algorithm, that uses an oracle in NP, is optimal in some relativized world.