4
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      Lowness for Kurtz randomness

      ,
      The Journal of Symbolic Logic
      Association for Symbolic Logic

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We prove that degrees that are low for Kurtz randomness cannot be diagonally non-recursive. Together with the work of Stephan and Yu [16], this proves that they coincide with the hyperimmune-free non-DNR degrees, which are also exactly the degrees that are low for weak 1-genericity.

          We also consider Low( , Kurtz), the class of degrees a such that every element of is a-Kurtz random. These are characterised when is the class of Martin-Löf random, computably random, or Schnorr random reals. We show that Low(ML, Kurtz) coincides with the non-DNR degrees, while both Low(CR, Kurtz) and Low(Schnorr, Kurtz) are exactly the non-high, non-DNR degrees.

          Related collections

          Most cited references8

          • Record: found
          • Abstract: not found
          • Article: not found

          Lowness properties and randomness

          Andre Nies (2005)
            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Calibrating Randomness

            We report on some recent work centered on attempts to understand when one set is more random than another. We look at various methods of calibration by initial segment complexity, such as those introduced by Solovay [125], Downey, Hirschfeldt, and Nies [39], Downey, Hirschfeldt, and LaForte [36], and Downey [31]; as well as other methods such as lowness notions of Kučera and Terwijn [71], Terwijn and Zambella [133], Nies [101, 100], and Downey, Griffiths, and Reid [34]; higher level randomness notions going back to the work of Kurtz [73], Kautz [61], and Solovay [125]; and other calibrations of randomness based on definitions along the lines of Schnorr [117].
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              On Degrees of Recursive Unsolvability

                Bookmark

                Author and article information

                Journal
                applab
                The Journal of Symbolic Logic
                J. symb. log.
                Association for Symbolic Logic
                0022-4812
                1943-5886
                June 2009
                March 12 2014
                June 2009
                : 74
                : 02
                : 665-678
                Article
                10.2178/jsl/1243948333
                9584d7b7-d813-4d60-a8f1-bec571a5b196
                © 2009
                History

                Comments

                Comment on this article