Demuth's path to randomness (Q2795307)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Demuth's path to randomness |
scientific article; zbMATH DE number 6558779
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Demuth's path to randomness |
scientific article; zbMATH DE number 6558779 |
Statements
21 March 2016
0 references
Demuth
0 references
algorithmic randomness
0 references
Demuth randomness
0 references
Denjoy alternative
0 references
semigenericity
0 references
0 references
0 references
0 references
0.8830505
0 references
0.85750645
0 references
Demuth's path to randomness (English)
0 references
This article surveys the work of Osvald Demuth, in particular, the notions of random real that he examined. The authors emphasize that Demuth was motivated by considerations of Russian-school constructive analysis, and he described these notions in terms of approximability, rather than randomness. This paper is based on an extended abstract written by \textit{A. Kučera} and \textit{A. Nies} [Lect. Notes Comput. Sci. 7160, 159--173 (2012; Zbl 1353.03047)]. However, the present version roughly triples the length of the earlier one, providing more background material and covering a wider span of Demuth's output.
0 references
