Kolmogorov complexity for possibly infinite computations (Q1777368)
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: Kolmogorov complexity for possibly infinite computations |
scientific article; zbMATH DE number 2168170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kolmogorov complexity for possibly infinite computations |
scientific article; zbMATH DE number 2168170 |
Statements
Kolmogorov complexity for possibly infinite computations (English)
0 references
13 May 2005
0 references
infinite computations
0 references
Kolmogorov complexity
0 references
monotone machines
0 references
non-effective computations
0 references
program-size complexity
0 references
Turing machines
0 references
0 references
0.822030782699585
0 references
0.8017646074295044
0 references
0.7814813256263733
0 references
0.7772059440612793
0 references
