Recursively enumerable complexity sequences and measure independence (Q3901505): Difference between revisions

@@ 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.2307/2273412
@@ Property / full work available at URL: https://doi.org/10.2307/2273412 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2063202211
@@ Property / OpenAlex ID: W2063202211 / rank @@
+Normal rank
@@ Property / cites work @@
+Some lowness properties and computational complexity sequences
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+On some games which are relevant to the theory of recursively enumerable sets
+Normal rank
@@ Property / cites work @@
+An Overview of the Theory of Computational Complexity
+Normal rank
@@ Property / cites work @@
+Recursive Properties of Abstract Complexity Classes
+Normal rank
@@ Property / cites work @@
+A Machine-Independent Theory of the Complexity of Recursive Functions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3901505