Regainingly approximable numbers and sets

Peter Hertling, Rupert Hölzl, Philip Janicki

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n{)}_n$ of rational numbers converging to $\alpha$ with $\alpha -a_n<2^{-n}$ for…