可恢复近似数与集合
Regainingly approximable numbers and sets
AI总结:
本文研究了可恢复近似数与集合的性质,证明其不闭合于并集和交集,并探讨了其在计算复杂度中的位置。
摘要:
我们称一个α∈ℝ为可恢复近似数,如果存在一个可计算的非递减序列(a_n)ₙ,其有理数序列收敛于α,并且对于无限多个n∈ℕ,有α - a_n < 2^{-n}。我们还称一个集合A⊆ℕ为可恢复近似集合,如果它是一个可枚举集,并且强左可计算数2^{-A}是可恢复近似数。我们证明可恢复近似集合的集合既不闭合于并集也不闭合于交集,并且每个可计算的Turing度包含这样的集合。此外,可恢复近似数严格位于可计算数和左可计算数之间,并且不闭合于加法。虽然可恢复近似数显然属于i.o. K-平凡数,但我们构造了一个这样的α,使得K(α|n) > n对于无限多个n成立。同样,存在一些可恢复近似集合,其初始段复杂度无限次达到可枚举集的最大可能值。最后,存在一个统一的算法将正则实数分成两个可恢复近似数,这两个数仍然是正则的。
英文摘要:
We call an $α\in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $α$ with $α- a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We also call a set $A\subseteq\mathbb{N}$ regainingly approximable if it is c.e. and the strongly left-computable number $2^{-A}$ is regainingly approximable. We show that the set of regainingly approximable sets is neither closed under union nor intersection and that every c.e. Turing degree contains such a set. Furthermore, the regainingly approximable numbers lie properly between the computable and the left-computable numbers and are not closed under addition. While regainingly approximable numbers are easily seen to be i.o. $K$-trivial, we construct such an $α$ such that ${K(α\restriction n)>n}$ for infinitely many $n$. Similarly, there exist regainingly approximable sets whose initial segment complexity infinitely often reaches the maximum possible for c.e. sets. Finally, there is a uniform algorithm splitting regular real numbers into two regainingly approximable numbers that are still regular.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。