scientific article; zbMATH DE number 4023258
From MaRDI portal
Publication:3765758
[For the entire collection see Zbl 0587.00019.] In this paper a definition of computability and complexity of real functions and real numbers is given which is open to methods of recursive function theory as well as to methods of numerical analysis. As an example of application we study the computational complexity of roots and thereby establish a subpolynomial hierarchy of real closed fields.
Recommendations
- Subclasses of computable real valued functions
- scientific article; zbMATH DE number 52121
- Characterizing polynomial time computability of rational and real functions
- On the time complexity of partial real functions
- On the complexity of approximate realization of some classical functions
- Real numbers of sublinear complexity: irrationality and transcendence measures
- Topics in real and complex number complexity theory
- Polynomial time over the reals with parsimony
- scientific article; zbMATH DE number 58287
- scientific article; zbMATH DE number 953024
Cited in
(21)- On the complexity of online computations of real functions
- A refined model of computation for continuous problems
- Feasible real random access machines
- Online computations of differentiable functions
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
- Computability on computable metric spaces
- Using PVS to validate the algorithms of an exact arithmetic.
- On the time complexity of partial real functions
- Polynomial time over the reals with parsimony
- Type 2 computational complexity of functions on Cantor's space
- Average-case bit-complexity theory of real functions
- Small complexity classes for computable analysis
- Feasible Real Functions and Arithmetic Circuits
- Relativization of Real Numbers to a Universe
- Subclasses of computable real valued functions
- The complexity of real recursive functions
- Real numbers and BDDs
- Computability of Real Numbers
- Polynomial time computation in the context of recursive analysis
- The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints
- Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765758)