Algorithmic randomness and layerwise computability

Mathieu Hoyrup (1)

1 MOCQUA - Designing the Future of Computational Models

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.

Domaines: Logique en informatique [cs.LO]; Probabilités [math.PR]

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⟩