Every sequence is reducible to a random one
Information and Control
Mathematical metaphysics of randomness
Theoretical Computer Science - Special issue Kolmogorov complexity
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
Kolmogorov entropy in the context of computability theory
Theoretical Computer Science
Randomness and Recursive Enumerability
SIAM Journal on Computing
A Kolmogorov complexity characterization of constructive Hausdorff dimension
Information Processing Letters
On the Complexity of Random Strings (Extended Abstract)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Algorithmic Clustering of Music Based on String Compression
Computer Music Journal
SIAM Journal on Computing
Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
Effective Strong Dimension in Algorithmic Information and Computational Complexity
SIAM Journal on Computing
Dynamics of a generic Brownian motion: Recursive aspects
Theoretical Computer Science
Effective dimension of points visited by Brownian motion
Theoretical Computer Science
Computability of Julia Sets
Computability and Randomness
Time-Bounded Kolmogorov Complexity and Solovay Functions
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Randomness on Computable Probability Spaces—A Dynamical Point of View
Theory of Computing Systems
Randomness Through Computation: Some Answers, More Questions
Randomness Through Computation: Some Answers, More Questions
Limits on the computational power of random strings
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Kolmogorov complexity with error
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Information Distance in Multiples
IEEE Transactions on Information Theory
Turing's normal numbers: towards randomness
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Reconciling data compression and kolmogorov complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Turing's normal numbers: towards randomness
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 0.00 |
This article examines some of the recent advances in our understanding of algorithmic randomness. It also discusses connections with various areas of mathematics, computer science and other areas of science. Some questions and speculations will be discussed.