Randomness via effective descriptive set theory
From MaRDI portal
Publication:5294149
DOI10.1112/JLMS/JDM022zbMATH Open1118.03034OpenAlexW2065825246MaRDI QIDQ5294149FDOQ5294149
Authors: Greg Hjorth, André Nies 
Publication date: 23 July 2007
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/jdm022
Recommendations
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Descriptive set theory (03E15)
Cited In (19)
- The random members of a \({\Pi }_{1}^{0}\) class
- Recognizing strong random reals
- A new proof of Friedman's conjecture
- Π11‐Martin‐Löf randomness and Π11‐Solovay completeness
- Measure-theoretic applications of higher Demuth's theorem
- Title not available (Why is that?)
- From index sets to randomness in ∅n: random reals and possibly infinite computations part II
- Randomness and degree theory for infinite time register machines
- Higher randomness and forcing with closed sets
- Higher randomness and forcing with closed sets
- Higher randomness and genericity
- Genericity and randomness with ITTMs
- Randomness in the higher setting
- Higher Kurtz randomness
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
- Lowness of higher randomness notions
- Bad oracles in higher computability and randomness
- \({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open sets
- Continuous higher randomness
This page was built for publication: Randomness via effective descriptive set theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5294149)
