{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:22Z","timestamp":1725662902313},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108566"},{"type":"electronic","value":"9783540387695"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10856-4_91","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:32:23Z","timestamp":1330191143000},"page":"252-261","source":"Crossref","is-referenced-by-count":0,"title":["Retraceability, repleteness and busy beaver sets"],"prefix":"10.1007","author":[{"given":"Robert P.","family":"Daley","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/malq.19780241303","volume":"24","author":"R. Daley","year":"1978","unstructured":"Daley, R., On the simplicity of busy beaver sets, Zeit. f. Math. Logik und Grund. d. Math.\n24 (1978), 207\u2013224.","journal-title":"Zeit. f. Math. Logik und Grund. d. Math."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Daley, R., Busy beaver sets and the degrees of unsolvability, Journal of Symbolic Logic, to appear.","DOI":"10.2307\/2273749"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1090\/S0002-9939-1954-0063995-6","volume":"5","author":"J. Dekker","year":"1954","unstructured":"Dekker, J., A theorem on hypersimple sets, Proceedings of AMS\n5 (1954), 791\u2013796.","journal-title":"Proceedings of AMS"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1017\/S0022481200051598","volume":"41","author":"R. Soare","year":"1976","unstructured":"Soare, R., The infinite injury priority method, Journal of Symbolic Logic\n41 (1976), 513\u2013530.","journal-title":"Journal of Symbolic Logic"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/malq.19620080313","volume":"8","author":"C. Yates","year":"1962","unstructured":"Yates, C., Recursively enumerable sets and retracing functions, Zeit. f. Math. Logik und Grund. d. Math.\n8 (1962), 331\u2013345.","journal-title":"Zeit. f. Math. Logik und Grund. d. Math."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1981"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10856-4_91.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:40:04Z","timestamp":1619556004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10856-4_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108566","9783540387695"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-10856-4_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}