Characterizing strong randomness via Martin-Löf randomness (Q409318): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
The paper proposes a general way to measure the degree of algorithmic randomness stronger than Martin-Löf randomness. | |||
| Property / review text: The paper proposes a general way to measure the degree of algorithmic randomness stronger than Martin-Löf randomness. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Cristian S. Calude / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 03D32 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q30 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6023575 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Martin-Löf randomness | |||
| Property / zbMATH Keywords: Martin-Löf randomness / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Kolmogorov complexity | |||
| Property / zbMATH Keywords: Kolmogorov complexity / rank | |||
Normal rank | |||
Revision as of 19:12, 29 June 2023
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
