Work

Conditional Kolmogorov Complexity and Universal Probability

Year: 2012

Type: other

Abstract: The Coding Theorem of L.A. Levin connects unconditional prefix Kolmogorov complexity with the discrete universal distribution. There are conditional versions referred to in several publications but as yet there exist no written proofs in English. Here we provide those proofs. They use a different definition than the standard one for the conditional version of the discrete universal distribution. Under the classic definition of conditional probability, there is no conditional version of the Coding Theorem.

Source: Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands

DOI: 10.48550/arxiv.1206.0983

Author: Vitanyi, Paul M. B.

Institutions: Centrum Wiskunde & Informatica, University of Amsterdam

Language: English

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2582510179

Cites:

Cited by:

Related to: 20