A computational model of teaching
- 1 July 1992
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 319-326
- https://doi.org/10.1145/130385.130421
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Separating distribution-free and mistake-bound learning models over the Boolean domainPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Negative Results for Equivalence QueriesMachine Learning, 1990
- Learning binary relations and total ordersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Queries and Concept LearningMachine Learning, 1988
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- On learning Boolean functionsPublished by Association for Computing Machinery (ACM) ,1987
- The knowledge complexity of interactive proof-systemsPublished by Association for Computing Machinery (ACM) ,1985
- A theory of the learnableCommunications of the ACM, 1984