We study a distribution dependent form of PAC learning
that uses probability distributions related to Kolmogorov complexity.
We relate the PACS model, defined by Denis, D'Halluin and Gilleron,
with the standard simple-PAC model and
give a general technique that subsumes the results
of Denis et al and Parekh and Honavar.
CitationCastro, J., Guijarro, D. "Query, PACS and simple-PAC learning". 1998.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org