Strict process machine complexity (Q403400): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:10, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strict process machine complexity |
scientific article |
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
