Pages that link to "Item:Q1887661"
From MaRDI portal
The following pages link to The Kolmogorov complexity of random reals (Q1887661):
Displaying 30 items.
- On Kolmogorov complexity in the real Turing machine setting (Q293323) (← links)
- Universal computably enumerable sets and initial segment prefix-free complexity (Q391648) (← links)
- Effectively approximating measurable sets by open sets (Q418744) (← links)
- Randomness for computable measures and initial segment complexity (Q508835) (← links)
- Oscillation in the initial segment complexity of random reals (Q633597) (← links)
- On relative randomness (Q688792) (← links)
- Kolmogorov complexity of initial segments of sequences and arithmetical definability (Q719306) (← links)
- Randomness and the linear degrees of computability (Q866567) (← links)
- Information measures for infinite sequences (Q974755) (← links)
- The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets (Q987934) (← links)
- Randnomness, computability, and algebraic specifications (Q1382180) (← links)
- The Kolmogorov complexity of real numbers. (Q1607299) (← links)
- On the Kolmogorov complexity of continuous real functions (Q1944334) (← links)
- Random reals à la Chaitin with or without prefix-freeness (Q2456371) (← links)
- On partial randomness (Q2576938) (← links)
- Most numbers obey no probability laws (Q2770667) (← links)
- Mass problems and initial segment complexity (Q2921016) (← links)
- Arithmetic complexity via effective names for random sequences (Q2946673) (← links)
- ON REALS WITH -BOUNDED COMPLEXITY AND COMPRESSIVE POWER (Q2976366) (← links)
- (Q3200319) (← links)
- A minimal pair of 𝐾-degrees (Q3372137) (← links)
- Calibrating Randomness (Q3412463) (← links)
- On initial segment complexity and degrees of randomness (Q3506714) (← links)
- (Q3715106) (← links)
- Kolmogorov Complexity and Algorithmic Randomness (Q4599290) (← links)
- There are 2^{ℵ₀} many 𝐻-degrees in the random reals (Q4813660) (← links)
- Kolmogorov Complexity Theory over the Reals (Q4918012) (← links)
- On the Gaussianity of Kolmogorov Complexity of Mixing Sequences (Q5211667) (← links)
- New Computational Paradigms (Q5717075) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
