Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine (Q1128664): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Q3803111
@@ Property / cites work: Q3803111 / rank @@
+Normal rank
@@ Property / cites work @@
+On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
+Normal rank
@@ Property / cites work @@
+Q3893911
@@ Property / cites work: Q3893911 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4150804
@@ Property / cites work: Q4150804 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of real functions
@@ Property / cites work: Computational complexity of real functions / rank @@
+Normal rank
@@ Property / cites work @@
+Computable functionals
@@ Property / cites work: Computable functionals / rank @@
+Normal rank
@@ Property / cites work @@
+Topological complexity of a root finding algorithm
+Normal rank
@@ Property / cites work @@
+Q3246326
@@ Property / cites work: Q3246326 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994907
@@ Property / cites work: Q3994907 / rank @@
+Normal rank