Relative randomness and real closed fields

DOI10.2178/jsl/1107298522zbMath1090.03014OpenAlexW2110665728MaRDI QIDQ3370767

Alexander Raichev

Publication date: 8 February 2006

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

Full work available at URL: https://doi.org/10.2178/jsl/1107298522

zbMATH Keywords

Kolmogorov complexityreal closed fields\(rK\)-reducibilityChaitin's Omega

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Differences of halting probabilities, A Note on the Differences of Computably Enumerable Reals, On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals, RELATIVIZING CHAITIN'S HALTING PROBABILITY, SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS, Computability of Real Numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Relatively recursive reals and real functions
• Randomness and reducibility
• The Arithmetical Hierarchy of Real Numbers
• Weakly computable real numbers