{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:23Z","timestamp":1725664583509},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540604549"},{"type":"electronic","value":"9783540474708"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60454-5_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:30:33Z","timestamp":1330281033000},"page":"201-214","source":"Crossref","is-referenced-by-count":1,"title":["Simulating teams with many conjectures"],"prefix":"10.1007","author":[{"given":"Bala","family":"Kalyanasundaram","sequence":"first","affiliation":[]},{"given":"Mahendran","family":"Velauthapillai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"Angluin, D., and Smith, C.H. (1983), Inductive inference: Theory and Methods, Computing Surveys, 15, 237\u2013269.","journal-title":"Computing Surveys"},{"key":"15_CR2","first-page":"409","volume-title":"Encyclopedia of Artificial Intelligence","author":"D. Angluin","year":"1987","unstructured":"Angluin, D., and Smith, C.H. (1987), Inductive inference, in Encyclopedia of Artificial Intelligence (S. Shapiro), pp. 409\u2013418, Wiley, New York."},{"key":"15_CR3","first-page":"82","volume-title":"Theory of Algorithms and Programs","author":"J.A. Barzdin","year":"1974","unstructured":"Barzdin, J.A.(1974), Two theorems on the limiting synthesis of functions, in Theory of Algorithms and Programs (Barzdin, Ed.), Vol. 1, 82\u201388, Latvian State University, Riga, USSR."},{"key":"15_CR4","first-page":"1224","volume":"13","author":"J.A. Barzdin","year":"1972","unstructured":"Barzdin, J.A., and Freivalds, R.V. (1972), On the prediction of general recursive functions, Soviet Math. Dokl., 13, 1224\u20131228.","journal-title":"Soviet Math. Dokl."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"Blum, L., and Blum, M., (1975), Toward a mathematical theory of inductive inference, Information and Control, 28, 125\u2013155.","journal-title":"Information and Control"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"Case, J., and Smith, C.H. (1983), Comparison of identification criteria for machine inductive inference, Theoretical Computer Science, 25, 193\u2013220.","journal-title":"Theoretical Computer Science"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"R. Daley, and B. Kalyanasundaram, Capabilities of Probabilistic Learners with Bounded Mind Changes, In Proceedings of the 1993 Workshop on Computational Learning Theory, 1993, 182\u2013191.","DOI":"10.1145\/168304.168329"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"R. Daley, and B. Kalyanasundaram, Use of reduction arguments in determining Popperian FINite learning capabilities, In Proceedings of Algorithmic Learning Theory, 1993, 173\u2013186.","DOI":"10.1007\/3-540-57370-4_46"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"R. Daley, and B. Kalyanasundaram, Probabilistic and Pluralistic Learners with Mind Changes, In Proceedings of Mathematical Foundations of Computer Science, 1992, 218\u2013226.","DOI":"10.1007\/3-540-55808-X_20"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"R. Daley, B. Kalyanasundaram, and M. Velauthapillai, Breaking the probability 1\/2 barrier in FIN-type learning, In Proceedings of the 1992 Workshop on Computational Learning Theory, 1992, 203\u2013217.","DOI":"10.1145\/130385.130408"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"R. Daley, L. Pitt, M. Velauthapillai, and T. Will, Relations between probabilistic and team one-shot learners, In Proceedings of the 1991 Workshop on Computational Learning Theory, 1991, 228\u2013239.","DOI":"10.1016\/B978-1-55860-213-7.50024-9"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/S0019-9958(86)80042-0","volume":"69","author":"R.P. Daley","year":"1986","unstructured":"Daley, R.P., and Smith, C.H. (1986), On the complexity of inductive inference, Information and Control. 69, 12\u201340.","journal-title":"Information and Control."},{"key":"15_CR13","volume-title":"Finite Identification of General Recursive Functions by Probabilistic Strategies","author":"R.V. Freivalds","year":"1979","unstructured":"R.V. Freivalds, Finite Identification of General Recursive Functions by Probabilistic Strategies, Akademie Verlag, Berlin, 1979."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0890-5401(89)90005-9","volume":"82","author":"R.V. Freivalds","year":"1989","unstructured":"R.V. Freivalds, C.H. Smith, and M. Velauthapillai, Trade-off among Parameters Affecting Inductive Inference, Information and Computation (1989), 82, 323\u2013349.","journal-title":"Information and Computation"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"Gold, E. M., Learning Identification in the Limit, Information and Control, vol 10, 1967, pp. 447\u2013474.","journal-title":"Information and Control"},{"key":"15_CR16","first-page":"465","volume":"17","author":"K. P. Jantke","year":"1981","unstructured":"Jantke, K. P. and Beick, H. R. (1981), Combining postulates of naturalness in inductive inference, Electron. Inform. Kebernet. 17, 465\u2013484.","journal-title":"Electron. Inform. Kebernet."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"S. Jain, and A. Sharma, Finite learning by a team, In Proceedings of the 1990 Workshop on Computational Learning Theory, 1990, 163\u2013177.","DOI":"10.1016\/B978-1-55860-146-8.50016-3"},{"key":"15_CR18","volume-title":"An Introduction to General Theory of Algorithms","author":"M. Machtey","year":"1978","unstructured":"Machtey, M., and Young, P. (1978), An Introduction to General Theory of Algorithms, North-Holland, New York."},{"issue":"2","key":"15_CR19","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/62044.62053","volume":"36","author":"L. Pitt","year":"1989","unstructured":"L. Pitt, Probabilistic inductive inference, J. ACM 36(2), 1989, 383\u2013433.","journal-title":"J. ACM"},{"issue":"1","key":"15_CR20","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(1), 1988, 77\u201392.","journal-title":"Information and Computation"},{"key":"15_CR21","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1145\/322344.322356","volume":"29","author":"C. H. Smith","year":"1982","unstructured":"C. H. Smith, The Power of Pluralism for Automatic Program Synthesis, Journal of the Association for Computing Machinery, vol 29, 1982, pp. 1144\u20131165.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"15_CR22","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1987","unstructured":"L. G. Valiant, A theory of Learnable, Communications of the ACM, vol 27, 1987, pp.1134\u20131142.","journal-title":"Communications of the ACM"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"R. Wiehagen, R. Freivalds, and E. Kinber, On the power of probabilistic strategies in inductive inference. Theoretical Computer Science, 1984, 111\u2013113.","DOI":"10.1016\/0304-3975(83)90067-1"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60454-5_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:59:23Z","timestamp":1605646763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60454-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540604549","9783540474708"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-60454-5_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}