Complexity theory of real functions
Complexity theory of real functions
Computable analysis: an introduction
Computable analysis: an introduction
A subrecursive refinement of the fundamental theorem of algebra
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
| Hi-index | 0.00 |
We show that e, @p and other remarkable real numbers are limits of E^2-computable sequences of rational numbers having a polynomial rate of convergence (as usual, E^2 denotes the second Grzegorczyk class). However, only the rational numbers are limits of E^2-computable sequences of rational numbers with an exponential rate of convergence.