{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:20:12Z","timestamp":1648981212922},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4429,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0304-3975(00)00135-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:37:27Z","timestamp":1027607847000},"page":"91-117","source":"Crossref","is-referenced-by-count":3,"title":["Hierarchies of probabilistic and team FIN-learning"],"prefix":"10.1016","volume":"261","author":[{"given":"Andris","family":"Ambainis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kalvis","family":"Aps\u0131\u0304tis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl H.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00135-3_BIB1","doi-asserted-by":"crossref","unstructured":"K. Aps\u0131\u0304tis, R. Freivalds, C. Smith, Asymmetric team learning, Proc. COLT\u201997, 1997, pp. 90\u201395.","DOI":"10.1145\/267460.267484"},{"issue":"2","key":"10.1016\/S0304-3975(00)00135-3_BIB2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","article-title":"Comparison of identification criteria for machine inductive inference","volume":"25","author":"Case","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00135-3_BIB3","doi-asserted-by":"crossref","unstructured":"R. Daley, B Kalyanasundaram, Finite learning capabilities and their limits, Available from http:\/\/www.cs.pitt.edu\/\u223cdaley\/fin\/fin.html, 1996.","DOI":"10.1145\/267460.267483"},{"key":"10.1016\/S0304-3975(00)00135-3_BIB4","series-title":"Proc. 5th Annual Workshop on Computational Learning Theory","first-page":"203","article-title":"Breaking the probability 1\/2 barrier in fin-type learning","author":"Daley","year":"1992"},{"key":"10.1016\/S0304-3975(00)00135-3_BIB5","series-title":"Proc. 1991 Workshop on Computational Learning Theory","first-page":"228","article-title":"Relations between probabilistic and team one-shot learners","author":"Daley","year":"1991"},{"key":"10.1016\/S0304-3975(00)00135-3_BIB6","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00135-3_BIB7","series-title":"Game Theory","author":"Petrosian","year":"1996"},{"key":"10.1016\/S0304-3975(00)00135-3_BIB8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0890-5401(88)90046-6","article-title":"Probability and plurality for aggregations of learning machines","volume":"77","author":"Pitt","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00135-3_BIB9","series-title":"How to Solve It","author":"Polya","year":"1945"},{"key":"10.1016\/S0304-3975(00)00135-3_BIB10","series-title":"Linear Orderings","author":"Rosenstein","year":"1982"},{"issue":"4","key":"10.1016\/S0304-3975(00)00135-3_BIB11","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1145\/322344.322356","article-title":"The power of pluralism for automatic program synthesis","volume":"29","author":"Smith","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00135-3_BIB12","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/S0304-3975(00)00135-3_BIB13","series-title":"Proc. 1989 Workshop on Computational Learning Theory","first-page":"200","article-title":"Inductive inference with a bounded number of mind changes","author":"Velauthapillai","year":"1989"},{"key":"10.1016\/S0304-3975(00)00135-3_BIB14","first-page":"93","article-title":"Limes-erkennung rekursiver funktionen durch spezielle strategien","volume":"12","author":"Wiehagen","year":"1976","journal-title":"Elektron. Inform. Kybernet."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001353?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001353?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T16:53:32Z","timestamp":1579020812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0304397500001353"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00135-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}