Algorithmic randomness and layerwise computability - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2020

Algorithmic randomness and layerwise computability


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.
Fichier principal
Vignette du fichier
final.pdf (286.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02975222 , version 1 (22-10-2020)



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⟩
30 View
187 Download



Gmail Facebook X LinkedIn More