An operator embedding theorem for complexity classes of recursive functions (Q1225934): 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.1016/0304-3975(76)90055-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2089245341
@@ Property / OpenAlex ID: W2089245341 / rank @@
+Normal rank
@@ Property / cites work @@
+Diversity of speed-ups and embeddability in computational complexity
+Normal rank
@@ Property / cites work @@
+On classes of computable functions
@@ Property / cites work: On classes of computable functions / rank @@
+Normal rank
@@ Property / cites work @@
+A Machine-Independent Theory of the Complexity of Recursive Functions
+Normal rank
@@ Property / cites work @@
+Classes of computable functions defined by bounds on computation
+Normal rank
@@ Property / cites work @@
+Degrees of computational complexity
@@ Property / cites work: Degrees of computational complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Classifications of Recursive Functions by Means of Hierarchies
+Normal rank
@@ Property / cites work @@
+Augmented loop languages and classes of computable functions
+Normal rank
@@ Property / cites work @@
+Computational speed-up by effective operators
@@ Property / cites work: Computational speed-up by effective operators / rank @@
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of Unsolvability. (AM-55)
@@ Property / cites work: Degrees of Unsolvability. (AM-55) / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1225934