The Turing degree of a real number x is defined as the Turing degree of its binary expansion. This definition is quite natural and robust. In this paper we discuss some basic degr...
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
We study the complexity of approximating the Stieltjes integral R 1 0 f(x)dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded va...