Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences

@article{Zimand2009TwoSA,
  title={Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences},
  author={Marius Zimand},
  journal={Theory of Computing Systems},
  year={2009},
  volume={46},
  pages={707-722}
}
  • Marius Zimand
  • Published 2009
  • Mathematics, Computer Science
  • Theory of Computing Systems
The randomness rate of an infinite binary sequence is characterized by the sequence of ratios between the Kolmogorov complexity and the length of the initial segments of the sequence. It is known that there is no effective procedure that transforms one input sequence into another sequence with higher randomness rate. By contrast, we display such a uniform effective procedure having as input two independent sequences with positive but arbitrarily small constant randomness rate. Moreover the… Expand
Possibilities and impossibilities in Kolmogorov complexity extraction
Kolmogorov Complexity in Randomness Extraction
Algorithmically independent sequences
1 6 M ar 2 01 2 Space-Bounded Kolmogorov Extractors ⋆
Turing degrees of reals of positive effective packing dimension
Counting Dependent and Independent Strings
  • Marius Zimand
  • Mathematics, Computer Science
  • Fundam. Informaticae
  • 2014
Randomness and Computation
...
1
2
...

References

SHOWING 1-10 OF 27 REFERENCES
Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence
Increasing Kolmogorov Complexity
Extracting randomness using few independent sources
Algorithmically independent sequences
Randomness and Computability
Algorithmic Information Theory and Kolmogorov Complexity
Dimension Extractors and Optimal Decompression
  • D. Doty
  • Mathematics, Computer Science
  • Theory of Computing Systems
  • 2007
...
1
2
3
...