A coding theorem for enumerable output machines (Q2390302)
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: A coding theorem for enumerable output machines |
scientific article; zbMATH DE number 5581166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A coding theorem for enumerable output machines |
scientific article; zbMATH DE number 5581166 |
Statements
A coding theorem for enumerable output machines (English)
0 references
21 July 2009
0 references
coding theorem
0 references
Kolmogorov complexity
0 references
algorithmic information theory
0 references
enumerable output machine
0 references
theory of computation
0 references
0 references
0.8608599
0 references
0.85353684
0 references
0.8475516
0 references
0.8457172
0 references
0.84564805
0 references
0.84357905
0 references
0 references
0.84286475
0 references
