Randomness, Computation and Mathematics

@inproceedings{Downey2012RandomnessCA,
  title={Randomness, Computation and Mathematics},
  author={Rodney G. Downey},
  booktitle={CiE},
  year={2012}
}
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. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 73 references

and D

R. Downe
Hirschfeldt, Algorithmic Randomness and Complexity, Springer-Verlag, • 2010
View 11 Excerpts
Highly Influenced

Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State

IEEE Conference on Computational Complexity • 2000
View 13 Excerpts
Highly Influenced

Measure, Π 1 classes, and complete extensions of PA, In Recursion Theory Week, volume 1141 of Lecture Notes in Mathematics, pages

A. Kučera
Oberwolfach, • 1984
View 5 Excerpts
Highly Influenced

and R

L. Bienven
Downey. Kolmogorov complexity and Solovay functions, in STACS • 2009
View 6 Excerpts
Highly Influenced

and M

M. Braverma
Yampolsky, Computability of Julia Sets, Springer-Verlag, • 2008
View 4 Excerpts
Highly Influenced

and F

B. Kjos-Hanssen, W. Merkle
Stephan. Kolmogorov complexity and the recursion theorem, in STACS • 2006
View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…