{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:47:37Z","timestamp":1725482857285},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657019"},{"type":"electronic","value":"9783540490975"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49097-3_15","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T10:32:28Z","timestamp":1175769148000},"page":"183-197","source":"Crossref","is-referenced-by-count":2,"title":["Avoiding Coding Tricks by Hyperrobust Learning"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Ott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,11,19]]},"reference":[{"key":"15_CR1","first-page":"82","volume":"210","author":"J. B\u0101rzdi\u0146\u0161","year":"1974","unstructured":"Janis B\u0101rzdi\u0146\u0161. Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs, Latvian State University, Riga, 210:82\u201388, 1974.","journal-title":"In Theory of Algorithms and Programs"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"Leonard Blum and Manuel Blum. Towards a mathematical theory of inductive inference. Information and Control, 28:125\u2013155, 1975.","journal-title":"Information and Control"},{"key":"15_CR3","first-page":"44","volume-title":"Robust learning aided by context","author":"J. Case","year":"1998","unstructured":"John Case, Sanjay Jain, Matthias Ott, Arun Sharma and Frank Stephan. Robust learning aided by context. In Proceedings of Eleventh Annual Conference on Computational Learning Theory (COLT), pages 44\u201355, ACM Press, New York, 1998."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jcss.1997.1508","volume":"55","author":"J. Case","year":"1997","unstructured":"John Case, Susanne Kaufmann, Efim Kinber and Martin Kummer. Learning recursive functions from approximations. Journal of Computer and System Sciences, 55:183\u2013196, 1997.","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"John Case and Carl Smith. Comparison of identi_cation criteria for machine inductive inference. Theoretical Computer Science, 25:193\u2013220, 1983.","journal-title":"Theoretical Computer Science"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/S0019-9958(72)90424-X","volume":"20","author":"J. Feldmann","year":"1972","unstructured":"Jerome Feldmann. Some decidability results on grammatical inference and complexity. Information and Control, 20:244\u2013262, 1972.","journal-title":"Information and Control"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Marc Fulk. Robust separations in inductive inference. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS), pages 405\u2013410, St. Louis, Missouri, 1990.","DOI":"10.1109\/FSCS.1990.89560"},{"key":"15_CR8","first-page":"187","volume-title":"On the power of learning robustly","author":"S. Jain","year":"1998","unstructured":"Sanjay Jain, Carl Smith and Rolf Wiehagen. On the power of learning robustly. In Proceedings of Eleventh Annual Conference on Computational Learning Theory (COLT), pages 187\u2013197, ACM Press, New York, 1998."},{"key":"15_CR9","first-page":"270","volume-title":"Trees and learning","author":"W. Merkle","year":"1996","unstructured":"Wolfgang Merkle and Frank Stephan. Trees and learning. Proceedings of the Ninth Annual Conference on Computational Learning Theory (COLT), pages 270\u2013279, ACM Press, New York, 1996."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0304-3975(76)90087-6","volume":"2","author":"E. Minicozzi","year":"1976","unstructured":"Eliana Minicozzi. Some natural properties of strong-identification in inductive inference. Theoretical Computer Science, 2:345\u2013360, 1976.","journal-title":"Theoretical Computer Science"},{"key":"15_CR11","unstructured":"Piergiorgio Odifreddi. Classical Recursion Theory. North-Holland, Amsterdam, 1989."},{"key":"15_CR12","volume-title":"Systems that Learn","author":"D. Osherson","year":"1986","unstructured":"Daniel Osherson, Michael Stob and Scott Weinstein. Systems that Learn. MIT Press, Cambridge, Massachusetts, 1986."},{"key":"15_CR13","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/62044.62053","volume":"36","author":"L. Pitt","year":"1989","unstructured":"Lenny Pitt. Probablistic inductive inference. Journal of the Association of Computing Machinery, 36:383\u2013433, 1989.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0890-5401(88)90046-6","volume":"77","author":"L. Pitt","year":"1998","unstructured":"Lenny Pitt and Carl Smith. Probability and plurality for aggregations of learning machines. Information and Computation, 77:77\u201392, 1998.","journal-title":"Information and Computation"},{"key":"15_CR15","first-page":"68","volume":"210","author":"K. Podnieks","year":"1974","unstructured":"Karlis Podnieks. Comparing various concepts of function prediction, Part 1. Theory of Algorithms and Programs, Latvian State University, Riga, 210:68\u201381, 1974.","journal-title":"Theory of Algorithms and Programs"},{"key":"15_CR16","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1145\/322344.322356","volume":"29","author":"C. Smith","year":"1982","unstructured":"Carl Smith. The power of pluralism for automatic program synthesis Journal of the Association of Computing Machinery, 29:1144\u20131165, 1982.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"15_CR17","series-title":"Lect Notes Comput Sci","first-page":"220","volume-title":"Proceedings of the International Workshop on Analogical and Inductive Inference (AII\u201986)","author":"T. Zeugmann","year":"1986","unstructured":"Thomas Zeugmann. On B\u0101rzdi\u0146\u0161\u2019 conjecture. In K.P. Jantke, editor, Proceedings of the International Workshop on Analogical and Inductive Inference (AII\u201986), volume 265 of LNCS, pages 220\u2013227. Springer, 1986."}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49097-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:26:00Z","timestamp":1550305560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49097-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657019","9783540490975"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-49097-3_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}