Thanks for the summaries. In:
P(A) >= h.H(A)
does the period stand for multiplication, and H(A) mean the probability of A given H?
Argument 2 is extremely powerful. Where can I find the argument spelled out?
Yes, and yes.
A classic text is Li and Vitanyi “An Introduction to Kolmogorov Complexity and it’s Applications”—see: http://homepages.cwi.nl/~paulv/kolmogorov.html
If you want an online (condensed) version but without the formal proofs, then have a look at: http://www.scholarpedia.org/article/Algorithmic_probability
Thanks for the summaries. In:
does the period stand for multiplication, and H(A) mean the probability of A given H?
Argument 2 is extremely powerful. Where can I find the argument spelled out?
Yes, and yes.
A classic text is Li and Vitanyi “An Introduction to Kolmogorov Complexity and it’s Applications”—see: http://homepages.cwi.nl/~paulv/kolmogorov.html
If you want an online (condensed) version but without the formal proofs, then have a look at: http://www.scholarpedia.org/article/Algorithmic_probability