A c.e. real that cannot be sw-computed by any number
From MaRDI portal
Publication:867401
Recommendations
- \(\mathcal M^2\)-computable real numbers
- Weakly computable real numbers
- On \(0'\)-computable reals
- On the computational properties of the uncountability of the real numbers
- A non-generic real incompatible with \(0^\sharp\)
- Undefinability results in o-minimal expansions of the real numbers
- On Σ‐definability without equality over the real numbers
- scientific article; zbMATH DE number 1136091
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- scientific article; zbMATH DE number 5287432
Cited in
(13)- New Computational Paradigms
- The ibT degrees of computably enumerable sets are not dense
- The method of the Yu–Ding Theorem and its application
- A uniform version of non-\(\mathrm{low}_{2}\)-ness
- There is no SW-complete c.e. real
- The computable Lipschitz degrees of computably enumerable sets are not dense
- Maximal pairs of c.e. reals in the computably Lipschitz degrees
- Some properties of sw-reducibility
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
- Randomness and the linear degrees of computability
- scientific article; zbMATH DE number 7407778 (Why is no real title available?)
- Non-low\(_2\)-ness and computable Lipschitz reducibility
- Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees
This page was built for publication: A c.e. real that cannot be sw-computed by any \(\Omega\) number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867401)
