A \(K\)-trivial set which is not jump traceable at certain orders (Q436598): Difference between revisions

@@ Property / author @@
+Daniel D. Turetsky
@@ Property / author: Daniel D. Turetsky / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2012.04.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1978967735
@@ Property / OpenAlex ID: W1978967735 / rank @@
+Normal rank
@@ Property / cites work @@
+CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS
@@ Property / cites work: CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS / rank @@
+Normal rank
@@ Property / cites work @@
+Strong jump-traceability. I: The computably enumerable case
+Normal rank
@@ Property / cites work @@
+Algorithmic Randomness and Complexity
@@ Property / cites work: Algorithmic Randomness and Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Time-Bounded Kolmogorov Complexity and Solovay Functions
+Normal rank
@@ Property / cites work @@
+Lowness for the Class of Schnorr Random Reals
@@ Property / cites work: Lowness for the Class of Schnorr Random Reals / rank @@
+Normal rank
@@ Property / cites work @@
+Lowness properties and randomness
@@ Property / cites work: Lowness properties and randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Q3611832
@@ Property / cites work: Q3611832 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational randomness and lowness
@@ Property / cites work: Computational randomness and lowness / rank @@
+Normal rank