Strict process machine complexity (Q403400)
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: Strict process machine complexity |
scientific article; zbMATH DE number 6335984
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strict process machine complexity |
scientific article; zbMATH DE number 6335984 |
Statements
Strict process machine complexity (English)
0 references
29 August 2014
0 references
In the paper under review, a notion called \(M\)-description for a strict process machine \(M\) is introduced. Based on this notion, the author also introduces \(M\)-complexity. The major result states that the complexity of a sequence or a subset of a Cantor space is equal to its effective Hausdorff dimension.
0 references
computability
0 references
algorithmic randomness
0 references
process complexity
0 references
0 references
0.7921904921531677
0 references
0.7508187294006348
0 references
0.7477617263793945
0 references
0.7394117712974548
0 references
