On characterizations of randomized computation using plain Kolmogorov complexity1 (Q4608445): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:11, 7 February 2024
scientific article; zbMATH DE number 6851263
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On characterizations of randomized computation using plain Kolmogorov complexity1 |
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
