{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:42:31Z","timestamp":1649130151676},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,6,1]],"date-time":"1980-06-01T00:00:00Z","timestamp":328665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":12100,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1980,6]]},"DOI":"10.1016\/s0019-9958(80)90615-4","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"236-244","source":"Crossref","is-referenced-by-count":1,"title":["Quantitative and qualitative information in computations"],"prefix":"10.1016","volume":"45","author":[{"given":"Robert P.","family":"Daley","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(80)90615-4_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\/S0019-9958(80)90615-4_bib2","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. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(80)90615-4_bib3","first-page":"139","article-title":"Program size, oracles, and the jump operation","volume":"14","author":"Chaitin","year":"1977","journal-title":"Osaka J. Math."},{"key":"10.1016\/S0019-9958(80)90615-4_bib4","series-title":"technical Report No. 71-28","article-title":"Minimal-Program Complexity of Pseudo-Recursive and Pseudo-Random Sequences","author":"Daley","year":"1971"},{"key":"10.1016\/S0019-9958(80)90615-4_bib5","series-title":"Quarterly Report No. 32","article-title":"Equi-Informational Sequences, Oracle program Complexity and the Halting Problem","author":"Daley","year":"1972"},{"key":"10.1016\/S0019-9958(80)90615-4_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. System Sci."},{"key":"10.1016\/S0019-9958(80)90615-4_bib7","doi-asserted-by":"crossref","first-page":"626","DOI":"10.2307\/2272040","article-title":"Noncomplex sequences: characterizations and examples","volume":"41","author":"Daley","year":"1977","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0019-9958(80)90615-4_bib8","series-title":"Proceeding 18th Symp. on Found. of Comp. Sci.","first-page":"82","article-title":"Several results in program size complexity","author":"Katsef","year":"1977"},{"key":"10.1016\/S0019-9958(80)90615-4_bib9","first-page":"3","article-title":"Three approaches for defining the concept of information quantity","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Inform. Transmission"},{"key":"10.1016\/S0019-9958(80)90615-4_bib10","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/malq.19660120124","article-title":"A new interpretation of the von Mises, concept of random sequence","volume":"12","author":"Loveland","year":"1966","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/S0019-9958(80)90615-4_bib11","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":"15","author":"Loveland","year":"1969","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(80)90615-4_bib12","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/malq.19660120125","article-title":"Classes of recursively enumerable sets and degrees of unsolvability","volume":"12","author":"Martin","year":"1966","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/S0019-9958(80)90615-4_bib13","article-title":"Zuf\u00e4lligkeit und Wahhrscheinlichkeit","author":"Schnorr","year":"1971"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995880906154?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995880906154?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T13:53:36Z","timestamp":1548942816000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995880906154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,6]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,6]]}},"alternative-id":["S0019995880906154"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(80)90615-4","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1980,6]]}}}