On the close interaction between algorithmic randomness and constructive/computable measure theory
@article{Rute2018OnTC, title={On the close interaction between algorithmic randomness and constructive/computable measure theory}, author={Jason Rute}, journal={ArXiv}, year={2018}, volume={abs/1812.03375} }
This is a survey of constructive and computable measure theory with an emphasis on the close connections with algorithmic randomness. We give a brief history of constructive measure theory from Brouwer to the present, emphasizing how Schnorr randomness is the randomness notion implicit in the work of Brouwer, Bishop, Demuth, and others. We survey a number of recent results showing that classical almost everywhere convergence theorems can be used to characterize many of the common randomness… Expand
Topics from this paper
2 Citations
References
SHOWING 1-10 OF 216 REFERENCES
Computable randomness and betting for computable probability spaces
- Mathematics, Computer Science
- Math. Log. Q.
- 2016
- 14
- PDF
Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
- Mathematics, Computer Science
- Ann. Pure Appl. Log.
- 2012
- 30
- PDF
An Application of Martin-Löf Randomness to Effective Probability Theory
- Mathematics, Computer Science
- CiE
- 2009
- 37
- PDF
Randomness on Computable Probability Spaces—A Dynamical Point of View
- Mathematics, Computer Science
- Theory of Computing Systems
- 2010
- 48
- PDF
Random elements in effective topological spaces with measure
- Computer Science, Mathematics
- Inf. Comput.
- 2003
- 32
On Analogues of the Church-Turing Thesis in Algorithmic Randomness
- Computer Science, Mathematics
- Rev. Symb. Log.
- 2016
- 1
- PDF