{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T19:44:26Z","timestamp":1747424666449},"reference-count":30,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1977,6,1]],"date-time":"1977-06-01T00:00:00Z","timestamp":233971200000},"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":13195,"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":[[1977,6]]},"DOI":"10.1016\/0304-3975(77)90015-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"301-319","source":"Crossref","is-referenced-by-count":11,"title":["On the inference of optimal descriptions"],"prefix":"10.1016","volume":"4","author":[{"given":"Robert","family":"Daley","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(77)90015-9_BIB1","first-page":"1251","article-title":"Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set","volume":"9","author":"Barzdin","year":"1968","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(77)90015-9_BIB2","series-title":"Frontiers of Pattern Recognition","first-page":"31","article-title":"A Survey of Results in Grammatical Inference","author":"Bierman","year":"1972"},{"key":"10.1016\/0304-3975(77)90015-9_BIB3","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(77)90015-9_BIB4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","article-title":"Toward a mathematical theory of inductive inference","volume":"28","author":"Blum","year":"1975","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(77)90015-9_BIB5","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","article-title":"On the length of programs for computing finite binary sequences","volume":"13","author":"Chaitin","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(77)90015-9_BIB6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0022-0000(74)80004-8","article-title":"The extent and density of sequences within the minimal-program complexity hierarchies","volume":"9","author":"Daley","year":"1974","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(77)90015-9_BIB7","doi-asserted-by":"crossref","first-page":"626","DOI":"10.2307\/2272040","article-title":"Non-complex sequences: Characterizations and examples","volume":"41","author":"Daley","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(77)90015-9_BIB8","first-page":"585","article-title":"Equi-informational sequences","author":"Daley","year":"1972","journal-title":"Proc. 6th Ann. Princeton Conf. Information Sci. Systems"},{"key":"10.1016\/0304-3975(77)90015-9_BIB9","first-page":"552","article-title":"On the learning of non-recursive sequences","author":"Daley","year":"1973","journal-title":"Proc. 7th Ann. Princeton Conf. Information Sci. Systems"},{"key":"10.1016\/0304-3975(77)90015-9_BIB10","first-page":"121","article-title":"On the inference of optimal descriptions","author":"Daley","year":"1975","journal-title":"Proc. Conf. Information Sci. Systems"},{"key":"10.1016\/0304-3975(77)90015-9_BIB11","first-page":"215","article-title":"The Process complexity and the understanding of sequences","author":"Daley","year":"1973","journal-title":"Proc. Conf. Math. Found. Comput. Sci."},{"key":"10.1016\/0304-3975(77)90015-9_BIB12","unstructured":"R. Daley, On the simplicity of busy beaver sets, Zeit. Math. Logik u. Grund. Math. (to appear)."},{"key":"10.1016\/0304-3975(77)90015-9_BIB13","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":"Information and Control"},{"key":"10.1016\/0304-3975(77)90015-9_BIB14","first-page":"3","article-title":"Three approaches for defining the concept of information quantity","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Information Transmission"},{"key":"10.1016\/0304-3975(77)90015-9_BIB15","first-page":"1413","article-title":"On the Notion of Random Sequence","volume":"14","author":"Levin","year":"1973","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(77)90015-9_BIB16","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/S0019-9958(69)90538-5","article-title":"A variant of the Kolmogorov concept of complexity","volume":"4","author":"Loveland","year":"1969","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(77)90015-9_BIB17","doi-asserted-by":"crossref","first-page":"603","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":"Information and Control"},{"key":"10.1016\/0304-3975(77)90015-9_BIB18","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1016\/S0019-9958(69)90323-4","article-title":"On the problem of finding minimal-programs for tables","volume":"14","author":"Pager","year":"1969","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(77)90015-9_BIB19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/321812.321816","article-title":"Further results on the problem of finding minimal length programs for decision tables","volume":"21","author":"Pager","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(77)90015-9_BIB20","series-title":"Proc. Symp. Math. Theory Automata","first-page":"75","article-title":"On a simple source for non-computable functions","volume":"XII","author":"Rado","year":"1962"},{"key":"10.1016\/0304-3975(77)90015-9_BIB21","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(77)90015-9_BIB22","article-title":"Zuf\u00e4lligkeit und Warscheinlichkeit","volume":"No. 218","author":"Schnorr","year":"1971"},{"key":"10.1016\/0304-3975(77)90015-9_BIB23","first-page":"276","article-title":"The process complexity and effective random tests","volume":"7","author":"Schnorr","year":"1973","journal-title":"JCSS"},{"key":"10.1016\/0304-3975(77)90015-9_BIB24","article-title":"A review of the theory of random sequences","author":"Schnorr","year":"1975","journal-title":"Proc. 5th Int. Congress of Logic, Methodology and Philosophy of Science"},{"key":"10.1016\/0304-3975(77)90015-9_BIB25","series-title":"Fachbereich Mathematik","article-title":"General random sequences and the concept of learnable sequences","author":"Schnorr","year":"1975"},{"key":"10.1016\/0304-3975(77)90015-9_BIB26","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1145\/321832.321841","article-title":"Iterated limiting recursion and the program minimization problem","volume":"21","author":"Schubert","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(77)90015-9_BIB27","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1086\/288559","article-title":"Does scientific discovery have a logic?","volume":"40","author":"Simon","year":"1973","journal-title":"Philosophy of Science"},{"key":"10.1016\/0304-3975(77)90015-9_BIB28","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1037\/h0033118","article-title":"Complexity and the representation of patterned sequences of symbols","volume":"79","author":"Simon","year":"1972","journal-title":"Psychological Review"},{"key":"10.1016\/0304-3975(77)90015-9_BIB29","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":"Information and Control"},{"key":"10.1016\/0304-3975(77)90015-9_BIB30","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","article-title":"Complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms","volume":"25","author":"Zvonkia","year":"1970","journal-title":"Russian Math. Surveys"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397577900159?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397577900159?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:21:58Z","timestamp":1555125718000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397577900159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,6]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1977,6]]}},"alternative-id":["0304397577900159"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(77)90015-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1977,6]]}}}