Regainingly approximable numbers and sets

DOI10.1017/JSL.2024.5MaRDI QIDQ6858899zbMATH OpenFDO

Authors P. H. Hertling, Rupert Hölzl

Publication date 12 February 2026

Published in The Journal of Symbolic Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/JSL.2024.5

zbMATH Keywords

computably enumerable setseffective approximationKolmogorov complexityleft-computable numberssplittingTuring degrees

Mathematics Subject Classification ID

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)

Cites work

• 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

Cited in

(2)

• Computable operators on left-c.e. reals and their continuity properties
• Randomness versus superspeedability

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)