Strict process machine complexity (Q403400): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Liang Yu / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03D32 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6335984 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computability | |||
Property / zbMATH Keywords: computability / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithmic randomness | |||
Property / zbMATH Keywords: algorithmic randomness / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
process complexity | |||
Property / zbMATH Keywords: process complexity / rank | |||
Normal rank |
Revision as of 17:53, 29 June 2023
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