Randomness in the higher setting
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- A new proof of Friedman's conjecture
- Computability and randomness
- Higher Kurtz randomness
- Lowness of higher randomness notions
- Measures and their random reals
- On a problem of Kleene’s
- Randomness via effective descriptive set theory
- Recursion theory. Computational aspects of definability
Cited in
(18)- Searching for an analogue of \(\text{ATR}_0\) in the Weihrauch lattice
- Recognizing strong random reals
- Measure-theoretic applications of higher Demuth's theorem
- Higher randomness and forcing with closed sets
- Higher randomness and genericity
- Higher randomness and lim-sup forcing within and beyond hyperarithmetic
- Genericity and randomness with ITTMs
- Hausdorff dimension and countable Borel equivalence relations
- On the Hausdorff dimension of maximal chains and antichains of Turing and hyperarithmetic degrees
- Randomness and invariance
- Higher Kurtz randomness
- scientific article; zbMATH DE number 4156423 (Why is no real title available?)
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
- Lowness of higher randomness notions
- \({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open sets
- Bad oracles in higher computability and randomness
- LUZIN’S (N) AND RANDOMNESS REFLECTION
- Continuous higher randomness
This page was built for publication: Randomness in the higher setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2795912)