Pages that link to "Item:Q1887661"
From MaRDI portal
The following pages link to The Kolmogorov complexity of random reals (Q1887661):
Displaying 11 items.
- Universal computably enumerable sets and initial segment prefix-free complexity (Q391648) (← links)
- Effectively approximating measurable sets by open sets (Q418744) (← links)
- Oscillation in the initial segment complexity of random reals (Q633597) (← links)
- Kolmogorov complexity of initial segments of sequences and arithmetical definability (Q719306) (← links)
- Information measures for infinite sequences (Q974755) (← links)
- ON REALS WITH -BOUNDED COMPLEXITY AND COMPRESSIVE POWER (Q2976366) (← links)
- A minimal pair of 𝐾-degrees (Q3372137) (← links)
- Calibrating Randomness (Q3412463) (← links)
- On initial segment complexity and degrees of randomness (Q3506714) (← links)
- There are 2^{ℵ₀} many 𝐻-degrees in the random reals (Q4813660) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
