Characterizing strong randomness via Martin-Löf randomness (Q409318)
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 6023575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing strong randomness via Martin-Löf randomness |
scientific article; zbMATH DE number 6023575 |
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
