Results 1 -
2 of
2
Lowness Properties and Randomness
- ADVANCES IN MATHEMATICS
"... The set A is low for Martin-Lof random if each random set is already random relative to A. A is K-trivial if the prefix complexity K of each initial segment of A is minimal, namely K(n)+O(1). We show that these classes coincide. This implies answers to questions of Ambos-Spies and Kucera [2 ..."
Abstract
-
Cited by 67 (18 self)
- Add to MetaCart
The set A is low for Martin-Lof random if each random set is already random relative to A. A is K-trivial if the prefix complexity K of each initial segment of A is minimal, namely K(n)+O(1). We show that these classes coincide. This implies answers to questions of Ambos-Spies and Kucera [2], showing that each low for Martin-Lof random set is # 2 . Our class induces a natural intermediate # 3 ideal in the r.e. Turing degrees (which generates the whole class under downward closure). Answering
Parameter Definability in the Recursively Enumerable Degrees
"... The biinterpretability conjecture for the r.e. degrees asks whether, for each sufficiently large k, the # k relations on the r.e. degrees are uniformly definable from parameters. We solve a weaker version: for each k >= 7, the k relations bounded from below by a nonzero degree are uniformly definabl ..."
Abstract
-
Cited by 30 (12 self)
- Add to MetaCart
The biinterpretability conjecture for the r.e. degrees asks whether, for each sufficiently large k, the # k relations on the r.e. degrees are uniformly definable from parameters. We solve a weaker version: for each k >= 7, the k relations bounded from below by a nonzero degree are uniformly definable. As applications, we show that...

