REGAININGLY APPROXIMABLE NUMBERS AND SETS.

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 for infinitely many ${n \in \mathbb {N}}$. We also call a set $A\subseteq \mathbb {N}$ regainingly approximable if...

Full description

Bibliographic Details

Published in:	Journal of Symbolic Logic Vol. 90; no. 4; pp. 1664 - 1695
Main Authors:	HERTLING, PETER, HÖLZL, RUPERT, JANICKI, PHILIP
Format:	Article
Published:	Cambridge University Press Dec2025
Subjects:	Recursive sequences (Mathematics) Real numbers Algorithmic randomness Recursion theory Kolmogorov complexity
Online Access:	View this record in EBSCOhost