{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T10:53:00Z","timestamp":1679482380334},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1974,10,1]],"date-time":"1974-10-01T00:00:00Z","timestamp":149817600000},"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":14169,"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":[[1974,10]]},"DOI":"10.1016\/s0022-0000(74)80004-8","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T04:46:40Z","timestamp":1289364400000},"page":"151-163","source":"Crossref","is-referenced-by-count":14,"title":["The extent and density of sequences within the minimal-program complexity hierarchies"],"prefix":"10.1016","volume":"9","author":[{"given":"R.P.","family":"Daley","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80004-8_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\/S0022-0000(74)80004-8_bib2","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. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80004-8_bib3","unstructured":"M. Blum, Subcreative sets and the complexity of algorithms, Preprint."},{"key":"10.1016\/S0022-0000(74)80004-8_bib4","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/321784.321794","article-title":"An example of information and computation resource trade-off","volume":"20","author":"Daley","year":"1973","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80004-8_bib5","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0019-9958(73)80001-4","article-title":"Minimal-program complexity of sequences with restricted resources","volume":"23","author":"Daley","year":"1973","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(74)80004-8_bib6","first-page":"700","article-title":"On the decision complexity of algorithms","volume":"10","author":"Kanovi\u010d","year":"1969","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0022-0000(74)80004-8_bib7","first-page":"720","article-title":"On the complexity of Boolean function minimization","volume":"12","author":"Kanovi\u010d","year":"1971","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0022-0000(74)80004-8_bib8","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\/S0022-0000(74)80004-8_bib9","series-title":"Proc. ACM Symposium on Theory of Computing","first-page":"61","article-title":"Minimal-program complexity measures","author":"Loveland","year":"1969"},{"key":"10.1016\/S0022-0000(74)80004-8_bib10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/malq.19660120125","article-title":"Classes of R.E. sets of degrees of unsolvability","volume":"12","author":"Martin","year":"1966","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/S0022-0000(74)80004-8_bib11","author":"Rogers","year":"1967"},{"key":"10.1016\/S0022-0000(74)80004-8_bib12","series-title":"Proc. International Federation for Information Processing Congress","first-page":"12","article-title":"Optimal G\u00f6del Numberings","author":"Schnorr","year":"1972"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800048?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800048?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T18:52:10Z","timestamp":1544122330000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,10]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1974,10]]}},"alternative-id":["S0022000074800048"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80004-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,10]]}}}