{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:00:41Z","timestamp":1725552041047},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340218"},{"type":"electronic","value":"9783540340225"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11750321_72","type":"book-chapter","created":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T06:11:16Z","timestamp":1146723076000},"page":"756-764","source":"Crossref","is-referenced-by-count":15,"title":["Lowness for Weakly 1-generic and Kurtz-Random"],"prefix":"10.1007","author":[{"given":"Frank","family":"Stephan","sequence":"first","affiliation":[]},{"given":"Liang","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"72_CR1","unstructured":"Downey, R.G., Hirschfeldt, D.: Algorithmic randomness and complexity. Springer, Heidelberg (to appear)"},{"key":"72_CR2","doi-asserted-by":"crossref","unstructured":"Downey, R., Jockusch, C.G., Stob, M.: Array nonrecursive degrees and genericity. In: Computability, Enumerability, Unsolvability. London Mathematical Society Lecture Notes Series, vol.\u00a0224, pp. 93\u2013104 (1996)","DOI":"10.1017\/CBO9780511629167.005"},{"issue":"2-3","key":"72_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.tcs.2004.03.055","volume":"321","author":"R.G. Downey","year":"2004","unstructured":"Downey, R.G., Griffiths, E.J., Reid, S.: On Kurtz randomness. Theoretical Computer Science\u00a0321(2-3), 249\u2013270 (2004)","journal-title":"Theoretical Computer Science"},{"key":"72_CR4","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":"72_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/11672142_11","volume-title":"Twentythird Annual Symposium on Theoretical Aspects of Computer Science","author":"B. Kjos-Hanssen","year":"2006","unstructured":"Kjos-Hanssen, B., Merkle, W., Stephan, F.: Kolmogorov Complexity and the Recursion Theorem. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 149\u2013161. Springer, Heidelberg (2006)"},{"key":"72_CR6","doi-asserted-by":"crossref","unstructured":"Kjos-Hanssen, B., Nies, A., Stephan, F.: Lowness for the class of Schnorr random reals. SIAM Journal on Computing (to appear)","DOI":"10.1137\/S0097539704446323"},{"key":"72_CR7","unstructured":"Kurtz, S.: Randomness and genericity in the degrees of unsolvability. Ph.D. Dissertation. University of Illinois, Urbana (1981)"},{"key":"72_CR8","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3860-5","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M. Li","year":"1993","unstructured":"Li, M., Vit\u00e1nyi, P.: An introduction to Kolmogorov complexity and its applications. Texts and Monographs in Computer Science. Springer, New York (1993)"},{"key":"72_CR9","doi-asserted-by":"crossref","unstructured":"Miller, J.S., Nies, A.: Randomness and computability: Open questions. The Bulletin of Symbolic Logic (to appear)","DOI":"10.2178\/bsl\/1154698740"},{"issue":"1","key":"72_CR10","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 and randomness. Advances in Mathematics\u00a0197(1), 274\u2013305 (2005)","journal-title":"Advances in Mathematics"},{"key":"72_CR11","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical Recursion Theory. North-Holland, Amsterdam (1989)"},{"key":"72_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":"72_CR13","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. Springer, Heidelberg (1987)"},{"issue":"3","key":"72_CR14","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.2307\/2695101","volume":"66","author":"S.A. Terwijn","year":"2001","unstructured":"Terwijn, S.A., Zambella, D.: Computational randomness and lowness. The Journal of Symbolic Logic\u00a066(3), 1199\u20131205 (2001)","journal-title":"The Journal of Symbolic Logic"},{"issue":"2","key":"72_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00153-005-0306-y","volume":"45","author":"L. Yu","year":"2006","unstructured":"Yu, L.: Lowness for genericity. Archive for Mathematical Logic\u00a045(2), 233\u2013238 (2006)","journal-title":"Archive for Mathematical Logic"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11750321_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:55Z","timestamp":1619506615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11750321_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340218","9783540340225"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11750321_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}