{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T03:37:45Z","timestamp":1703216265291},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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":4034,"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":[[2002,7]]},"DOI":"10.1016\/s0304-3975(01)00086-x","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T12:10:37Z","timestamp":1034338237000},"page":"161-180","source":"Crossref","is-referenced-by-count":8,"title":["Avoiding coding tricks by hyperrobust learning"],"prefix":"10.1016","volume":"284","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":"78","reference":[{"key":"10.1016\/S0304-3975(01)00086-X_BIB1","unstructured":"J. B\u0101rzdi\u0146\u0161, Two theorems on the limiting synthesis of functions, in: Theory of Algorithms and Programs, Latvian State University, Riga, Vol. 210, 1974, pp. 82\u201388."},{"key":"10.1016\/S0304-3975(01)00086-X_BIB2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","article-title":"Towards a mathematical theory of inductive inference","volume":"28","author":"Blum","year":"1975","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(01)00086-X_BIB3","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/jcss.1999.1637","article-title":"Robust learning aided by context","volume":"60","author":"Case","year":"2000","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/S0304-3975(01)00086-X_BIB4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/jcss.1997.1508","article-title":"Learning recursive functions from approximations","volume":"55","author":"Case","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(01)00086-X_BIB5","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(01)00086-X_BIB6","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/S0019-9958(72)90424-X","article-title":"Some decidability results on grammatical inference and complexity","volume":"20","author":"Feldmann","year":"1972","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(01)00086-X_BIB7","doi-asserted-by":"crossref","unstructured":"M. Fulk, Robust separations in inductive inference, in: Proc. 31st Ann. Symp. on Foundations of Computer Science (FOCS), St. Louis, Missouri, 1990, pp. 405\u2013410.","DOI":"10.1109\/FSCS.1990.89560"},{"key":"10.1016\/S0304-3975(01)00086-X_BIB8","unstructured":"S. Jain, Robust behaviourally correct learning, Technical Report TRA6\/98 at the DISCS, National University of Singapore, 1998."},{"key":"10.1016\/S0304-3975(01)00086-X_BIB9","series-title":"Systems that Learn, 2nd Edition [of 14]","author":"Jain","year":"1999"},{"key":"10.1016\/S0304-3975(01)00086-X_BIB10","doi-asserted-by":"crossref","unstructured":"S. Jain, C. Smith, R. Wiehagen, On the power of learning robustly, in: Proc. 11th Ann. Conf. on Computational Learning Theory (COLT), ACM Press, New York, 1998, pp. 187\u2013197.","DOI":"10.1145\/279943.279982"},{"key":"10.1016\/S0304-3975(01)00086-X_BIB11","doi-asserted-by":"crossref","unstructured":"W. Merkle, F. Stephan, Trees and learning, in: Proc. 9th Ann. Conf. on Computational Learning Theory (COLT), ACM Press, New York, 1996, pp. 270\u2013279.","DOI":"10.1145\/238061.238118"},{"key":"10.1016\/S0304-3975(01)00086-X_BIB12","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0304-3975(76)90087-6","article-title":"Some natural properties of strong-identification in inductive inference","volume":"2","author":"Minicozzi","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00086-X_BIB13","series-title":"Classical Recursion Theory I and II","author":"Odifreddi","year":"1989"},{"key":"10.1016\/S0304-3975(01)00086-X_BIB14","series-title":"Systems that Learn","author":"Osherson","year":"1986"},{"key":"10.1016\/S0304-3975(01)00086-X_BIB15","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/62044.62053","article-title":"Probablistic inductive inference","volume":"36","author":"Pitt","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(01)00086-X_BIB16","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":"1998","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00086-X_BIB17","unstructured":"K. Podnieks, Comparing various concepts of function prediction, Part 1. Theory of Algorithms and Programs, Latvian State University, Riga, Vol. 210, 1974, pp. 68\u201381."},{"key":"10.1016\/S0304-3975(01)00086-X_BIB18","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. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(01)00086-X_BIB19","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/malq.19840300906","article-title":"On the nonboundability of total effective operators","volume":"30","author":"Zeugmann","year":"1984","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/S0304-3975(01)00086-X_BIB20","series-title":"Proc. Internat. Workshop on Analogical and Inductive Inference (AII\u201986)","first-page":"220","article-title":"On B\u0101rzdi\u0146\u0161\u2019 conjecture","volume":"Vol. 265","author":"Zeugmann","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100086X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100086X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T07:55:27Z","timestamp":1554969327000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750100086X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S030439750100086X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00086-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}