Maximal pairs of c.e. reals in the computably Lipschitz degrees (Q638499): Difference between revisions

@@ Property / cites work @@
+A c.e. real that cannot be sw-computed by any \(\Omega\) number
+Normal rank
@@ Property / cites work @@
+The ibT degrees of computably enumerable sets are not dense
+Normal rank
@@ Property / cites work @@
+Randomness and the linear degrees of computability
+Normal rank
@@ Property / cites work @@
+Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees
+Normal rank
@@ Property / cites work @@
+Algorithmic Randomness and Complexity
@@ Property / cites work: Algorithmic Randomness and Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4779154
@@ Property / cites work: Q4779154 / rank @@
+Normal rank
@@ Property / cites work @@
+The method of the Yu–Ding Theorem and its application
+Normal rank
@@ Property / cites work @@
+Random reals and Lipschitz continuity
@@ Property / cites work: Random reals and Lipschitz continuity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040892
@@ Property / cites work: Q4040892 / rank @@
+Normal rank
@@ Property / cites work @@
+Computability Theory and Differential Geometry
@@ Property / cites work: Computability Theory and Differential Geometry / rank @@
+Normal rank
@@ Property / cites work @@
+There is no <i>SW</i>-complete c.e. real
@@ Property / cites work: There is no <i>SW</i>-complete c.e. real / rank @@
+Normal rank