{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T11:25:18Z","timestamp":1751887518403},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":11521,"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":[[1982,1]]},"DOI":"10.1016\/s0019-9958(82)80085-5","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T16:43:56Z","timestamp":1115397836000},"page":"52-67","source":"Crossref","is-referenced-by-count":4,"title":["Busy beaver sets: Characterizations and applications"],"prefix":"10.1016","volume":"52","author":[{"given":"Robert P.","family":"Daley","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(82)80085-5_bib1","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\/S0019-9958(82)80085-5_bib2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0019-9958(67)90546-3","article-title":"On the size of machines","volume":"11","author":"Blum","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/S0019-9958(82)80085-5_bib3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/malq.19780241303","article-title":"On the simplicity of busy beaver sets","volume":"24","author":"Daley","year":"1978","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/S0019-9958(82)80085-5_bib4","doi-asserted-by":"crossref","first-page":"460","DOI":"10.2307\/2273749","article-title":"Busy beaver sets and the degrees of unsolvability","volume":"46","author":"Daley","year":"1981","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0019-9958(82)80085-5_bib5","series-title":"Proceedings, Mathematical Foundations of Computer Science Symposium","first-page":"252","article-title":"Retraceability, repleteness, and busy beaver sets","author":"Daley","year":"1981"},{"key":"10.1016\/S0019-9958(82)80085-5_bib6","article-title":"Towards Modular Constructions in Degrees of Unsolvability","author":"Daley","year":"1980"},{"key":"10.1016\/S0019-9958(82)80085-5_bib7","series-title":"Proceedings, Mathematical Foundations of Computer Science Symposium","first-page":"259","article-title":"On the simplification of constructions in degrees of unsolvability","author":"Daley","year":"1979"},{"key":"10.1016\/S0019-9958(82)80085-5_bib8","first-page":"791","article-title":"A theorem on hypersimple sets","volume":"5","author":"Dekker","year":"1954"},{"key":"10.1016\/S0019-9958(82)80085-5_bib9","doi-asserted-by":"crossref","first-page":"513","DOI":"10.2307\/2272252","article-title":"The infinite injury priority method","volume":"41","author":"Soare","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0019-9958(82)80085-5_bib10","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/malq.19620080313","article-title":"Recursively enumerable sets and retracing functions","volume":"8","author":"Yates","year":"1962","journal-title":"Z. Math. Logik Grundlag. Math."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995882800855?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995882800855?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T12:54:59Z","timestamp":1548507299000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995882800855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,1]]}},"alternative-id":["S0019995882800855"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(82)80085-5","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1982,1]]}}}