Relative randomness and real closed fields
From MaRDI portal
Recommendations
- Computing and Combinatorics
- Weakly computable real numbers
- Processes and structures on approximation spaces
- Comparing two versions of the reals
- Random semicomputable reals revisited
- EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER
- Finitely bounded effective computability
- There is no SW-complete c.e. real
- \(\Pi_1^0\) classes and minimal degrees
- scientific article; zbMATH DE number 1183247
Cites work
Cited in
(11)- Random reals as measures of natural open sets
- Differences of halting probabilities
- On the Reals Which Cannot Be Random
- A Note on the Differences of Computably Enumerable Reals
- On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals
- Comparing two versions of the reals
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- scientific article; zbMATH DE number 3943806 (Why is no real title available?)
- SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS
- Computability of Real Numbers
- Relative randomness and cardinality
This page was built for publication: Relative randomness and real closed fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370767)