2014/01/20 by Marcello Mamino, Mamino, Marcello
Computer Science · #68Q05 #68Q15 #Computability, Logic, AI Algorithms #Computational Complexity (cs.CC) #F.1.1 #F.1.3 #F.2.1 #FOS: Computer and information sciences #Polynomial and algebraic computation #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1401.4879
openalex publication_date 2014/01/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Modify the Blum-Shub-Smale model of computation replacing the permitted computational primitives (the real field operations) with any finite set B of real functions semialgebraic over the rationals. Consider the class of boolean decision problems that can be solved in polynomial time in the new model by machines with no machine constants. How does this class depend on B? We prove that it is always contained in the class obtained for B = \+, -, ×\. Moreover, if B is a set of continuous semialgebraic functions containing + and -, and such that arbitrarily small numbers can be computed using B, then we have the following dichotomy: either our class is \mathsf P or it coincides with the class obtained for B = \+, -, ×\.