# Algorithmic information theory

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- 12th International Joint Conference on e-Business…
- 2015

The main problem in designing effective code obfuscation is to guarantee security. State of the art obfuscation techniques rely… (More)

Is this relevant?

2010

2010

- Open Syst. Inform. Dynam.
- 2010

A recent method for causal discovery is in many cases able to infer whether X causes Y or Y causes X for just two observed… (More)

Is this relevant?

Review

2009

Review

2009

- RP
- 2009

The question how and why mathematical probability theory ca n be applied to the “real world” has been debated for centuries. We… (More)

Is this relevant?

2007

2007

- Scholarpedia
- 2007

We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of… (More)

Is this relevant?

2007

2007

- 2007

This document contains lecture notes of an introductory course on Kolmogorov complexity. They cover basic notions of algorithmic… (More)

Is this relevant?

2003

2003

- DMTCS
- 2003

Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size… (More)

Is this relevant?

2000

2000

- Synthese
- 2000

Algorithmic information theory, or the theory of Kolmogorov complexity, has become an extraordinarily popular theory, and this is… (More)

Is this relevant?

1998

1998

- Neurocomputing
- 1998

Previous approaches for the blind source separation problem have used independent component analysis making the separated… (More)

Is this relevant?

1982

1982

- ArXiv
- 1982

We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of… (More)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- IBM Journal of Research and Development
- 1977

Is this relevant?