A computable version of the random signs problem and Kolmogorov complexity (Q2568322)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computable version of the random signs problem and Kolmogorov complexity |
scientific article |
Statements
A computable version of the random signs problem and Kolmogorov complexity (English)
0 references
10 October 2005
0 references
