Corpus ID: 54459720

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}
}
  • Jason Rute
  • Published 2018
  • Mathematics, Computer Science
  • ArXiv
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
2 Citations
Luzin's (N) and randomness reflection
  • PDF

References

SHOWING 1-10 OF 216 REFERENCES
Computable randomness and betting for computable probability spaces
  • Jason Rute
  • Mathematics, Computer Science
  • Math. Log. Q.
  • 2016
  • 14
  • PDF
Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
  • 30
  • PDF
An Application of Martin-Löf Randomness to Effective Probability Theory
  • 37
  • PDF
Mathematical Foundations of Randomness
  • 13
  • PDF
Randomness on Computable Probability Spaces—A Dynamical Point of View
  • 48
  • PDF
Random elements in effective topological spaces with measure
  • 32
On Analogues of the Church-Turing Thesis in Algorithmic Randomness
  • 1
  • PDF
Strong reductions in effective randomness
  • 24
  • PDF
Computability and randomness
  • 564
...
1
2
3
4
5
...