{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:31Z","timestamp":1725664951199},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540635772"},{"type":"electronic","value":"9783540696025"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63577-7_47","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:32:09Z","timestamp":1330299129000},"page":"244-259","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Effects of Kolmogorov complexity present in inductive inference as well"],"prefix":"10.1007","author":[{"given":"Andris","family":"Ambainis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kalvis","family":"Aps\u012btis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristian","family":"Calude","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomas","family":"Larfeldt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iveta","family":"Sala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juris","family":"Smotrovs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/3-540-58520-6_50","volume":"872","author":"A. Ambainis","year":"1994","unstructured":"A. Ambainis and J.Smotrovs, Enumerable classes of total recursive functions: complexity of inductive inference. Proceedings of the AII'94, Lecture Notes in Computer Science, 872 (1994), pp. 10\u201325","journal-title":"Proceedings of the AII'94, Lecture Notes in Computer Science"},{"key":"17_CR2","first-page":"133","volume-title":"On the frequency solution of the membership problem for recursively enumerable sets","author":"J. B\u0101rzdi\u0146\u0161","year":"1973","unstructured":"J. B\u0101rzdi\u0146\u0161. On the frequency solution of the membership problem for recursively enumerable sets. Trudi of V.A.Steklov Mathematics Institute, Moscow, 1973, pp. 133\u2013160"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"L. Blum and M.Blum, Towards a mathematical theory of inductive inference, Information and Control, 28 (1975), pp.122\u2013155","journal-title":"Information and Control"},{"key":"17_CR4","first-page":"1224","volume":"13","author":"J. B\u0101rzi\u0146\u0161","year":"1972","unstructured":"J. B\u0101rzi\u0146\u0161 and R. Freivalds. On the prediction of general recursive functions. Soviet Math. Doklady, 13 (1972), pp.1224\u20131228.","journal-title":"Soviet Math. Doklady"},{"key":"17_CR5","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, C. Smith, Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25 (1983), pp.193\u2013220","journal-title":"Theoretical Computer Science"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BFb0019358","volume":"502","author":"R. Freivalds","year":"1991","unstructured":"R. Freivalds, J. B\u0101rzdi\u0146\u0161, K. Podnieks. Inductive inference of recursive functions: complexity bounds. Baltic Computer Science. Lecture Notes in Computer Science, 502 (1991), pp.111\u2013155.","journal-title":"Baltic Computer Science. Lecture Notes in Computer Science"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/09528139408953781","volume":"6","author":"R. Freivalds","year":"1994","unstructured":"R. Freivalds and A.C. Hoffman. An inductive inference approach to classification. Journal of Experimental and Theoretical Artificial Inteligence, 6 (1994), pp.63\u201372.","journal-title":"Journal of Experimental and Theoretical Artificial Inteligence"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1006\/inco.1993.1068","volume":"107","author":"R. Freivalds","year":"1993","unstructured":"R. Freivalds, C. H. Smith, The role of procrastination in machine learning. Information and Computation, vol. 107 (1993), pp. 237\u2013271","journal-title":"Information and Computation"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"28","DOI":"10.2307\/2270580","volume":"30","author":"E.M. Gold","year":"1965","unstructured":"E.M.Gold, Limiting recursion. Journal of Symbolic Logic, 30 (1965), pp.28\u201348","journal-title":"Journal of Symbolic Logic"},{"key":"17_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 (1967), pp.447\u2013474","journal-title":"Information and Control"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Efim Kinber and Frank Stephan. Language learning from texts: mind changes, limited memory and monotonicity. Proc. 8th Annu. Conf. on Comput. Learning Theory,ACM Press, New York, NY, pp. 182\u2013189, 1995","DOI":"10.1145\/225298.225320"},{"issue":"1","key":"17_CR12","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"A.N. Kolmogorov, Three approaches to the quantitative definition of information. Problems of Information Transmission, vol. 1, No. 1, 1965, pp.1\u20137.","journal-title":"Problems of Information Transmission"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/3-540-59119-2_173","volume":"904","author":"S. Lange","year":"1995","unstructured":"S. Lange, T. Zeugmann, Trading monotonicity demands versus mind changes. Proceedings of EuroCOLT'95, Lecture Notes in Computer Science, vol. 904 (1995), pp. 125\u2013139","journal-title":"Proceedings of EuroCOLT'95, Lecture Notes in Computer Science"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"M. Li, P. Vitanyi, Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag, 1993","DOI":"10.1007\/978-1-4757-3860-5"},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P. Martin-L\u00f6f","year":"1966","unstructured":"P. Martin-L\u00f6f. On the definition of random sequence. Information and Control, 9 (1966), pp.602\u2013619","journal-title":"Information and Control"},{"key":"17_CR16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H. Rogers Jr.","year":"1958","unstructured":"H. Rogers, Jr. G\u00f6del numberings of partial recursive functions. Journal of Symbolic Logic, 23:331\u2013341, 1958","journal-title":"Journal of Symbolic Logic"},{"key":"17_CR17","unstructured":"H. Rogers, Jr. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967. Reprinted, MIT Press, 1987"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"R. Soare, Recursively Enumerable Sets and Degrees. Springer-Verlag, 1987 *** DIRECT SUPPORT *** A0008157 00005","DOI":"10.1007\/978-3-662-02460-7"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63577-7_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:25:22Z","timestamp":1558268722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63577-7_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635772","9783540696025"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-63577-7_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}