Algorithmic randomness and monotone complexity on product space (Q627131)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5853778
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic randomness and monotone complexity on product space |
scientific article; zbMATH DE number 5853778 |
Statements
Algorithmic randomness and monotone complexity on product space (English)
0 references
21 February 2011
0 references
The author studies algorithmic randomness and monotone complexity on a product of Cantor spaces. A number of results are proved. The major one is Lambalgen's theorem for correlated probability.
0 references
algorithmic randomness
0 references
Lambalgen's theorem
0 references
monotone complexity
0 references
0.7793248891830444
0 references
0.7651185393333435
0 references
0.762376606464386
0 references
0.7598033547401428
0 references
0.7540376782417297
0 references
