{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T02:26:40Z","timestamp":1773714400416,"version":"3.50.1"},"reference-count":52,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":7777,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0022-0000(92)90026-f","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"343-384","source":"Crossref","is-referenced-by-count":35,"title":["Inductive reasoning and kolmogorov complexity"],"prefix":"10.1016","volume":"44","author":[{"given":"Ming","family":"Li","sequence":"first","affiliation":[]},{"given":"Paul","family":"M.B. Vit\u00e1nyi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90026-F_BIB1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for hamiltonian circuits and matchings","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90026-F_BIB2","first-page":"239","article-title":"Inductive inference: Theory and methods","volume":"16","author":"Angluin","year":"1983","journal-title":"Comput. Surveys"},{"key":"10.1016\/0022-0000(92)90026-F_BIB3","series-title":"Epicurus Scientific Method","author":"Asmis","year":"1984"},{"key":"10.1016\/0022-0000(92)90026-F_BIB4_1","first-page":"376","article-title":"An essay towards solving a problem in the doctrine of chances","volume":"53","author":"Bayes","year":"1763","journal-title":"Philos. Trans. Roy. Soc."},{"key":"10.1016\/0022-0000(92)90026-F_BIB4_2","first-page":"298","article-title":"An essay towards solving a problem in the doctrine of chances","volume":"54","author":"Bayes","year":"1764","journal-title":"Philos. Trans. Roy. Soc."},{"key":"10.1016\/0022-0000(92)90026-F_BIB5","series-title":"Proceedings, ACM Workshop on Computational Learning Theory","first-page":"196","article-title":"The power of vacillation","author":"Case","year":"1988"},{"key":"10.1016\/0022-0000(92)90026-F_BIB6","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\/0022-0000(92)90026-F_BIB7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/321495.321506","article-title":"On the length of programs for computing finite binary sequences: Statistical considerations","volume":"16","author":"Chaitin","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90026-F_BIB8","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","article-title":"A theory of program size formally identical to information theory","volume":"22","author":"Chaitin","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90026-F_BIB9","article-title":"Universal Gambling Schemes and the Complexity Measures of Kolmogorov and Chaitin","author":"Cover","year":"1974"},{"key":"10.1016\/0022-0000(92)90026-F_BIB10","series-title":"The Impact of Processing Techniques on Communications","first-page":"23","article-title":"Kolmogorov complexity, data compression and inference","author":"Cover","year":"1985"},{"key":"10.1016\/0022-0000(92)90026-F_BIB11","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1109\/TIT.1986.1057237","article-title":"Maximal entropy as special case of the minimum length description criterion","volume":"IT-32","author":"Feder","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0022-0000(92)90026-F_BIB12","series-title":"An Introduction to Probability Theory and Its Applications","author":"Feller","year":"1968"},{"key":"10.1016\/0022-0000(92)90026-F_BIB13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1098\/rsta.1922.0009","article-title":"On the mathematical foundations of theoretical statistics","volume":"222","author":"Fisher","year":"1933","journal-title":"Philos. Trans. Roy. Soc. London Ser. A"},{"key":"10.1016\/0022-0000(92)90026-F_BIB14","series-title":"Information Theory and Reliable Communication","author":"Gallager","year":"1968"},{"key":"10.1016\/0022-0000(92)90026-F_BIB15","series-title":"11th International Joint Conference on Artificial Intelligence","first-page":"843","article-title":"An application of minimum description length principle to online recognition of handprinted alphanumerals","author":"Gao","year":"1989"},{"key":"10.1016\/0022-0000(92)90026-F_BIB16","series-title":"Teoria motus corporum coelestium in sectionibus conicus solem ambientum, 1809","author":"Gauss","year":"1963"},{"key":"10.1016\/0022-0000(92)90026-F_BIB17","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(92)90026-F_BIB18","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","article-title":"Complexity of automaton identification from given data","volume":"37","author":"Gold","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(92)90026-F_BIB19","unstructured":"P. G\u00e1cs, personal communication."},{"key":"10.1016\/0022-0000(92)90026-F_BIB20_1","first-page":"1477","article-title":"On the symmetry of algorithmic information","volume":"15","author":"G\u00e1cs","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0022-0000(92)90026-F_BIB20_2","first-page":"1480","article-title":"On the symmetry of algorithmic information","volume":"15","author":"G\u00e1cs","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0022-0000(92)90026-F_BIB21","author":"Ga\u0107s","year":"1987"},{"key":"10.1016\/0022-0000(92)90026-F_BIB22","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/TSSC.1968.300117","article-title":"Prior probabilities","volume":"SSC-4","author":"Jaynes","year":"1968","journal-title":"IEEE Trans. Systems Sci. Cybernet."},{"key":"10.1016\/0022-0000(92)90026-F_BIB23","first-page":"939","article-title":"On the rationale of maximum entropy methods","volume":"70","author":"Jaynes","year":"1982"},{"key":"10.1016\/0022-0000(92)90026-F_BIB24","author":"Jaynes","year":"1989"},{"key":"10.1016\/0022-0000(92)90026-F_BIB25","series-title":"Theory of Probability","author":"Jeffreys","year":"1961"},{"key":"10.1016\/0022-0000(92)90026-F_BIB26","doi-asserted-by":"crossref","first-page":"391","DOI":"10.2307\/2182878","article-title":"The use of simplicity in induction","volume":"62","author":"Kemeny","year":"1953","journal-title":"Philos. Rev."},{"issue":"No. 1","key":"10.1016\/0022-0000(92)90026-F_BIB27","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0022-0000(92)90026-F_BIB28","first-page":"1","article-title":"On the logical foundations of information theory and probability theory","volume":"5","author":"Kolmogorov","year":"1969","journal-title":"Problems Inform. Transmission"},{"issue":"No. 4","key":"10.1016\/0022-0000(92)90026-F_BIB29","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1070\/RM1983v038n04ABEH004203","article-title":"Combinatorial foundations of information theory and the calculus of probabilities","volume":"38","author":"Kolmogorov","year":"1983","journal-title":"Russian Math. Surveys"},{"key":"10.1016\/0022-0000(92)90026-F_BIB30","series-title":"A Philosophical Essay on Probabilities","author":"Laplace","year":"1951"},{"key":"10.1016\/0022-0000(92)90026-F_BIB31","first-page":"1413","article-title":"On the notion of a random sequence","volume":"14","author":"Levin","year":"1973","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0022-0000(92)90026-F_BIB32","first-page":"206","article-title":"Laws of information conservation (non-growth) and aspects of the foundation of probability theory","volume":"10","author":"Levin","year":"1974","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0022-0000(92)90026-F_BIB33","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1137\/0220056","article-title":"Learning simple concepts under simple distributions","volume":"20","author":"Li","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90026-F_BIB34","series-title":"Proc. 3rd IEEE Conference on Structure in Complexity Theory","first-page":"80","article-title":"Two decades of applied Kolmogotov complexity","author":"Li","year":"1988"},{"key":"10.1016\/0022-0000(92)90026-F_BIB35","series-title":"Proceedings, 30th IEEE Symposium on Foundations of Computer Science","first-page":"34","article-title":"A theory of learning simple concepts under simple distributions and average case complexity for the universal distribution","author":"Li","year":"1989"},{"key":"10.1016\/0022-0000(92)90026-F_BIB36","first-page":"187","article-title":"Kolmogorov complexity and its applications","author":"Li","year":"1990"},{"key":"10.1016\/0022-0000(92)90026-F_BIB37","unstructured":"M. Li and P. M. B. Vit\u00e1nyi, \u201cAn Introduction to Kolmogorov Complexity and Its Applications,\u201d Addison-Wesley, Reading, MA, to appear."},{"key":"10.1016\/0022-0000(92)90026-F_BIB38","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"The definition of random sequences","volume":"9","author":"Martin-L\u00f6f","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(92)90026-F_BIB39_1","series-title":"Probability, Statistics and Truth","author":"Von Mises","year":"1939"},{"key":"10.1016\/0022-0000(92)90026-F_BIB39_2","series-title":"Probability, Statistics and Truth","author":"Von Mises","year":"1981"},{"key":"10.1016\/0022-0000(92)90026-F_BIB40","series-title":"Systems That Learn","author":"Osherson","year":"1986"},{"key":"10.1016\/0022-0000(92)90026-F_BIB41","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","article-title":"Computational limitations on learning from examples","volume":"35","author":"Pitt","year":"1989","journal-title":"J. Assoc. Comp. Mach."},{"key":"10.1016\/0022-0000(92)90026-F_BIB42","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","article-title":"Inferring decision trees using the minimum description length principle","volume":"80","author":"Quinlan","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0022-0000(92)90026-F_BIB43","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1214\/aos\/1176346150","article-title":"A universal prior for integers and estimation by minimum description length","volume":"11","author":"Rissanen","year":"1982","journal-title":"Ann. Statist."},{"key":"10.1016\/0022-0000(92)90026-F_BIB44_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(92)90026-F_BIB44_2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(92)90026-F_BIB45","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/TIT.1978.1055913","article-title":"Complexity-based induction systems: Comparisons and convergence theorems","volume":"IT-24","author":"Solomonoff","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0022-0000(92)90026-F_BIB46","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"},{"issue":"No. 8","key":"10.1016\/0022-0000(92)90026-F_BIB47","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1109\/29.31267","article-title":"Detection of the number of coherent signals by the MDL principle","volume":"ASSP-37","author":"Wax","year":"1989","journal-title":"IEEE Trans. Accoust. Speech Signal Proces."},{"issue":"No. 6","key":"10.1016\/0022-0000(92)90026-F_BIB48","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","article-title":"The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms","volume":"25","author":"Zvonkin","year":"1970","journal-title":"Russian Math. Surveys"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290026F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290026F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:56:57Z","timestamp":1550325417000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009290026F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["002200009290026F"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90026-f","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}