Computable irrational numbers with representations of surprising complexity

Cauchy sequences, Dedekind cuts, base-10 expansions and continued fractions are examples of well-known representations of irrational numbers. But there exist others, not so popular, which can be defined using various kinds of sum approximations and best approximations. In this paper we investigate the complexity of a number of such representations.