A computable version of the random signs problem and Kolmogorov complexity (Q2568322)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A computable version of the random signs problem and Kolmogorov complexity |
scientific article; zbMATH DE number 2213046
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computable version of the random signs problem and Kolmogorov complexity |
scientific article; zbMATH DE number 2213046 |
Statements
A computable version of the random signs problem and Kolmogorov complexity (English)
0 references
10 October 2005
0 references
