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
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.
Complete list of metadata

Cited literature [123 references]  Display  Hide  Download

https://hal.inria.fr/hal-02938919
Contributor : Mathieu Hoyrup Connect in order to contact the contributor
Submitted on : Tuesday, September 15, 2020 - 11:22:41 AM
Last modification on : Tuesday, April 19, 2022 - 10:05:10 AM
Long-term archiving on: : Thursday, December 3, 2020 - 5:53:04 AM

File

Chapter_HR.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Mathieu Hoyrup, Jason Rute. Computable Measure Theory and Algorithmic Randomness. Handbook of Computable Analysis, pp.227-270, 2021, 978-3-030-59234-9. ⟨10.1007/978-3-030-59234-9_7⟩. ⟨hal-02938919⟩

Share

Metrics

Record views

80

Files downloads

372