Pages that link to "Item:Q5311760"
From MaRDI portal
The following pages link to Every 2-random real is Kolmogorov random (Q5311760):
Displaying 11 items.
- Relating and contrasting plain and prefix Kolmogorov complexity (Q285520) (← links)
- Effectively approximating measurable sets by open sets (Q418744) (← links)
- Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs (Q494650) (← links)
- Coherence of reducibilities with randomness notions (Q1787952) (← links)
- Initial segment complexities of randomness notions (Q2637318) (← links)
- Depth, Highness and DNR Degrees (Q2947871) (← links)
- Randomness and Computability: Open Questions (Q3412462) (← links)
- Calibrating Randomness (Q3412463) (← links)
- RANDOMNESS NOTIONS AND REVERSE MATHEMATICS (Q5107230) (← links)
- BEING LOW ALONG A SEQUENCE AND ELSEWHERE (Q5222521) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
