Regainingly approximable numbers and sets
computably enumerable setseffective approximationKolmogorov complexityleft-computable numberssplittingTuring degrees
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
In the paper under review, a notion regaining approximability is introduced. A real \(\alpha\) is regainingly approximable if there exists a computable nondecreasingsequence \(\{a_n\}_n\) of rational numbers converging to \(\alpha\) with \(\alpha-a_n < 2^{-n}\) for infinitely many \(n\in \mathbb{N}\). A number of results were proved related to the notion. For example, it is proved that there is a regainingly approximable real \(\alpha\) so that \(\exists^{\infty}n (K(\alpha \upharpoonright n)>n)\).
- Algorithmic randomness and complexity.
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Cohesive sets and recursively enumerable Dedekind cuts
- Complexity oscillations in infinite binary sequences
- Computability and randomness
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- Incompleteness theorems for random reals
- Kobayashi compressibility
- Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
- Kolmogorov complexity of initial segments of sequences and arithmetical definability
- On the degrees less than 0'
- Randomness, computability, and density
- Randomness, relativization and Turing degrees
- Regular reals
- Speedable Left-c.e. Numbers
This page was built for publication: Regainingly approximable numbers and sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858899)
