On the relation between descriptional complexity and algorithmic probability (Q1057064): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0304-3975(83)90139-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2048109154 / rank | |||
Normal rank |
Revision as of 19:07, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the relation between descriptional complexity and algorithmic probability |
scientific article |
Statements
On the relation between descriptional complexity and algorithmic probability (English)
0 references
1983
0 references
It has been conjectured that the descriptional complexity (or algorithmic entropy) of a string differs from the negative logarithm of its a priori probability (the probability that a string is the output of an optimal universal computer with random input) by at most an additive constant. This conjecture is disproved, and in fact a previously known upper bound on the difference is shown to be the best possible. The proof uses a two- person memory-allocation game between players called User and Server. User sends incremental requests for memory space, which Server allocates in a write-once memory; for each item, some of the allocated space must be in one piece, in order to give a short address. Related results are presented.
0 references
algorithmic information theory
0 references
algorithmic complexity
0 references
algorithmic probability
0 references
descriptional complexity
0 references
algorithmic entropy
0 references
two-person memory-allocation game
0 references