Skip to Main content Skip to Navigation
Book sections

Computable Measure Theory and Algorithmic Randomness

Mathieu Hoyrup 1 Jason Rute 2
1 MOCQUA - Designing the Future of Computational Models
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
2 Department of Mathematics [Penn State University]
Abstract : We provide a survey of recent results in computable measure and probability theory, from both the perspectives of computable analysis and algorithmic randomness, and discuss the relations between them.
Document type :
Book sections
Complete list of metadata

Cited literature [123 references]  Display  Hide  Download
https://hal.inria.fr/hal-02938919
Contributor : Mathieu Hoyrup <>
Submitted on : Tuesday, September 15, 2020 - 11:22:41 AM
Last modification on : Wednesday, September 16, 2020 - 3:35:44 AM
Long-term archiving on: : Thursday, December 3, 2020 - 5:53:04 AM

File

Vignette du document
Chapter_HR.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02938919, version 1

Collections

INSMI | UNIV-LORRAINE | INRIA | LORIA | LORIA-FM | CNRS

Citation

Mathieu Hoyrup, Jason Rute. Computable Measure Theory and Algorithmic Randomness. Handbook of Computable Analysis, In press. ⟨hal-02938919⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

74

Files downloads

288

 

Contact                    Legal Notice                    Personal Data