Algorithmic randomness and layerwise computability - Archive ouverte HAL Access content directly
Book Sections Year : 2020

Algorithmic randomness and layerwise computability

Mathieu Hoyrup
Designing the Future of Computational Models
CV

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.

Domains

Computer Science [cs] Logic in Computer Science [cs.LO] Mathematics [math] Probability [math.PR]
Fichier principal
Vignette du fichier
final.pdf (286.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Mathieu Hoyrup  : Connect in order to contact the contributor

https://hal.inria.fr/hal-02975222

Submitted on : Thursday, October 22, 2020-3:00:56 PM

Last modification on : Friday, March 24, 2023-2:53:19 PM

Long-term archiving on: Saturday, January 23, 2021-7:38:20 PM

Download

Dates and versions

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

Identifiers

Cite

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⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS INRIA INSMI UNIV-LORRAINE INRIA2 LORIA LORIA-FM
28 View
160 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More