{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:55:59Z","timestamp":1725544559416},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"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\/11672142_11","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T08:27:54Z","timestamp":1141115274000},"page":"149-161","source":"Crossref","is-referenced-by-count":17,"title":["Kolmogorov Complexity and the Recursion Theorem"],"prefix":"10.1007","author":[{"given":"Bj\u00f8rn","family":"Kjos-Hanssen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Merkle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"11_CR1","first-page":"9","volume":"25","author":"M. Marat","year":"1981","unstructured":"Marat, M.: On some generalizations of the Fixed-Point Theorem. Soviet Mathematics (Iz.\u00a0VUZ), Russian\u00a025(5), 9\u201316 (1981); English translation 25(5), 1\u201310 (1981)","journal-title":"Soviet Mathematics (Iz.\u00a0VUZ), Russian"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.2178\/jsl\/1102022212","volume":"69","author":"K. Ambos-Spies","year":"2004","unstructured":"Ambos-Spies, K., Kjos-Hanssen, B., Lempp, S., Slaman, T.A.: Comparing DNR and WWKL. Journal of Symbolic Logic\u00a069, 1089\u20131104 (2004)","journal-title":"Journal of Symbolic Logic"},{"key":"11_CR3","unstructured":"Cristian, S.: Calude. Private Communication (2005)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Ku\u010dera, A.: Measure, ${\\mathrm \\Pi} \\sp 0\\sb 1$ -classes and complete extensions of PA. In: Recursion theory week 1984. Lecture Notes in Mathematics, vol.\u00a01141, pp. 245\u2013259 (1985)","DOI":"10.1007\/BFb0076224"},{"key":"11_CR5","unstructured":"Beigel, R., Buhrman, H., Fejer, P., Fortnow, L., Grabowski, P., Longpr\u00e9, L., Muchnik, A., Stephan, F., Torenvliet, L.: Enumerations of the Kolmogorov function. Electronic Colloquium on Computational Complexity, TR04-015 (2004)"},{"key":"11_CR6","series-title":"Stud. Logic Found. Math","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0049-237X(08)70045-4","volume-title":"Logic, methodology and philosophy of science, VIII (Moscow, 1987)","author":"C.G. Jockusch Jr.","year":"1989","unstructured":"Jockusch Jr., C.G.: Degrees of functions with no fixed points. In: Logic, methodology and philosophy of science, VIII (Moscow, 1987). Stud. Logic Found. Math, vol.\u00a0126, pp. 191\u2013201. North-Holland, Amsterdam (1989)"},{"key":"11_CR7","volume-title":"Graduate texts in Computer Science","author":"M. Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and its Applications. In: Graduate texts in Computer Science, Springer, Heidelberg (1997)"},{"key":"11_CR8","unstructured":"Miller, J.S.: ${\\mathrm \\Pi} \\sp 0\\sb 1$ classes in Computable Analysis and Topology. PhD thesis, Cornell University (2002)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Kjos-Hanssen, B., Nies, A., Stephan, F.: Lowness for the class of Schnorr random reals. In: SIAM Journal on Computing (to appear)","DOI":"10.1137\/S0097539704446323"},{"key":"11_CR10","unstructured":"Nies, A.: Private Communication (2004)"},{"key":"11_CR11","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical Recursion Theory. North-Holland, Amsterdam (1989)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","volume":"50","author":"E. Post","year":"1944","unstructured":"Post, E.: Recursively enumerable sets of positive integers and their decision problems. Bulletin of the American Mathematical Society\u00a050, 284\u2013316 (1944)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"11_CR13","unstructured":"Reimann, J.: Computability and Fractal Dimension. Doctoral dissertation, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Heidelberg, INF 288, D-69120 Heidelberg, Germany (2004)"},{"key":"11_CR14","unstructured":"Reimann, J.: Extracting randomness from sequences of positive dimension. Post of an open problem in the recursion theory section of the Mathematical Logic Forum (2004), at: math.berkeley.edu\/Logic\/problems\/"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T03:31:23Z","timestamp":1555471883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11672142_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}