Skip to Main content Skip to Navigation
Book sections

Algorithmic randomness and layerwise computability

Mathieu Hoyrup 1
1 MOCQUA - Designing the Future of Computational Models
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : In this article we present the framework of layerwise computability. We explain the origin of this notion, its main features and properties, and we illustrate it with several concrete examples: decomposition of measures, random closed sets, Brownian motion.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/hal-02975222
Contributor : Mathieu Hoyrup <>
Submitted on : Thursday, October 22, 2020 - 3:00:56 PM
Last modification on : Friday, October 23, 2020 - 3:32:47 AM

File

final.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Mathieu Hoyrup. Algorithmic randomness and layerwise computability. Johanna N. Y. Franklin; Christopher P. Porter. Algorithmic Randomness -- Progress and Prospects, Cambridge University Press, pp.17, 2020, ⟨10.1017/9781108781718⟩. ⟨hal-02975222⟩

Share

Metrics

Record views

17

Files downloads

67