\(L^1\)-computability, layerwise computability and Solovay reducibility (Q2851186)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6214532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(L^1\)-computability, layerwise computability and Solovay reducibility |
scientific article; zbMATH DE number 6214532 |
Statements
10 October 2013
0 references
algorithmic randomness
0 references
computable analysis
0 references
\(L^1\)-computability
0 references
layerwise computability
0 references
Solovay reducibility
0 references
0 references
0.89118505
0 references
0.8806354
0 references
0.8660922
0 references
0.8630209
0 references
0.8628083
0 references
0.86244357
0 references
0.8617098
0 references
0 references
0.8599797
0 references
\(L^1\)-computability, layerwise computability and Solovay reducibility (English)
0 references
In this paper, the author studies how several notions of randomness relate to classes of functions. The notions of randomness which are considered in this paper are: weak 2-randomness, Martin-Löf randomness, Schnorr randomness and Kurtz randomness. These randomness notions are characterized in several ways. In particular, weak 2-randomness and Schnorr randomness are characterized via integral tests. The author also relates several notions of \(L^1\)-computability to the difference of two integral tests for Schnorr randomness, for Martin-Löf randomness, and for weak 2-randomness. Solovay reducibility for lower semicomputable functions is also considered as well as its connections to the randomness notions mentioned above.
0 references
