Pages that link to "Item:Q987377"
From MaRDI portal
The following pages link to Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences (Q987377):
Displaying 12 items.
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension (Q610681) (← links)
- Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
- Constructive dimension and Turing degrees (Q733739) (← links)
- Algorithmically independent sequences (Q964004) (← links)
- Turing degrees of reals of positive effective packing dimension (Q975475) (← links)
- Short lists with short programs in short time (Q1745959) (← links)
- On extracting space-bounded Kolmogorov complexity (Q2354592) (← links)
- Randomness, Computation and Mathematics (Q2904405) (← links)
- (Q3503650) (redirect page) (← links)
- Algorithmically Independent Sequences (Q3533009) (← links)
- On Generating Independent Random Strings (Q3576088) (← links)
- Randomness extraction in computability theory (Q5880936) (← links)
