{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:16Z","timestamp":1725663976507},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573708"},{"type":"electronic","value":"9783540480969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57370-4_44","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:55:26Z","timestamp":1330242926000},"page":"150-163","source":"Crossref","is-referenced-by-count":1,"title":["On aggregating teams of learning machines"],"prefix":"10.1007","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arun","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"12_CR1","first-page":"82","volume-title":"Theory of Algorithms and Programs","author":"J. M. Barzdin","year":"1974","unstructured":"J. M. Barzdin. Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs, Latvian State University, Riga, 210:82\u201388, 1974. In Russian."},{"key":"12_CR2","unstructured":"J. M. Barzdin and K. Podnieks. The theory of inductive inference. In Mathematical Foundations of Computer Science, 1973."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"M. Blum. A machine independent theory of the complexity of recursive functions. Journal of the ACM, 14:322\u2013336, 1967.","journal-title":"Journal of the ACM"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01761704","volume":"8","author":"J. Case","year":"1974","unstructured":"J. Case. Periodicity in generations of automata. Mathematical Systems Theory, 8:15\u201332, 1974.","journal-title":"Mathematical Systems Theory"},{"key":"12_CR5","unstructured":"J. Case. The power of vacillation. In D. Haussler and L. Pitt, editors, Proceedings of the Workshop on Computational Learning Theory, pages 133\u2013142. Morgan Kaufmann Publishers, Inc., 1988. Expanded in [6]."},{"key":"12_CR6","unstructured":"J. Case. The power of vacillation in language learning. Technical Report 93-08, University of Delaware, 1992. Expands on [5]; journal article under review."},{"key":"12_CR7","first-page":"107","volume-title":"Machine inductive inference and language identification","author":"J. Case","year":"1982","unstructured":"J. Case and C. Lynes. Machine inductive inference and language identification. In M. Nielsen and E. M. Schmidt, editors, Proceedings of the 9th International Colloquium on Automata, Languages and Programming, volume 140, pages 107\u2013115. Springer-Verlag, Berlin, 1982."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193\u2013220, 1983.","journal-title":"Theoretical Computer Science"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"R. Freivalds. Functions computable in the limit by probabilistic machines. Mathematical Foundations of Computer Science, 1975.","DOI":"10.1007\/3-540-07162-8_671"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"E. M. Gold. Language identification in the limit. Information and Control, 10:447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"12_CR11","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory Languages and Computation. Addison-Wesley Publishing Company, 1979."},{"key":"12_CR12","first-page":"163","volume-title":"Finite learning by a team","author":"S. Jain","year":"1990","unstructured":"S. Jain and A. Sharma. Finite learning by a team. In M. Fulk and J. Case, editors, Proceedings of the Third Annual Workshop on Computational Learning Theory, Rochester, New York, pages 163\u2013177. Morgan Kaufmann Publishers, Inc., August 1990."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"S. Jain and A. Sharma. Language learning by a team. In M. S. Paterson, editor, Proceedings of the 17th International Colloquium on Automata, Languages and Programming, pages 153\u2013166. Springer-Verlag, July 1990.","DOI":"10.1007\/BFb0032029"},{"key":"12_CR14","unstructured":"S. Jain and A. Sharma. Computational limits on team identification of languages. Technical Report 9301, School of Computer Science and Engineering; University of New S outh Wales, 1993."},{"key":"12_CR15","volume-title":"Probability is more powerful than team for language identification","author":"S. Jain","year":"1993","unstructured":"S. Jain and A. Sharma. Probability is more powerful than team for language identification. In Proceedings of the Sixth Annual Workshop on Computational Learning Theory, Santa Cruz, California. ACM Press, July 1993."},{"key":"12_CR16","volume-title":"An Introduction to the General Theory of Algorithms","author":"M. Machtey","year":"1978","unstructured":"M. Machtey and P. Young. An Introduction to the General Theory of Algorithms. North Holland, New York, 1978."},{"key":"12_CR17","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0019-9958(86)80025-0","volume":"70","author":"D. Osherson","year":"1986","unstructured":"D. Osherson, M. Stob, and S. Weinstein. Aggregating inductive expertise. Information and Control, 70:69\u201395, 1986.","journal-title":"Information and Control"},{"key":"12_CR18","volume-title":"Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"D. Osherson","year":"1986","unstructured":"D. Osherson, M. Stob, and S. Weinstein. Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge, Mass., 1986."},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(82)80025-9","volume":"52","author":"D. Osherson","year":"1982","unstructured":"D. Osherson and S. Weinstein. Criteria of language learning. Information and Control, 52:123\u2013138, 1982.","journal-title":"Information and Control"},{"key":"12_CR20","unstructured":"L. Pitt. A characterization of probabilistic inference. PhD thesis, Yale University, 1984."},{"key":"12_CR21","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0890-5401(88)90046-6","volume":"77","author":"L. Pitt","year":"1988","unstructured":"L. Pitt and C. Smith. Probability and plurality for aggregations of learning machines. Information and Computation, 77:77\u201392, 1988.","journal-title":"Information and Computation"},{"key":"12_CR22","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H. Rogers","year":"1958","unstructured":"H. Rogers. G\u00f6del numberings of partial recursive functions. Journal of Symbolic Logic, 23:331\u2013341, 1958.","journal-title":"Journal of Symbolic Logic"},{"key":"12_CR23","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967. Reprinted, MIT Press 1987."},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1145\/322344.322356","volume":"29","author":"C. Smith","year":"1982","unstructured":"C. Smith. The power of pluralism for automatic program synthesis. Journal of the ACM, 29:1144\u20131165, 1982.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57370-4_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:04:38Z","timestamp":1619557478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57370-4_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573708","9783540480969"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-57370-4_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}