{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T11:54:58Z","timestamp":1778586898247,"version":"3.51.4"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1967,9,1]],"date-time":"1967-09-01T00:00:00Z","timestamp":-73699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T00:00:00Z","timestamp":1400112000000},"content-version":"vor","delay-in-days":17058,"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":[[1967,9]]},"DOI":"10.1016\/s0019-9958(67)90546-3","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T01:51:40Z","timestamp":1103075500000},"page":"257-265","source":"Crossref","is-referenced-by-count":109,"title":["On the size of machines"],"prefix":"10.1016","volume":"11","author":[{"given":"Manuel","family":"Blum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(67)90546-3_bib1","series-title":"Automata Theory","first-page":"6","article-title":"Speed-up theorems and incompleteness theorems in automata theory","author":"Arbib","year":"1966"},{"issue":"No. 3","key":"10.1016\/S0019-9958(67)90546-3_bib2","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1090\/S0002-9939-1965-0181538-0","article-title":"Machine dependence of degrees of difficulty","author":"Arbib","year":"1965","journal-title":"Proc. Am. Math. Soc. XVI"},{"issue":"No. 2","key":"10.1016\/S0019-9958(67)90546-3_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","author":"Blum","year":"1967","journal-title":"J. Assoc. Comp. Mach., XIV"},{"issue":"No. 4","key":"10.1016\/S0019-9958(67)90546-3_bib4","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","article-title":"On the length of programs for computing finite binary sequences","author":"Chaitin","year":"1966","journal-title":"J. Assoc. Comp. Mach., XIII"},{"key":"10.1016\/S0019-9958(67)90546-3_bib5","unstructured":"Chaitin, G., On the simplicity and speed of programs for computing infinite sets of natural numbers, J. Assoc. Comp. Mach., in press."},{"key":"10.1016\/S0019-9958(67)90546-3_bib6","series-title":"Computability and Unsolvability","author":"Davis","year":"1958"},{"issue":"No. 5","key":"10.1016\/S0019-9958(67)90546-3_bib7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Soc., CXVII"},{"key":"10.1016\/S0019-9958(67)90546-3_bib8","series-title":"Recursive Function Theory, Proceedings of the Symposia in Pure Mathematics","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1090\/pspum\/005\/0142452","article-title":"Size and structure of universal turing machines using tag systems","volume":"vol. V","author":"Minsky","year":"1962"},{"issue":"No. 3","key":"10.1016\/S0019-9958(67)90546-3_bib9","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","article-title":"G\u00d6del numberings of partial recursive functions","author":"Rogers","year":"1958","journal-title":"J. Symbol. Logic, XXIII"},{"key":"10.1016\/S0019-9958(67)90546-3_bib10","series-title":"Recursive functions and effective computability","author":"Rogers","year":"1968"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995867905463?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995867905463?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T09:53:26Z","timestamp":1548928406000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995867905463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1967,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1967,9]]}},"alternative-id":["S0019995867905463"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(67)90546-3","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1967,9]]}}}