Effective randomness, strong reductions and Demuth’s theorem
نویسندگان
چکیده
We study generalizations of Demuth’s Theorem, which states that the image of a Martin-Löf random real under a tt-reduction is either computable or Turing equivalent to a Martin-Löf random real. We show that Demuth’s Theorem holds for Schnorr randomness and computable randomness (answering a question of Franklin), but that it cannot be strengthened by replacing the Turing equivalence in the statement of the theorem with wtt-equivalence. We also provide some additional results about the Turing and tt-degrees of reals that are random with respect to some computable measure.
منابع مشابه
Strong reductions in effective randomness
We study generalizations of Demuth’s Theorem, which states that the image of a Martin-Löf random real under a tt-reduction is either computable or Turing equivalent to a Martin-Löf random real. We show that Demuth’s Theorem holds for Schnorr randomness and computable randomness (answering a question of Franklin), but that it cannot be strengthened by replacing the Turing equivalence in the stat...
متن کاملCoherent Randomness Tests and Computing the K-trivial Sets
We introduce Oberwolfach randomness, a notion within Demuth’s framework of statistical tests with moving components; here the components’ movement has to be coherent across levels. We show that a ML-random set computes all K-trivial sets if and only if it is not Oberwolfach random, and indeed that there is a K-trivial set which is not computable from any Oberwolfach random set. We show that Obe...
متن کاملMeasure-theoretic Applications of Higher Demuth Randomness
We investigate measure-theoretic aspects of various notions of reducibility by applying analogs of Demuth’s Theorem in the hyperarithmetic and set-theoretic settings.
متن کاملThe Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set. This means that for almost every real x, either the derivative of f exists at x, or the derivative fails to exist in the worst possible way: the limit superior of the slopes around x equals +∞, and the limit inferior −∞. Algorithmic randomness a...
متن کاملRandomness in effective descriptive set theory
An analog of ML-randomness in the effective descriptive set theory setting is studied, where the r.e. objects are replaced by their Π1 counterparts. We prove the analogs of the Kraft-Chaitin Theorem and Schnorr’s Theorem. In the new setting, while K-trivial sets exist that are not hyper-arithmetical, each low for random set is. Finally we study a very strong yet effective randomness notion: Z i...
متن کامل