Cohesive sets and recursively enumerable Dedekind cuts
From MaRDI portal
Publication:2531924
Cited in
(20)- Classification of computably approximable real numbers
- On the hierarchy and extension of monotonically computable real numbers.
- The closure properties on real numbers under limits and computable operators.
- Presentations of computably enumerable reals.
- Randomness and reducibility
- Closed left-r.e. sets
- Closed left-r.e. sets
- scientific article; zbMATH DE number 1747708 (Why is no real title available?)
- Regular reals
- Asymptotic density and the Ershov hierarchy
- On the hierarchies of Δ20-real numbers
- Weakly computable real numbers
- Reordered computable numbers
- Regainingly approximable numbers and sets
- Binary expansions of regular reals and reordered computable numbers
- Randomness versus superspeedability
- Randomness versus superspeedability
- Probabilistic Turing machines and recursively enumerable Dedekind cuts
- Divergence bounded computable real numbers
- A hierarchy of Turing degrees of divergence bounded computable real numbers
This page was built for publication: Cohesive sets and recursively enumerable Dedekind cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2531924)