Subrecursiveness: Machine-independent notions of computability in restricted time and storage (Q5637881): Difference between revisions

@@ Property / cites work @@
+Q5586401
@@ Property / cites work: Q5586401 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5824357
@@ Property / cites work: Q5824357 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5636862
@@ Property / cites work: Q5636862 / rank @@
+Normal rank
@@ Property / cites work @@
+One-tape, off-line Turing machine computations
@@ Property / cites work: One-tape, off-line Turing machine computations / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Tape Simulation of Multitape Turing Machines
@@ Property / cites work: Two-Tape Simulation of Multitape Turing Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5812175
@@ Property / cites work: Q5812175 / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of Predictably Computable Functions
@@ Property / cites work: Classes of Predictably Computable Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Theory of Formal Systems. (AM-47)
@@ Property / cites work: Theory of Formal Systems. (AM-47) / rank @@
+Normal rank