Characterizing strong randomness via Martin-Löf randomness (Q409318): Difference between revisions
From MaRDI portal
Latest revision as of 02:21, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Characterizing strong randomness via Martin-Löf randomness |
scientific article |
Statements
Characterizing strong randomness via Martin-Löf randomness (English)
0 references
13 April 2012
0 references
The paper proposes a general way to measure the degree of algorithmic randomness stronger than Martin-Löf randomness.
0 references
Martin-Löf randomness
0 references
Kolmogorov complexity
0 references