Abstract
A real number is called computably approximable if it is the limit of a computable sequence of rational numbers. Therefore the complexity of these real numbers can be classified by considering the convergence speed of computable sequences. In this paper we introduce a natural way to measure the convergence speed by counting the number of jumps of given sizes that appear after certain stages. Bounding the number of such kind of big jumps by different bounding functions, we introduce various classes of real numbers with different levels of approximation quality. We discuss further their mathematical properties as well as computability theoretical properties.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
