{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:26:07Z","timestamp":1725823567209},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200279"},{"type":"electronic","value":"9783319200286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20028-6_5","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T06:07:37Z","timestamp":1434694057000},"page":"44-53","source":"Crossref","is-referenced-by-count":0,"title":["Covering the Recursive Sets"],"prefix":"10.1007","author":[{"given":"Bj\u00f8rn","family":"Kjos-Hanssen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastiaan A.","family":"Terwijn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Brendle, J, Brooke-Taylor, A, Ng, K.M., Nies, A.: An analogy between cardinal characteristics and highness properties of oracles. Technical report on \n                      http:\/\/arxiv.org\/abs\/1404.2839\n                      \n                     (2014)","DOI":"10.1142\/9789814678001_0001"},{"issue":"1","key":"5_CR2","first-page":"85","volume":"28","author":"O Demuth","year":"1987","unstructured":"Demuth, O., Ku\u010dera, A.: Remarks on \n                      \n                        \n                      \n                      $$1$$\n                      \n                        \n                          \n                            1\n                          \n                        \n                      \n                    -genericity, semigenericity and related concepts. Commentationes Math. Univ. Carol. 28(1), 85\u201394 (1987)","journal-title":"Commentationes Math. Univ. Carol."},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.2307\/2695113","volume":"66","author":"RG Downey","year":"2001","unstructured":"Downey, R.G., Hirschfeldt, D.R., Lempp, S., Solomon, R.: A \n                      \n                        \n                      \n                      $$\\Delta ^0_2$$\n                      \n                        \n                          \n                            \u0394\n                            2\n                            0\n                          \n                        \n                      \n                     set with no infinite low subset in either it or its complement. J. Symbolic Logic 66(3), 1371\u20131381 (2001)","journal-title":"J. Symbolic Logic"},{"key":"5_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"RG Downey","year":"2010","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Theory and Applications of Computability. Springer, New York (2010)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"999","DOI":"10.2178\/jsl\/1230396761","volume":"73","author":"J Franklin","year":"2008","unstructured":"Franklin, J.: Hyperimmune-free degrees and Schnorr triviality. J. Symbolic Logic 73, 999\u20131008 (2008)","journal-title":"J. Symbolic Logic"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"501","DOI":"10.2178\/jsl\/1268917492","volume":"75","author":"J Franklin","year":"2010","unstructured":"Franklin, J., Stephan, F.: Schnorr trivial sets and truth-table reducibility. J. Symbolic Logic 75, 501\u2013521 (2010)","journal-title":"J. Symbolic Logic"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Hirschfeldt, D.R., Terwijn, S.A.: Limit computability and constructive measure. In: Computational Prospects of Infinity II: Presented Talks. Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, vol. 15, pp. 131\u2013141. World Scientific Publishing Co., Pte. Ltd., Hackensack (2008)","DOI":"10.1142\/9789812796554_0007"},{"key":"5_CR8","unstructured":"Khan, M., Miller, J.S.: Forcing with bushy trees. Manuscript (2014)"},{"issue":"10","key":"5_CR9","doi-asserted-by":"publisher","first-page":"5465","DOI":"10.1090\/S0002-9947-2011-05306-7","volume":"363","author":"B Kjos-Hanssen","year":"2011","unstructured":"Kjos-Hanssen, B., Merkle, W., Stephan, F.: Kolmogorov complexity and the recursion theorem. Trans. Am. Math. Soc. 363(10), 5465\u20135480 (2011)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S0097539704446323","volume":"35","author":"B Kjos-Hanssen","year":"2005","unstructured":"Kjos-Hanssen, B., Nies, A., Stephan, F.: Lowness for the class of Schnorr random reals. SIAM J. Comput. 35(3), 647\u2013657 (2005)","journal-title":"SIAM J. Comput."},{"key":"5_CR11","unstructured":"Kurtz, S.A.: Randomness and genericity in the degrees of unsolvability. Thesis (Ph.D.) - University of Illinois at Urbana-Champaign, ProQuest LLC, Ann Arbor, MI (1981)"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/malq.19680140704","volume":"14","author":"W Miller","year":"1968","unstructured":"Miller, W., Martin, D.A.: The degrees of hyperimmune sets. Zeitschrift f\u00fcr Math. Logik und Grundlagen der Math. 14, 159\u2013166 (1968)","journal-title":"Zeitschrift f\u00fcr Math. Logik und Grundlagen der Math."},{"key":"5_CR14","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001","volume-title":"Computability and Randomness","author":"A Nies","year":"2009","unstructured":"Nies, A.: Computability and Randomness. Oxford Science Publications, New York (2009)"},{"key":"5_CR15","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Classical Recursion Theory","author":"PG Odifreddi","year":"1989","unstructured":"Odifreddi, P.G.: Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics, vol. 125. North-Holland Publishing Co., Amsterdam (1989)"},{"key":"5_CR16","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Classical Recursion Theory II","author":"PG Odifreddi","year":"1999","unstructured":"Odifreddi, P.G.: Classical Recursion Theory II. Studies in Logic and the Foundations of Mathematics, vol. 143. North-Holland Publishing Co., Amsterdam (1999)"},{"issue":"5","key":"5_CR17","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s00153-010-0187-6","volume":"49","author":"N Rupprecht","year":"2010","unstructured":"Rupprecht, N.: Relativized Schnorr tests with universal behavior. Arch. Math. Logic 49(5), 555\u2013570 (2010)","journal-title":"Arch. Math. Logic"},{"key":"5_CR18","volume-title":"Perspectives in Mathematical Logic","author":"RI Soare","year":"1987","unstructured":"Soare, R.I.: Recursively enumerable sets and degrees. In: Feferman, S., Lerman, M., Magidor, M., Scedrov, A. (eds.) Perspectives in Mathematical Logic. Springer, Berlin (1987)"},{"key":"5_CR19","series-title":"Synthese Library","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-94-015-9757-9_23","volume-title":"Reuniting the Antipodes\u2013Constructive and Nonstandard Views of the Continuum (Venice. 1999)","author":"SA Terwijn","year":"2001","unstructured":"Terwijn, S.A.: On the quantitative structure of \n                      \n                        \n                      \n                      $$\\Delta _2^0$$\n                      \n                        \n                          \n                            \u0394\n                            2\n                            0\n                          \n                        \n                      \n                    . In: Berger, U., Osswald, H., Schuster, P. (eds.) Reuniting the Antipodes\u2013Constructive and Nonstandard Views of the Continuum (Venice. 1999). Synthese Library, pp. 271\u2013283. Kluwer Academic Publishers, Dordrecht (2001)"}],"container-title":["Lecture Notes in Computer Science","Evolving Computability"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20028-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T02:46:39Z","timestamp":1559184399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-20028-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200279","9783319200286"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20028-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}