{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T00:11:08Z","timestamp":1706659868872},"reference-count":12,"publisher":"Duke University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2019,1,1]]},"DOI":"10.1215\/00294527-2018-0021","type":"journal-article","created":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T03:06:20Z","timestamp":1547607980000},"source":"Crossref","is-referenced-by-count":0,"title":["Teachers, Learners, and Oracles"],"prefix":"10.1215","volume":"60","author":[{"given":"Achilles","family":"Beros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"de la Higuera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"3","unstructured":"[3] Beros, A., and A. de la Higuera, \u201cTeachers, learners and oracles,\u201d preprint, <a href=\"arXiv:1504.03623\">arXiv:1504.03623<\/a> [math.LO]."},{"key":"8","unstructured":"[8] Holte, R., S. Lange, S. Zilles, and M. Zinkevich, \u201cTeaching dimensions based on cooperative learning,\u201d pp. 135\u201346 in <i>Proceedings of the 21st Annual Conference on Learning Theory (COLT\u201908)<\/i>, Helsinki, 2008, <a href=\"http:\/\/colt2008.cs.helsinki.fi\/papers\/COLT2008.pdf\">http:\/\/colt2008.cs.helsinki.fi\/papers\/COLT2008.pdf<\/a>."},{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Angluin, D., \u201cQueries and concept learning,\u201d <i>Machine Learning<\/i>, vol. 2 (1988), pp. 319\u201342.","DOI":"10.1007\/BF00116828"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Angluin, D., \u201cQueries revisited,\u201d <i>Theoretical Computer Science<\/i>, vol. 313 (2004), pp. 175\u201394.","DOI":"10.1016\/j.tcs.2003.11.004"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Doliwa, T., H. U. Simon, and S. Zilles, \u201cRecursive teaching dimension, learning complexity, and maximum classes,\u201d pp. 209\u201323 in <i>Proceedings of the 21st International Conference on Algorithmic Learning Theory (ALT\u201910)<\/i>, edited by M. Hutter, F. Stephan, V. Vovk, and T. Zeugmann, Springer, Berlin, 2010.","DOI":"10.1007\/978-3-642-16108-7_19"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Floyd, S., and M. Warmuth, \u201cSample compression, learnability, and the Vapnik-Chervonenkis dimension,\u201d <i>Machine Learning<\/i>, vol. 21 (1995), pp. 1\u201336.","DOI":"10.1007\/BF00993593"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Fortnow, L., W. Gasarch, S. Jain, E. Kinber, M. Kummer, S. Kurtz, M. Pleszkovich, T. Slaman, R. Solovay, and F. Stephan, \u201cExtremes in the degrees of inferability,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 66 (1994), pp. 231\u201376.","DOI":"10.1016\/0168-0072(94)90035-3"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Goldman, S. A., and M. J. Kearns, \u201cOn the complexity of teaching,\u201d <i>Journal of Computer and System Sciences<\/i>, vol. 50 (1995), pp. 20\u201331.","DOI":"10.1006\/jcss.1995.1003"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Jain, S., and A. Sharma, \u201cOn the non-existence of maximal inference degrees for language identification,\u201d <i>Information Processing Letters<\/i>, vol. 47 (1993), pp. 81\u201388.","DOI":"10.1016\/0020-0190(93)90229-3"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Kummer, M., and F. Stephan, \u201cOn the structure of degrees of inferability,\u201d <i>Journal of Computer and System Sciences<\/i>, vol. 52 (1996), pp. 214\u201338.","DOI":"10.1006\/jcss.1996.0018"},{"key":"11","unstructured":"[11] Sammut, C., and R. Banerji, \u201cLearning concepts by asking questions,\u201d pp. 167\u201392 in <i>Machine Learning: An Artificial Intelligence Approach<\/i>, vol. 2, edited by R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, Morgan Kaufmann Publishers, Los Altos, CA, 1986."},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Stephan, F., \u201cNoisy inference and oracles,\u201d <i>Theoretical Computer Science<\/i>, vol. 185 (1997), pp. 129\u201357.","DOI":"10.1016\/S0304-3975(97)00018-2"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2018-0021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:59:40Z","timestamp":1706648380000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-60\/issue-1\/Teachers-Learners-and-Oracles\/10.1215\/00294527-2018-0021.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":12,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2018-0021","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2019,1,1]]}}}