On the computing power of +, -, and
From MaRDI portal
Publication:4635653
Abstract: Modify the Blum-Shub-Smale model of computation replacing the permitted computational primitives (the real field operations) with any finite set 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 ? We prove that it is always contained in the class obtained for . Moreover, if is a set of continuous semialgebraic functions containing and , and such that arbitrarily small numbers can be computed using , then we have the following dichotomy: either our class is or it coincides with the class obtained for .
Recommendations
Cited in
(1)
This page was built for publication: On the computing power of \(+\), \(-\), and \(\times\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635653)