Collection Nexus Trimester - 2016 - Distributed Computation and Communication Theme
Organisateur(s)
Date(s)
19/05/2024
Relation between monotonic complexity and algorithmic probability (1)
De Péter Gács
Some versions of Kolmogorov complexity are better suited than others when regarding finite sequences as starting segments of infinite sequences. Levin and Schnorr introduced monoton complexity, while Solomonoff and Levin introduced algorithmic probability, the distribution at the output of a universal monotonic machine reading a random coin-tossing input sequence. Monotonic complexity and the negative logarithm of algorithmic probability are very closely related, but can still be distinguished – as an old result of the author showed, using a game argument. The talk will survey the result and its proof, the significant improvement by Adam Day, and the open questions.
