On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768): Difference between revisions

← Older edit

@@ Property / cites work @@
+On the real spectrum of a ring and its application to semialgebraic geometry
+Normal rank
@@ Property / cites work @@
+Complex analytic dynamics on the Riemann sphere
@@ Property / cites work: Complex analytic dynamics on the Riemann sphere / rank @@
+Normal rank
@@ Property / cites work @@
+Invariant sets under iteration of rational functions
+Normal rank
@@ Property / cites work @@
+Q3893911
@@ Property / cites work: Q3893911 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3247126
@@ Property / cites work: Q3247126 / rank @@
+Normal rank
@@ Property / cites work @@
+Diophantine sets over polynomial rings
@@ Property / cites work: Diophantine sets over polynomial rings / rank @@
+Normal rank
@@ Property / cites work @@
+Diophantine Sets Over Z[ T ]
@@ Property / cites work: Diophantine Sets Over Z[ T ] / rank @@
+Normal rank
@@ Property / cites work @@
+The Diophantine Problem for Polynomial Rings and Fields of Rational Functions
+Normal rank
@@ Property / cites work @@
+Algorithmic approximations
@@ Property / cites work: Algorithmic approximations / 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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving systems of polynomial inequalities in subexponential time
+Normal rank
@@ Property / cites work @@
+Harvey Friedman's research on the foundations of mathematics
+Normal rank
@@ Property / cites work @@
+Computability Over Arbitrary Fields
@@ Property / cites work: Computability Over Arbitrary Fields / rank @@
+Normal rank
@@ Property / cites work @@
+Register machine proof of the theorem on exponential diophantine representation of enumerable sets
+Normal rank
@@ Property / cites work @@
+Topological complexity of a root finding algorithm
+Normal rank
@@ Property / cites work @@
+Q3745276
@@ Property / cites work: Q3745276 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4153600
@@ Property / cites work: Q4153600 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4160889
@@ Property / cites work: Q4160889 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4124327
@@ Property / cites work: Q4124327 / rank @@
+Normal rank
@@ Property / cites work @@
+Arithmetic on curves
@@ Property / cites work: Arithmetic on curves / rank @@
+Normal rank
@@ Property / cites work @@
+On the Betti Numbers of Real Varieties
@@ Property / cites work: On the Betti Numbers of Real Varieties / rank @@
+Normal rank
@@ Property / cites work @@
+Q5590814
@@ Property / cites work: Q5590814 / rank @@
+Normal rank
@@ Property / cites work @@
+Computability and Noncomputability in Classical Analysis
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ Property / cites work @@
+Computable Algebra, General Theory and Theory of Computable Fields
+Normal rank
@@ Property / cites work @@
+Proving simultaneous positivity of linear forms
@@ Property / cites work: Proving simultaneous positivity of linear forms / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring numbers in O(log n) arithmetic steps
@@ Property / cites work: Factoring numbers in O(log n) arithmetic steps / rank @@
+Normal rank
@@ Property / cites work @@
+Computability of Recursive Functions
@@ Property / cites work: Computability of Recursive Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4197343
@@ Property / cites work: Q4197343 / rank @@
+Normal rank
@@ Property / cites work @@
+On the topology of algorithms. I
@@ Property / cites work: On the topology of algorithms. I / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial response maps
@@ Property / cites work: Polynomial response maps / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for algebraic decision trees
@@ Property / cites work: Lower bounds for algebraic decision trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3690212
@@ Property / cites work: Q3690212 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5792485
@@ Property / cites work: Q5792485 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5511997
@@ Property / cites work: Q5511997 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3922158
@@ Property / cites work: Q3922158 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of linear programming
@@ Property / cites work: Complexity of linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Alfred Tarski's elimination theory for real closed fields
+Normal rank
@@ Property / cites work @@
+Q3883493
@@ Property / cites work: Q3883493 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1090/s0273-0979-1989-15750-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2071846104
@@ Property / OpenAlex ID: W2071846104 / rank @@
+Normal rank
@@ Property / Recommended article @@
+Q3033315
@@ Property / Recommended article: Q3033315 / rank @@
+Normal rank
@@ Property / Recommended article: Q3033315 / qualifier @@
+Similarity Score: 0.99508Amount 0.99508
Unit 1
-Amount
+.99508
 Unit
@@ Property / Recommended article: Q3033315 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4011251
@@ Property / Recommended article: Q4011251 / rank @@
+Normal rank
@@ Property / Recommended article: Q4011251 / qualifier @@
+Similarity Score: 0.9234481Amount 0.9234481
Unit 1
-Amount
+.9234481
 Unit
@@ Property / Recommended article: Q4011251 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4035132
@@ Property / Recommended article: Q4035132 / rank @@
+Normal rank
@@ Property / Recommended article: Q4035132 / qualifier @@
+Similarity Score: 0.9001126Amount 0.9001126
Unit 1
-Amount
+.9001126
 Unit
@@ Property / Recommended article: Q4035132 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On Some Computability Notions for Real Functions
+Normal rank
+Similarity Score: 0.8973591Amount 0.8973591
Unit 1
-Amount
+.8973591
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Logical Approaches to Computational Barriers
+Normal rank
+Similarity Score: 0.89505655Amount 0.89505655
Unit 1
-Amount
+.89505655
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On total functions, existence theorems and computational complexity
+Normal rank
+Similarity Score: 0.88841367Amount 0.88841367
Unit 1
-Amount
+.88841367
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A new approach to computability over the reals
+Normal rank
+Similarity Score: 0.887568Amount 0.887568
Unit 1
-Amount
+.887568
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Recursion theory on the reals and continuous-time computation
+Normal rank
+Similarity Score: 0.88709885Amount 0.88709885
Unit 1
-Amount
+.88709885
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On a Relative Computability Notion for Real Functions
+Normal rank
+Similarity Score: 0.88661444Amount 0.88661444
Unit 1
-Amount
+.88661444
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A recursion theoretic foundation of computation over real numbers
+Normal rank
+Similarity Score: 0.886552Amount 0.886552
Unit 1
-Amount
+.886552
 Unit
+Recommender Run: Recommender Run 2

Latest revision as of 11:25, 4 April 2025

scientific article; zbMATH DE number 4114604

Language	Label	Description	Also known as
English	On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines	scientific article; zbMATH DE number 4114604