×
  • Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
 

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

by 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
3,615

Actions

Likes
0
Downloads
17
Comments
0

7 Embeds 3,615

http://www.mathrix.org 3605
http://webcache.googleusercontent.com 3
http://hectorzenil.com 2
http://www.slashdocs.com 2
http://mathrix.neomesis.com 1
http://www.hectorzenil.com 1
http://translate.googleusercontent.com 1
More...

Accessibility

Categories

Upload Details

Uploaded via SlideShare as Adobe PDF

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
Post Comment
Edit your comment

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