{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:49:48Z","timestamp":1725662988255},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540095262"},{"type":"electronic","value":"9783540350880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/3-540-09526-8_22","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:47:09Z","timestamp":1330170429000},"page":"258-265","source":"Crossref","is-referenced-by-count":0,"title":["On the simplification of constructions in degrees of unsolvability via computational complexity"],"prefix":"10.1007","author":[{"given":"Robert P.","family":"Daley","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M., \"A machine independent theory of the complexity of recursive functions\", JACM 14 (1967), 322\u2013336.","journal-title":"JACM"},{"key":"22_CR2","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\u00fcr Math. Logik und Grund. der Math. 24 (1978), 207\u2013224.","journal-title":"Zeit. f\u00fcr Math. Logik und Grund. der Math."},{"unstructured":"Daley, R., \"Busy beaver sets and the degrees of unsolvability (revised)\", Technical Report 78-2 (1978), Computer Science Department, University of Pittsburgh.","key":"22_CR3"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0002-9947-1976-0403933-6","volume":"220","author":"N. Lynch","year":"1976","unstructured":"Lynch, N., Meyer, A., and Fischer, M., \"Relativizations of the theory of computational complexity\", Transactions AMS 220 (1976), 243\u2013287.","journal-title":"Transactions AMS"},{"unstructured":"Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw Hill (1967).","key":"22_CR5"},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"300","DOI":"10.2307\/1970393","volume":"80","author":"G. Sacks","year":"1964","unstructured":"Sacks, G., \"The recursively enumerable sets are dense\", Annals of Math. 80 (1964), 300\u2013312.","journal-title":"Annals of Math."},{"unstructured":"Shoenfield, J., Degrees of Unsolvability, North Holland (1971).","key":"22_CR7"},{"unstructured":"Symes, M., \"The extension of machine-independent computational complexity theory to oracle machine computation and to the computation of finite functions\", Ph. D. Dissertation, Department of Applied Analysis and Computer Science, University of Waterloo (1971).","key":"22_CR8"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1979"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-09526-8_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:00:53Z","timestamp":1619542853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-09526-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540095262","9783540350880"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-09526-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1979]]}}}