A coding theorem for enumerable output machines (Q2390302): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the relation between descriptional complexity and algorithmic probability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4337021 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank | |||
Normal rank | |||
Latest revision as of 20:02, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A coding theorem for enumerable output machines |
scientific article |
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
