{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T05:03:09Z","timestamp":1733547789182,"version":"3.30.1"},"reference-count":16,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["COM"],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.3233\/com-180231","type":"journal-article","created":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T15:33:15Z","timestamp":1558107195000},"page":"155-177","source":"Crossref","is-referenced-by-count":3,"title":["Dense computability, upper cones, and minimal pairs"],"prefix":"10.1177","volume":"8","author":[{"given":"Eric P.","family":"Astor","sequence":"first","affiliation":[{"name":"Google LLC, 111 8th Ave., New York, NY 10011, USA. eric.astor@gmail.com"}]},{"given":"Denis R.","family":"Hirschfeldt","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Chicago, 5734 S. University Ave., Chicago, IL 60637, USA. drh@math.uchicago.edu"}]},{"given":"Carl G.","family":"Jockusch","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Illinois, 1409 W. Green St., Urbana, IL 61801, USA. jockusch@math.uiuc.edu"}]}],"member":"179","reference":[{"key":"10.3233\/COM-180231_ref1","first-page":"41","article-title":"Asymptotic density, computable traceability, and 1-randomness","volume":"234","author":"Andrews","year":"2016","journal-title":"Fund. Math."},{"key":"10.3233\/COM-180231_ref2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.3233\/COM-150040","article-title":"Asymptotic density, immunity, and randomness","volume":"4","author":"Astor","year":"2015","journal-title":"Computability"},{"key":"10.3233\/COM-180231_ref3","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1017\/jsl.2016.50","article-title":"Density-1-bounding and quasiminimality in the generic degrees","volume":"82","author":"Cholak","year":"2017","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-180231_ref4","doi-asserted-by":"crossref","unstructured":"R.G.\u00a0Downey and D.R.\u00a0Hirschfeldt, Algorithmic Randomness and Complexity, Theory and Applications of Computability, Springer, New York, 2010.","DOI":"10.1007\/978-0-387-68441-3"},{"key":"10.3233\/COM-180231_ref5","doi-asserted-by":"publisher","DOI":"10.1142\/S0219061313500050"},{"key":"10.3233\/COM-180231_ref6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.3233\/COM-160059","article-title":"Notions of robust information coding","volume":"6","author":"Dzhafarov","year":"2017","journal-title":"Computability"},{"key":"10.3233\/COM-180231_ref7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1093\/logcom\/exn101","article-title":"Indifferent sets","volume":"19","author":"Figueira","year":"2009","journal-title":"J. Logic Comput."},{"key":"10.3233\/COM-180231_ref8","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1017\/jsl.2015.70","article-title":"Coarse reducibility and algorithmic randomness","volume":"81","author":"Hirschfeldt","year":"2016","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-180231_ref9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3233\/COM-150035","article-title":"Asymptotic density and the coarse computability bound","volume":"5","author":"Hirschfeldt","year":"2016","journal-title":"Computability"},{"key":"10.3233\/COM-180231_ref10","doi-asserted-by":"publisher","first-page":"511","DOI":"10.2178\/jsl.7802090","article-title":"Nonexistence of minimal pairs for generic computation","volume":"78","author":"Igusa","year":"2013","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-180231_ref11","doi-asserted-by":"publisher","first-page":"1290","DOI":"10.1017\/jsl.2014.77","article-title":"The generic degrees of density-1 sets, and a characterization of the hyperarithmetic reals","volume":"80","author":"Igusa","year":"2015","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-180231_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629181.004"},{"key":"10.3233\/COM-180231_ref13","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1112\/jlms\/jdr051","article-title":"Generic computability, Turing degrees, and asymptotic density","volume":"85","author":"Jockusch","year":"2012","journal-title":"J. London Math. Soc."},{"key":"10.3233\/COM-180231_ref14","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/S0021-8693(03)00167-4","article-title":"Generic-case complexity, decision problems in group theory and random walks","volume":"264","author":"Kapovich","year":"2003","journal-title":"J. Algebra"},{"key":"10.3233\/COM-180231_ref15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0022-0000(74)80003-6","article-title":"Approximations to the halting problem","volume":"9","author":"Lynch","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.3233\/COM-180231_ref16","first-page":"15","article-title":"An open problem on creative sets","volume":"4","author":"Meyer","year":"1973","journal-title":"Recursive Function Theory Newsletter"}],"container-title":["Computability"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/COM-180231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T04:52:42Z","timestamp":1733460762000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-180231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":16,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/com-180231","relation":{},"ISSN":["2211-3576","2211-3568"],"issn-type":[{"type":"electronic","value":"2211-3576"},{"type":"print","value":"2211-3568"}],"subject":[],"published":{"date-parts":[[2019,6,17]]}}}