{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:56:42Z","timestamp":1742975802947,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354666"},{"type":"electronic","value":"9783540354680"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780342_43","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T02:19:46Z","timestamp":1151461186000},"page":"413-422","source":"Crossref","is-referenced-by-count":0,"title":["Degrees of Weakly Computable Reals"],"prefix":"10.1007","author":[{"given":"Keng Meng","family":"Ng","sequence":"first","affiliation":[]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[]},{"given":"Guohua","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1006\/jcom.2000.0561","volume":"16","author":"K. Ambos-Spies","year":"2000","unstructured":"Ambos-Spies, K., Weihrauch, K., Zheng, X.: Weakly computable real numbers. Journal of Complexity\u00a016, 676\u2013690 (2000)","journal-title":"Journal of Complexity"},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G. Chaitin","year":"1975","unstructured":"Chaitin, G.: A theory of program size formally identical to information theory. Journal of the Association for Computing Machinery\u00a022, 329\u2013340 (1975)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/malq.200310103","volume":"50","author":"R. Downey","year":"2004","unstructured":"Downey, R., Wu, G., Zheng, X.: Degrees of d.c.e. reals. Mathematical Logic Quarterly\u00a050, 345\u2013350 (2004)","journal-title":"Mathematical Logic Quarterly"},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1142\/9789812705815_0005","volume-title":"Proceedings of the 7th and 8th Asian Logic Conferences","author":"R. Downey","year":"2003","unstructured":"Downey, R., Hirschfeldt, D., Nies, A., Stephan, F.: Trivial reals. In: Proceedings of the 7th and 8th Asian Logic Conferences, pp. 103\u2013131. World Scientific, Singapore (2003)"},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1142\/S0219061305000468","volume":"5","author":"R. Downey","year":"2005","unstructured":"Downey, R., Hirschfeldt, D., Miller, J., Nies, A.: Relativizing Chaitin\u2019s halting probability. Journal of Mathematical Logic\u00a05, 167\u2013192 (2005)","journal-title":"Journal of Mathematical Logic"},{"key":"43_CR6","series-title":"Lecture Notes in Math.","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BFb0086116","volume-title":"Recursive Theory Week (Proceedings, Oberwolfach)","author":"R. Downey","year":"1989","unstructured":"Downey, R., Jockusch Jr., C., Stob, M.: Array nonrecursive sets and multiple permitting arguments. In: Ambos-Spies, et al. (eds.) Recursive Theory Week (Proceedings, Oberwolfach). Lecture Notes in Math., vol.\u00a01432, pp. 141\u2013173. Springer, Heidelberg (1989)"},{"key":"43_CR7","series-title":"London Math. Soc. Lecture Notes Series","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1017\/CBO9780511629167.005","volume-title":"Computability, Enumerability, Unsolvability: Directions in Recursion Theory","author":"R. Downey","year":"1996","unstructured":"Downey, R., Jockusch Jr., C., Stob, M.: Array nonrecursive sets and genericity. In: Computability, Enumerability, Unsolvability: Directions in Recursion Theory. London Math. Soc. Lecture Notes Series, vol.\u00a0224, pp. 93\u2013104. Cambridge University Press, Cambridge (1996)"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Ishmukhametov, S.: Weak recursive degrees and a problem of Spector. In: de Gruyter, W., Recursion Theory and Complexity (Proceedings of the Kazan 1997, workshop), pp. 81\u201388 (1999)","DOI":"10.1515\/9783110807486.81"},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.4153\/CJM-1977-105-5","volume":"29","author":"C. Jockusch Jr.","year":"1977","unstructured":"Jockusch Jr., C.: Simple proofs of some theorems on high degrees of unsolvability. Canadian Journal of Mathematics\u00a029, 1072\u20131080 (1977)","journal-title":"Canadian Journal of Mathematics"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/S0097539799357441","volume":"31","author":"A. Ku\u010dera","year":"2001","unstructured":"Ku\u010dera, A., Slaman, T.A.: Randomness and recursive enumerability. SIAM Journal on Computing\u00a031, 199\u2013211 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.aim.2004.10.006","volume":"197","author":"A. Nies","year":"2005","unstructured":"Nies, A.: Lowness properties of reals and randomness. Advances in Mathematics\u00a0197, 274\u2013305 (2005)","journal-title":"Advances in Mathematics"},{"key":"43_CR12","unstructured":"Odifreddi, P.: Classical Recursion Theory, vol. I , II. North-Holland\/Elsevier, Amsterdam (1989\/1999)"},{"key":"43_CR13","doi-asserted-by":"publisher","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. Springer, Heidelberg (1987)"},{"key":"43_CR14","series-title":"Models and Recursion Theory","first-page":"264","volume-title":"Recursively enumerable degrees and the degrees less than 0\u2032","author":"C.E. Mike Yates","year":"1967","unstructured":"Mike Yates, C.E.: Recursively enumerable degrees and the degrees less than 0\u2032. Models and Recursion Theory, pp. 264\u2013271. North-Holland, Amsterdam (1967)"},{"key":"43_CR15","doi-asserted-by":"publisher","first-page":"252","DOI":"10.2178\/jsl\/1140641173","volume":"71","author":"G. Wu","year":"2006","unstructured":"Wu, G.: Jump operators and Yates degrees. The Journal of Symbolic Logic\u00a071, 252\u2013264 (2006)","journal-title":"The Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Logical Approaches to Computational Barriers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780342_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T23:15:35Z","timestamp":1552346135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780342_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354666","9783540354680"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11780342_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}