On characterizations of randomized computation using plain Kolmogorov complexity (Q4608445)
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: On characterizations of randomized computation using plain Kolmogorov complexity |
scientific article; zbMATH DE number 6851263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On characterizations of randomized computation using plain Kolmogorov complexity |
scientific article; zbMATH DE number 6851263 |
Statements
On characterizations of randomized computation using plain Kolmogorov complexity1 (English)
0 references
16 March 2018
0 references
Kolmogorov complexity
0 references
randomness
0 references
truth-table reductions
0 references
0.995560586452484
0 references
0.846308708190918
0 references
0.8420360684394836
0 references
0.8275090456008911
0 references
