COMPUTING<i>K</i>-TRIVIAL SETS BY INCOMPLETE RANDOM SETS (Q2925324)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | COMPUTING<i>K</i>-TRIVIAL SETS BY INCOMPLETE RANDOM SETS |
scientific article |
Statements
COMPUTING<i>K</i>-TRIVIAL SETS BY INCOMPLETE RANDOM SETS (English)
0 references
21 October 2014
0 references
algorithmic randomness
0 references
\(K\)-triviality
0 references
covering problem
0 references
Oberwolfach randomness
0 references
Martin-Löf-randomness
0 references
Kolmogorov complexity
0 references
Chaitin complexity
0 references
