
Be the first to like this
Published on
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 ChaitinLevin's coding theorem.
Clipping is a handy way to collect important slides you want to go back to later.
Be the first to comment