Q3304109 (Q3304109): Difference between revisions

@@ Property / cites work @@
+What can be efficiently reduced to the Kolmogorov-random strings?
+Normal rank
@@ Property / cites work @@
+Limits on the computational power of random strings
+Normal rank
@@ Property / cites work @@
+Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
+Normal rank
@@ Property / cites work @@
+On Effective Procedures for Speeding Up Algorithms
+Normal rank
@@ Property / cites work @@
+Algorithmic Randomness and Complexity
@@ Property / cites work: Algorithmic Randomness and Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The degrees below a 1-generic degree &lt; <b>0</b>′
+Normal rank
@@ Property / cites work @@
+Q3905267
@@ Property / cites work: Q3905267 / rank @@
+Normal rank
@@ Property / cites work @@
+Theory of computation.
@@ Property / cites work: Theory of computation. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3611832
@@ Property / cites work: Q3611832 / rank @@
+Normal rank
@@ Property / cites work @@
+On the degrees less than 0'
@@ Property / cites work: On the degrees less than 0' / rank @@
+Normal rank
@@ Property / cites work @@
+Turing Computability
@@ Property / cites work: Turing Computability / rank @@
+Normal rank