Learn More
The set A is low for (Martin-Löf) randomness 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 ∀n K(A n) ≤(More)
We investigate combinatorial lowness properties of sets of natural numbers (reals). The real A is super-low if A′ ≤tt ∅′, and A is jump-traceable if the values of {e}A(e) can be effectively(More)