Computability and randomness
@inproceedings{Nies2009ComputabilityAR,
title={Computability and randomness},
author={A. Nies},
year={2009}
}The interplay between computability and randomness has been an active area of research in recent years, reflected by ample funding in the USA, numerous workshops, and publications on the subject. The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computability theoretic tools can also be used to introduce mathematical counterparts for the intuitive notion of randomness of… CONTINUE READING
Figures and Tables from this paper
556 Citations
Review of Algorithmic Randomness and Complexity by Downey and Hirschfeldt
- Computer Science
- SIGA
- 2013
- PDF
On the close interaction between algorithmic randomness and constructive/computable measure theory
- Mathematics, Computer Science
- ArXiv
- 2018
- 1
- PDF
Algorithmic Randomness and Measures of Complexity
- Computer Science
- The Bulletin of Symbolic Logic
- 2013
- 3
References
SHOWING 1-10 OF 123 REFERENCES
Algorithmic Randomness and Complexity
- Mathematics, Computer Science
- Theory and Applications of Computability
- 2010
- 763
- PDF
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
- Mathematics, Computer Science
- J. Symb. Log.
- 2006
- 22
- PDF