Relatively computably enumerable reals
From MaRDI portal
Abstract: A real X is defined to be relatively c.e. if there is a real Y such that X is c.e.(Y) and Y does not compute X. A real X is relatively simple and above if there is a real Y <_T X such that X is c.e.(Y) and there is no infinite subset Z of the complement of X such that Z is c.e.(Y). We prove that every nonempty Pi^0_1 class contains a member which is not relatively c.e. and that every 1-generic real is relatively simple and above.
Recommendations
Cites work
Cited in
(10)- Effectively infinite classes of numberings of computable families of reals
- Relative enumerability and 1-genericity
- Spectrum of the field of computable real numbers
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- Presentations of computably enumerable reals.
- A Note on the Differences of Computably Enumerable Reals
- Regular reals
- Relative definability of \(n\)-generics
- The approximation structure of a computably approximable real
- scientific article; zbMATH DE number 1405572 (Why is no real title available?)
This page was built for publication: Relatively computably enumerable reals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535150)