# A Numerical Method for the Evaluation of Kolmogorov Complexity, An alternative to lossless compression algorithms

## by Hector Zenil, Research Fellow at Karolinska Institutet on *Jul 03, 2011*

**6,133**views

We present a novel alternative method (other than using compression algorithms) to approximate the algorithmic complexity of a string by calculating its algorithmic probability and applying ...

We present a novel alternative method (other than using compression algorithms) to approximate the algorithmic complexity of a string by calculating its algorithmic probability and applying Chaitin-Levin's coding theorem.

### Statistics

### Views

- Total Views
- 6,133
- Views on SlideShare
- 2,518
- Embed Views

### Actions

- Likes
- 0
- Downloads
- 17
- Comments
- 0

### Accessibility

### Categories

### Upload Details

Uploaded via SlideShare as Adobe PDF

### Usage Rights

© All Rights Reserved

No comments yet1