{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T14:01:38Z","timestamp":1772287298066,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540421979","type":"print"},{"value":"9783540453352","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45335-0_2","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T12:49:27Z","timestamp":1195044567000},"page":"16-29","source":"Crossref","is-referenced-by-count":7,"title":["The Degree of Unsolvability of a Real Number"],"prefix":"10.1007","author":[{"given":"Anthony J.","family":"Dunlop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marian Boykan","family":"Pour-El","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,5,22]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(98)00098-X","volume":"210","author":"C.-K. Ho","year":"1999","unstructured":"Ho, C.-K.: Relatively recursive reals and real functions. Theoretical Computer Science 210 (1999), 99\u2013120.","journal-title":"Theoretical Computer Science"},{"key":"2_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics","author":"M.B. Pour-El","year":"1989","unstructured":"Pour-El, M.B. and J.I. Richards: Computability in Analysis and Physics. Berlin: Springer-Verlag, 1989."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"784","DOI":"10.2307\/2031867","volume":"5","author":"H.G. Rice","year":"1954","unstructured":"Rice, H.G.: Recursive real numbers. Proc. Amer. Math. Soc. 5 (1954), 784\u2013791.","journal-title":"Proc. Amer. Math. Soc."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.2307\/1995137","volume":"139","author":"R. Soare","year":"1969","unstructured":"Soare, R.: Recursion theory and Dedekind cuts. Trans. Amer. Math. Soc. 139 (1969), 271\u2013294","journal-title":"Trans. Amer. Math. Soc."},{"key":"2_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"R.I. Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. Berlin: Springer-Verlag, 1987."},{"key":"2_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Berlin: Springer-Verlag, 2000."}],"container-title":["Lecture Notes in Computer Science","Computability and Complexity in Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45335-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T07:49:30Z","timestamp":1551080970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45335-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421979","9783540453352"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-45335-0_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}