Binary enumerability of real numbers. (Extended abstract) (Q4938670)

The paper is devoted to the study of same basic properties of binary enumerable real numbers, where a real number \(x\) is said to be binary enumerable if and only if there is an effective way to enumerate all ``1''-positions in the binary expansion of \(x\). In particular it is shown that there are two binary enumerable real numbers \(x\) and \(y\) such that their difference \(x-y\) is not binary \(\omega\)-enumerable, i.e., the number of the corrections for ``1''-positions of \(x-y\) is not bounded by any computable function. For the entire collection see [Zbl 0918.00033].